Introduction to Convex Optimization

Fall 2009

This course aims to give students the tools and training to recognize convex optimization problems that arise in scientific and engineering applications, presenting the basic theory, and concentrating on modeling aspects and results that are useful in applications. Topics include convex sets, convex functions, optimization problems, least-squares, linear and quadratic programs, semidefinite programming, optimality conditions, and duality theory. Applications to signal processing, control, machine learning, finance, digital and analog circuit design, computational geometry, statistics, and mechanical engineering are presented. Students complete hands-on exercises using high-level numerical software. Acknowledgements ---------------- The course materials were developed jointly by {{% resource_link "143ab01f-02d7-4e9f-ba52-daed4c2070ed" "Prof. Stephen Boyd" %}} (Stanford), who was a visiting professor at MIT when this course was taught, and {{% resource_link "957b76dd-f8ec-4441-a6c4-938412ea2b83" "Prof. Lieven Vanderberghe" %}} (UCLA).