Min common/max crossing problems. See Lectures 8–9 for more information. (Image by MIT OpenCourseWare.)
Instructor(s)
Prof. Dimitri Bertsekas
MIT Course Number
6.253
As Taught In
Spring 2012
Level
Graduate
Course Description
Course Features
Course Description
This course will focus on fundamental subjects in convexity, duality, and convex optimization algorithms. The aim is to develop the core analytical and algorithmic issues of continuous optimization, duality, and saddle point theory using a handful of unifying principles that can be easily visualized and readily understood.
Other Versions
Other OCW Versions
Archived versions: 