everything.study
MATH 661.01

Convex Optimization

3 credits · Graduate Programs

An introduction to modern convex optimization, including basics of convex analysis and duality, linear conic programming, robust optimization, and applications. Prerequisite(s): Admission to a graduate program in Mathematics and Statistics or consent of the Department.

Sources