2018

Heure:	12:30 - 13:30
Lieu:	Salle B107, bâtiment B, Université de Villetaneuse
Résumé:	Strong and Cheap SDP and SOCP Hierarchies for Polynomi al Optimization
Description:	Bissan Ghaddar In this talk, we propose alternative SDP and SOCP approximation hierarchies to obtain global bounds for general polynomial optimization problems (POP), by using SOS, and SDSOS polynomials to strengthen existing hierarchies for POPs. Specifically, we show that the resulting approximations are substantially more effective in finding solutions of certain POPs for which the more common hierarchies of SDP relaxations are known to perform poorly. Numerical results based on the proposed hierarchies are presented on non-convex instances form the literature as well as on instances from the GLOBAL Library.