everything.study
6.253

Convex Analysis and Optimization

Graduate · Historical course

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

Sources