Victor Magron, LAAS-CNRS, France, The quest of efficiency and certification in polynomial optimization
ZoomIn 2001, Lasserre introduced a nowadays famous hierarchy of relaxations, called the moment-sums of squares hierarchy, allowing one to obtain a converging sequence of lower bounds for the minimum of a polynomial over a compact semialgebraic set. Each lower bound is computed by solving a semidefinite program (SDP). There are two common drawbacks related to…