Skip to main content
Princeton Mobile homeCourses home

Convex and Conic Optimization

ORF 523

Info tab content
A mathematical introduction to convex, conic, and nonlinear optimization. Topics include convex analysis, duality, theorems of alternatives and infeasibility certificates, semidefinite programming, polynomial optimization, sum of squares relaxation, robust optimization, computational complexity in numerical optimization, and convex relaxations in combinatorial optimization. Applications drawn from operations research, dynamical systems, statistics, and economics.
Instructors tab content
Sections tab content

Section L01