Moment approximations for set-semidefinite polynomials
The paper provides outer approximations to the set of set-semidefinite polynomials which, by definition, is the set of polynomials that are nonnegative over a subset of the nonnegative orthant. Further specifications of the polynomials are permitted. Set-semidefinite polynomials have applications, for example, in combinatorial optimization, signal processing, quantum mechanics, and statistics. In their analysis the authors relate to results of \textit{J. B. Lasserre} [SIAM J. Optim. 21, No. 3, 864--885 (2011; Zbl 1242.90176)] who previously used moments to provide an outer approximation of the set of polynomials which are nonnegative over a general closed subset of the real space. Through restriction to completely positive moment matrices, a new outer approximation hierarchy for the set of set-semidefinite polynomials can be provided. The ideas used yield new insights into the application of moments for the construction of such type of approximations. The convergence of the proposed hierarchies is demonstrated for some small-scale examples.
- A New Look at Nonnegativity on Closed Sets and Polynomial Optimization
- LMI Approximations for Cones of Positive Semidefinite Forms
- Linear optimization with cones of moments and nonnegative polynomials
- Positive polynomials and semidefinite programming
- A Sum of Squares Approximation of Nonnegative Polynomials
- A Copositive Programming Approach to Graph Partitioning
- A New Look at Nonnegativity on Closed Sets and Polynomial Optimization
- A variational approach to copositive matrices
- Approximation of the stability number of a graph via copositive programming
- Copositive and semidefinite relaxations of the quadratic assignment problem
- Copositive optimization -- recent developments and applications
- Copositive programming
- Erratum to: ``On the set-semidefinite representation of nonconvex quadratic programs over arbitrary feasible sets
- Foundations of set-semidefinite optimization
- Handbook on semidefinite, conic and polynomial optimization
- scientific article; zbMATH DE number 1933860 (Why is no real title available?)
- scientific article; zbMATH DE number 5493304 (Why is no real title available?)
- Moments, positive polynomials and their applications
- New approximations for the cone of copositive matrices and its dual
- On the computational complexity of membership problems for the completely positive cone and its dual
- On the copositive representation of binary and continuous nonconvex quadratic programs
- On the Matrix Equation X′X = A
- On the set-semidefinite representation of nonconvex quadratic programs over arbitrary feasible sets
- Some NP-complete problems in quadratic and nonlinear programming
- Sums of squares, moment matrices and optimization over polynomials
- Completely positive and completely positive semidefinite tensor relaxations for polynomial optimization
- Optimization over structured subsets of positive semidefinite matrices via column generation
- A new certificate for copositivity
- A New Look at Nonnegativity on Closed Sets and Polynomial Optimization
- Semidefinite approximations of projections and polynomial images of semialgebraic sets
- Optimization under uncertainty and risk: quadratic and copositive approaches
- Approximation hierarchies for copositive cone over symmetric cone and their comparison
This page was built for publication: Moment approximations for set-semidefinite polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q382904)
