Certifying convergence of Lasserre's hierarchy via flat truncation (Q2434992): Difference between revisions
From MaRDI portal
Removed claims |
Changed an Item |
||
| Property / author | |||
| Property / author: Jia-Wang Nie / rank | |||
Normal rank | |||
| Property / reviewed by | |||
| Property / reviewed by: Guo-Qiang Wang / rank | |||
Normal rank | |||
Revision as of 10:26, 11 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Certifying convergence of Lasserre's hierarchy via flat truncation |
scientific article |
Statements
Certifying convergence of Lasserre's hierarchy via flat truncation (English)
0 references
3 February 2014
0 references
In this paper, the author presents a new typical approach for solving the optimization of minimizing a polynomial optimization subject to polynomial constraints. The certificate for checking finite and asymptotical convergence of Lassees's hierarchy based on either Putinar's or Schmudgens's Positivstellensatz is established. The author also proves that flat truncation can be used as a certificate to check exactness of standard SOS relaxations and Jacobin SDP relaxations.
0 references
flat truncation
0 references
Lasserre's hierarchy
0 references
quadratic module
0 references
preordering
0 references
semidefinite program
0 references
sum of squares
0 references
