Advanced Mathematical Programming

This module is designed for graduate students in mathematics. It covers the following major topics: Introduction to convex analysis; Theory of constrained optimization; Lagrangian duality; Algorithms for constrained optimization, in particular, penalty, barrier and augmented Lagrangian methods; Interior-point methods for convex programming, in particular, linear and semidefinite programming.

Login Required