Linear optimization with cones of moments and nonnegative polynomials (Q745685)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Linear optimization with cones of moments and nonnegative polynomials |
scientific article |
Statements
Linear optimization with cones of moments and nonnegative polynomials (English)
0 references
14 October 2015
0 references
This paper studies properties of the cone of polynomials and its dual cone by characterizing their interiors, proving their closeness and dual relationship. A convergent hierarchy of semidefinite relaxations for each of them is constructed. A semidefinte algorithm is proposed to solve linear optimization problems with the two cones. The asymptotic and finite convergence of the algorithm is established. The author shows that if the optimization problems are feasible then a feasible point is obtained, otherwise a certificate for the infeasibility is provided.
0 references
moment
0 references
nonnegative polynomial
0 references
representing measure
0 references
semidefinite program
0 references
sum of squares
0 references
truncated moment sequence
0 references
algorithm
0 references
linear optimization
0 references
convergence
0 references
0 references
0 references
