6.253 Convex Analysis and Optimization, Spring 2010
Name
6-253-spring-2010/contents/index.htm
Size
28.14 KB
Format
HTML
Checksum (MD5)
0aad4b2f2fd7f23aecf7ff84b4aa894b
Author(s)
Bertsekas, Dimitri
Alternative Title
Convex Analysis and Optimization
Date Issued
June 2010
Abstract
This course will focus on fundamental subjects in (deterministic) optimization, connected through the themes of convexity, geometric multipliers, and duality. The aim is to develop the core analytical and computational issues of continuous optimization, duality, and saddle point theory using a handful of unifying principles that can be easily visualized and readily understood. The mathematical theory of convex sets and functions will be central, and will allow an intuitive, highly visual, geometrical approach to the subject. This theory will be developed in detail and in parallel with the optimization topics. The first part of the course develops the analytical issues of convexity and duality. The second part is devoted to convex optimization algorithms, and their applications to a variety of large-scale optimization problems from resource allocation, machine learning, engineering design, and other areas.
Subjects
convexity
optimization
geometric duality
Lagrangian duality
Fenchel duality
cone programming
semidefinite programming
subgradients
constrained optimization
gradient projection
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Persistent DSpace Link
