Title: Asymptotic Error Bounds for Control Constrained Singularly Perturbed Linear Quadratic Optimal Control ProblemsSpeaker: Sei HoweAffiliation: Department of Computing - Imperial College LondonLocation: Huxley BuildingTime: 4:00pmAbstract. About the speaker. Sei Howe is a PhD student in the QUADS group at Imperial College. She received her B.A in pure mathematics from Reed College, USA in 2011... Read more »

Title: Symmetry Groups and Topological Structure of Optimisation ProblemsSpeaker: Georgia KouyialisAffiliation: Department of Computing - Imperial College LondonLocation: Huxley BuildingTime: 5:00pmAbstract. About the speaker. Georgia Kouyialis is a PhD student in the Department of Computing (QUADS group), at Imperial College, under the supervision of Dr. Ruth Misener. She obtained the MSci (Hons) degree in Mathematics... Read more »

Title: Scheduling Algorithms for Energy Efficiency in Computing SystemsSpeaker: Dimitrios LetsiosAffiliation: Department of Computing - Imperial College LondonLocation: Huxley BuildingTime: 3:00pmAbstract. Energy consumption of computing devices has become an important issue nowadays. A major tool for efficient energy management in the system level is dynamic speed (frequency) scaling combined with job scheduling. In this context,... Read more »

Title: Mixed-integer convex optimizationSpeaker: Miles LubinAffiliation: Massachusetts Institute of TechnologyLocation: Room 217 Huxley BuildingTime: 3:00pmAbstract. Mixed-integer convex optimization problems are convex problems with the additional (non-convex) constraints that some variables may take only integer values. Despite the past decades' advances in algorithms and technology for both mixed-integer *linear* and *continuous, convex* optimization, mixed-integer convex optimization... Read more »

Title: Pooling Problems: Advances in Theory and ApplicationsSpeaker: Fabian RigterinkAffiliation: School of Mathematical and Physical Sciences - The University of Newcastle AustraliaLocation: Room 554 Huxley BuildingTime: 3:00pmAbstract. The pooling problem is a nonconvex nonlinear programming problem with important applications. The nonlinearities of the problem arise from bilinear constraints that capture the blending of raw materials.... Read more »

Title: Optimisation with occasionally accurate data Speaker: Coralia Cartis Affiliation: Mathematical Institute - Oxford and Balliol College Location: Huxley building Time: 2:00pm (1 hour) Abstract. We present global rates of convergence for a general class of methods for nonconvex smooth optimization that include linesearch, trust-region and regularisation strategies, but that allow inaccurate problem information. Namely, we... Read more »

Title: On the Passage From Local to Global in Optimization - New Challenges in Theory and Practice Speaker: Prof. Panos M. Pardalos Affiliation: Departments of Industrial and Systems and Biomedical Engineering - University of Florida Location: Room 145 Huxley Building Time: 4:30pm (1 hour) Abstract. Large scale problems in the design of networks, energy systems, medicine and drug design,... Read more »

Title: On Robust Selection Problems Speaker: Marc Goerigk Affiliation: Department of Management Science - Lancaster University Location: Room LT1 Business School Time: 2:30pm (1 hour) Abstract. Robust optimisation considers problems that are affected by uncertain data: How can we find a solution that performs well, even if things don't go quite as planned? Typically, adding... Read more »

Title: Solution of an old problem in vector optimisation - Support function of the generalised Jacobian Speaker: Prof. Abbas Edalat Affiliation: Department of Computing - Imperial College Location: Room 217 Huxley Building Time: 3:00pm (1 hour) Abstract. Many optimisation problems are non-smooth in the sense that the objective function is not differentiable. This is invariably the case in many... Read more »

Title: On Bit Representations of Mixed-Integer Quadratic Programs. Speaker: Prof. Adam Letchford Affiliation: Management School - Lancaster University Location: Room 217 Huxley Building Time: 3:00pm (1 hour) Abstract. A standard trick in integer programming is to replace each bounded general-integer variable with a small number of binary variables, using the bit representation of the given variable.... Read more »