Optimality conditions and finite convergence of Lasserre's hierarchy (Q403636)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Optimality conditions and finite convergence of Lasserre's hierarchy |
scientific article; zbMATH DE number 6336099
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimality conditions and finite convergence of Lasserre's hierarchy |
scientific article; zbMATH DE number 6336099 |
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
0 references
0.8728076219558716
0 references
0.838042140007019
0 references
0.8295426368713379
0 references
0.8252591490745544
0 references
0.8111989498138428
0 references
