6.253
Convex Analysis and Optimization
Spring 2012
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.
Readings
- Bertsekas, Dimitri, Angelia Nedic, and Asuman Ozdaglar. Convex Analysis and Optimization . Athena Scientific, 2003. ISBN: 9781886529458.
Sources
- Course catalogue ↗Historical OpenCourseWare
- MIT OCW syllabus ↗
- Historical MIT OpenCourseWare offering. Named reading entries and schedule topics are automatically extracted from the linked source pages.