An introduction to modern convex optimization, including basics of convex analysis and duality, linear conic programming, robust optimization, and applications.
This course may not be repeated for credit.
Prerequisite(s)
- Admission to a graduate program in Mathematics and Statistics or consent of the Department.
Sections