Journal
MATHEMATICAL PROGRAMMING
Volume 146, Issue 1-2, Pages 97-121Publisher
SPRINGER HEIDELBERG
DOI: 10.1007/s10107-013-0680-x
Keywords
Lasserre's hierarchy; Optimality conditions; Polynomial optimization; Semidefinite program; Sum of squares
Categories
Funding
- NSF [DMS-0757212, DMS-0844775]
- Direct For Mathematical & Physical Scien
- Division Of Mathematical Sciences [0844775] Funding Source: National Science Foundation
Ask authors/readers for more resources
Lasserre's hierarchy is a sequence of semidefinite relaxations for solving polynomial optimization problems globally. This paper studies the relationship between optimality conditions in nonlinear programming theory and finite convergence of Lasserre's hierarchy. Our main results are: (i) Lasserre's hierarchy has finite convergence when the constraint qualification, strict complementarity and second order sufficiency conditions hold at every global minimizer, under the standard archimedean condition; the proof uses a result of Marshall on boundary hessian conditions. (ii) These optimality conditions are all satisfied at every local minimizer if a finite set of polynomials, which are in the coefficients of input polynomials, do not vanish at the input data (i.e., they hold in a Zariski open set). This implies that, under archimedeanness, Lasserre's hierarchy has finite convergence generically.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available