-
-
Courses
Find courses by:
Collections
Cross-Disciplinary Topic Lists
Translated Courses
-
About
-
Donate
-
Featured Sites
Min common/max crossing problems. See Lectures 8–9 for more information. (Image by MIT OpenCourseWare.)
Prof. Dimitri Bertsekas
6.253
Spring 2012
Graduate
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.
MIT OpenCourseWare makes the materials used in the teaching of almost all of MIT's subjects available on the Web, free of charge. With more than 2,000 courses available, OCW is delivering on the promise of open sharing of knowledge.
© 2001–2012
Massachusetts Institute of Technology
Your use of the MIT OpenCourseWare site and materials is subject to our Creative Commons License and other terms of use.
