
Michael J. Todd: Lectures
Semidefinite Programming:
Applications, Duality, and InteriorPoint Methods. Sensitivity analysis in linear programming and semidefinite
programming using interiorpoint methods. Sensitivity analysis in semidefinite
programming using interiorpoint methods. The many facets of linear programming. Boris Polyak's talk on the history of mathematical programming in
the USSR.
Plenary lecture at the 17th International Symposium
on Mathematical Programming, Atlanta, August 2000. Detecting infeasibility in infeasibleinteriorpoint methods for
optimization. Conic programming. Largest dual ellipsoids inscribed in dual cones. Inexact primaldual pathfollowing algorithms for certain
quadratic SDPs. On minimumvolume ellpsoids: from John and KieferWolfowitz to
Khachiyan and NesterovNemirovski. Leonid Khachiyan's contributions to mathematical programming
beyond LP \in P. Minimum volume ellipsoids: applications, duality, and applications. Conic optimization: interiorpoint methods and beyond. 