MMA511 Large-Scale Optimization 7.5 hec

This course in optimization primarily treats large-scale, difficult, and often combinatorial optimization problems. You will study different methods of tackling such problems, through a lecture series and working on projects in a group. You will also touch on current research topics such as optimality conditions for non-convex optimization, column generation, and Lagrange duality. The course will conclude with an algorithm contest, where you compete by choosing the best and/or quickest approach to solving a problem!
The course is given
  • in the second half of autumn
  • jointly with Chalmers TMA521
  • same course as MMA510


Course information 2019

Course information 2018


Course information 2017


Course information 2015


Course information 2013


Published: Tue 18 Feb 2020.