Semidefinite and Combinatorial Optimization

Catalog description

The course provides an introduction to basic mathematical theory and computational methods for semidefinite optimization with a particular focus on polynomial optimization problems. Topics include: duality, semialgebraic sets, polynomial optimization, sum of squares, spectrahedron, semidefinite relaxation, combinatorial optimization. Prerequisites: Math 0520, 0540, or equivalent, basic programming skills. Math 1530 is recommended.