On the Lasserre Hierarchy of Semidefinite Programming Relaxations of Convex Polynomial Optimization Problems
On the Lasserre Hierarchy of Semidefinite Programming Relaxations of Convex Polynomial Optimization Problems
The Lasserre hierarchy of semidefinite programming approximations to convex polynomial optimization problems is known to converge finitely under some assumptions. [J. B. Lasserre, Convexity in semialgebraic geometry and polynomial optimization, SIAM J. Optim., 19 (2009), pp. 1995–2014]. We give a new proof of the finite convergence property under weaker assumptions …