BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Computational Optimisation Group - ECPv6.15.11//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:Computational Optimisation Group
X-ORIGINAL-URL:https://optimisation.doc.ic.ac.uk
X-WR-CALDESC:Events for Computational Optimisation Group
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:UTC
BEGIN:STANDARD
TZOFFSETFROM:+0000
TZOFFSETTO:+0000
TZNAME:UTC
DTSTART:20150101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=UTC:20160503T160000
DTEND;TZID=UTC:20160503T160000
DTSTAMP:20260405T190239
CREATED:20170124T102133Z
LAST-MODIFIED:20170124T102133Z
UID:539-1462291200-1462291200@optimisation.doc.ic.ac.uk
SUMMARY:Seminar: Multi-Level Accelerated Algorithm for Large-Scale Convex Composite Minimization
DESCRIPTION:Title: Multi-Level Accelerated Algorithm for Large-Scale Convex Composite MinimizationSpeaker: Vahan HovhannisyanAffiliation: Department of Computing – Imperial College LondonLocation: Room 418 Huxley BuildingTime: 4:00pm \nAbstract. We propose a multi-level algorithm for solving convex composite optimization problems. Our method exploits the fact that many applications that give rise to large-scale problems can be modelled using varying degrees of fidelity. We show that it converges to a minimizer with optimal rate. Using numerical experiments we show that on large-scale computer vision problems our algorithm is several times faster than the state of the art. \nAbout the speaker. Vahan Hovhannisyan is a PhD student in the QUADS group at Imperial College\, under the supervision of Dr Panos Parpas. He received a BS in Applied Mathematics from the State Engineering University of Armenia and an MSc in Applied Mathematical (with application area in operations management) from ETH Zurich. His research interests are convex robust optimization with applications in machine learning.
URL:https://optimisation.doc.ic.ac.uk/event/seminar-multi-level-accelerated-algorithm-for-large-scale-convex-composite-minimization/
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=UTC:20160503T170000
DTEND;TZID=UTC:20160503T170000
DTSTAMP:20260405T190239
CREATED:20170124T102132Z
LAST-MODIFIED:20170124T102132Z
UID:538-1462294800-1462294800@optimisation.doc.ic.ac.uk
SUMMARY:Seminar: Integrating Mixed Integer Optimisation and Logic with Satisfiability Modulo Theories
DESCRIPTION:Title: Integrating Mixed Integer Optimisation and Logic with Satisfiability Modulo TheoriesSpeaker: Miten MistryAffiliation: Department of Computing – Imperial College LondonLocation: Room 418 Huxley BuildingTime: 5:00pm \nAbstract. Mixed integer optimisation problems\, especially those involving design or organisation\, often have an inherent logical structure. Existing frameworks to model and utilise such structure reformulate the problem into a mixed integer model or make use of specialised constraints. Using the application of two-dimensional bin packing\, we explore Satisfiability Modulo Theories (SMT) as a means to exploit logical structure. The logical connectives and reasoning provided by SMT allows us to derive cuts to strengthen a Mixed Integer Linear Programming (MILP) solver and\, by using unsatisfiability proofs\, identify new ways of traversing the search tree. \nAbout the speaker. Miten Mistry is a PhD student in the Department of Computing (QUADS group) at Imperial College London\, under the supervision of Dr Ruth Misener. He received EPSRC HiPEDs CDT funding. He previously obtained a MEng Mathematics and Computer Science degree from Imperial College London.
URL:https://optimisation.doc.ic.ac.uk/event/seminar-integrating-mixed-integer-optimisation-and-logic-with-satisfiability-modulo-theories/
END:VEVENT
END:VCALENDAR