Optimality conditions and finite convergence of Lasserre's hierarchy (Q403636): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: GloptiPoly / rank | |||
Normal rank | |||
Revision as of 16:13, 28 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Optimality conditions and finite convergence of Lasserre's hierarchy |
scientific article |
Statements
Optimality conditions and finite convergence of Lasserre's hierarchy (English)
0 references
29 August 2014
0 references
This paper studies the relationship between the classic nonlinear programming theory and Lasserre's hierarchy of semidefinite relaxations in polynomial optimization. Under some mild conditions, the author proves that Lasserre's hierarchy has finite convergence.
0 references
Lasserre's hierarchy
0 references
optimality conditions
0 references
polynomial optimization
0 references
semidefinite program
0 references
sum of squares
0 references
finite convergence
0 references
