BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Computational Optimisation Group - ECPv6.15.11//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
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:20160517T160000
DTEND;TZID=UTC:20160517T160000
DTSTAMP:20260404T145154
CREATED:20170124T102132Z
LAST-MODIFIED:20170124T102132Z
UID:537-1463500800-1463500800@optimisation.doc.ic.ac.uk
SUMMARY:Seminar: On the Convergence of Galerkin Type Multilevel Optimization Methods
DESCRIPTION:Title: On the Convergence of Galerkin Type Multilevel Optimization MethodsSpeaker: Chin Pang Ho (Clint)Affiliation: Department of Computing – Imperial College LondonLocation: Huxley BuildingTime: 4:00pm \nAbstract.  \nAbout the speaker. Chin Pang Ho (Clint) is a PhD student in the Department of Computing (QUADS group) at Imperial College\, under the supervision of Dr Panos Parpas. He received a BS in Applied Mathematics from the University of California\, Los Angeles and an MSc in Mathematical Modeling and Scientific Computing from the University of Oxford.
URL:https://optimisation.doc.ic.ac.uk/event/seminar-on-the-convergence-of-galerkin-type-multilevel-optimization-methods/
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=UTC:20160517T170000
DTEND;TZID=UTC:20160517T170000
DTSTAMP:20260404T145154
CREATED:20170124T102131Z
LAST-MODIFIED:20170124T102131Z
UID:536-1463504400-1463504400@optimisation.doc.ic.ac.uk
SUMMARY:Seminar: A Parametric Approach to Solving the Pooling Problem
DESCRIPTION:Title: A Parametric Approach to Solving the Pooling ProblemSpeaker: Radu Baltean LugojanAffiliation: Department of Computing – Imperial College LondonLocation: Huxley BuildingTime: 5:00pm \nAbstract. We develop an algorithm solving specialised pooling problem instances and generating cutting planes for more generic instances. The approach parameterises the optimisation problem with respect to the pool concentration variables and uncovers embedded sparsity and polyhedral/topological properties for a variety of instances. The presentation generalises and extends recent work analysing computational complexity of the pooling problem [Boland et al. 2015\, Haugland 2016]. Our analysis also integrates source-to-output streams and both upper and lower bounds on the network parameters. \nAbout the speaker. Radu Baltean-Lugojan is a PhD student in the Department of Computing (QUADS group) at Imperial College London\, under the supervision of Dr. Ruth Misener and Dr. Panos Parpas. He received EPSRC funding\, and previously obtained the MEng Computing degree from Imperial College London.
URL:https://optimisation.doc.ic.ac.uk/event/seminar-a-parametric-approach-to-solving-the-pooling-problem/
END:VEVENT
END:VCALENDAR