Fetching the paper…
Reading the bibliography…
A polynomial optimization problem (POP) consists of minimizing a multivariate real polynomial on a semi-algebraic set $K$ described by polynomial inequalities and equations.
Optimisation globale et théorie des moments
J. B. Lasserre · 2000
Earlier work this paper cites.
Duality, optimality conditions and perturbation analysis
A. Shapiro · 2000
Earlier work this paper cites.
Global optimization with polynomials and the problem of moments
J. B. Lasserre · 2001
Earlier work this paper cites.
Detecting global optimality and extracting solutions in GloptiPoly
D. Henrion, J. B. Lasserre · 2005
Cited alongside, same era.
Optimization of polynomials on compact semialgebraic sets
M. Schweighofer · 2005
Cited alongside, same era.
Strong duality conditions in semidefinite programming
M. Trnovská · 2005
Cited alongside, same era.
Inner approximations for polynomial matrix inequalities and robust stability regions
D. Henrion, J. B. Lasserre · 2012
Later among the works it cites.
Strange behaviors of interior-point methods for solving semidefinite programming problems in polynomial optimization
H. Waki, M. Nakata, M. Muramatsu · 2012
Later among the works it cites.
Optimality conditions and finite convergence of Lasserre’s hierarchy
J. Nie · 2014
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…