tomorrow: sdp hierarchies for polynomial programs

[Shiva Kaul]

Tomorrow's lecture is about minimizing polynomials subject to polynomial inequality constraints - a very general class of non-convex problems. We'll try to encode them as SDPs via a gruesome hack. Amazingly, this hack can work perfectly. The explanation involves conic duality and deep questions in algebraic geometry.