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 …
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.
Course Info
Learning Resource Types
assignment_turned_in
Problem Sets with Solutions
grading
Exams with Solutions
notes
Lecture Notes
Min common/max crossing problems. See Lectures 8–9 for more information. (Image by MIT OpenCourseWare.)
