Spring 2019

Tight Semidefinite Programming Relaxations for Polynomial Optimization

Tuesday, Apr. 30, 2019 2:15 pm3:00 pm PDT

Add to Calendar


Jiawang Nie (UC San Diego)

This talk presents a tight semidefinite programming relaxation for solving polynomial optimization. Optimality conditions in polynomial optimization are investigated. For general polynomials, we show that Lagrange multipliers can be expressed as polynomial functions in decision variables over the set of critical points. Based on these expressions, we construct tight semidefinite programming relaxations.