New approximations for the cone of copositive matrices and its dual
From MaRDI portal
Publication:2452380
DOI10.1007/S10107-013-0632-5zbMATH Open1292.15034arXiv1012.2552OpenAlexW2049904561MaRDI QIDQ2452380FDOQ2452380
Authors: Jean B. Lasserre 
Publication date: 2 June 2014
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Abstract: We provide convergent hierarchies for the cone C of copositive matrices and its dual, the cone of completely positive matrices. In both cases the corresponding hierarchy consists of nested spectrahedra and provide outer (resp. inner) approximations for C (resp. for its dual), thus complementing previous inner (resp. outer) approximations for C (for the dual). In particular, both inner and outer approximations have a very simple interpretation. Finally, extension to K-copositivity and K-complete positivity for a closed convex cone K, is straightforward.
Full work available at URL: https://arxiv.org/abs/1012.2552
Recommendations
- On the exactness of sum-of-squares approximations for the cone of \(5 \times 5\) copositive matrices
- On the accuracy of uniform polyhedral approximations of the copositive cone
- Symmetric tensor approximation hierarchies for the completely positive cone
- New results on the cp-rank and related properties of co(mpletely) positive matrices
- An adaptive linear approximation algorithm for copositive programs
Semidefinite programming (90C22) Positive matrices and their generalizations; cones of matrices (15B48)
Cites Work
- Semidefinite Programming
- Convex Analysis
- The \(K\)-moment problem for compact semi-algebraic sets
- A Nullstellensatz and a Positivstellensatz in semialgebraic geometry
- Approximation of the stability number of a graph via copositive programming
- A New Look at Nonnegativity on Closed Sets and Polynomial Optimization
- Computing the Stability Number of a Graph Via Linear and Semidefinite Programming
- A variational approach to copositive matrices
- Global Optimization of Polynomials Using Gradient Tentacles and Sums of Squares
- Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming
- Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization
- Copositive optimization -- recent developments and applications
- Computable representations for convex hulls of low-dimensional quadratic forms
- Copositive programming
- On the accuracy of uniform polyhedral approximations of the copositive cone
- Invariant Integration Formulas for the n-Simplex by Combinatorial Methods
- Linear inequalities and quadratic forms
- A linear programming reformulation of the standard quadratic optimization problem
Cited In (24)
- On the accuracy of uniform polyhedral approximations of the copositive cone
- Copositive and completely positive matrices
- Conic optimization: a survey with special focus on copositive optimization and binary quadratic problems
- Approximation hierarchies for the cone of flow matrices
- On standard quadratic programs with exact and inexact doubly nonnegative relaxations
- Extended trust-region problems with one or two balls: exact copositive and Lagrangian relaxations
- Computing the distance between the linear matrix pencil and the completely positive cone
- The \(\mathcal A\)-truncated \(K\)-moment problem
- An Analytic Center Cutting Plane Method to Determine Complete Positivity of a Matrix
- Completely positive semidefinite rank
- Interiors of completely positive cones
- On the exactness of sum-of-squares approximations for the cone of \(5 \times 5\) copositive matrices
- The cone of flow matrices: Approximation hierarchies and applications
- Lower bounds on matrix factorization ranks via noncommutative polynomial optimization
- Scaling relationship between the copositive cone and Parrilo's first level approximation
- An alternative perspective on copositive and convex relaxations of nonconvex quadratic programs
- Analysis of copositive optimization based linear programming bounds on standard quadratic optimization
- Inner approximating the completely positive cone via the cone of scaled diagonally dominant matrices
- Approximating the cone of copositive kernels to estimate the stability number of infinite graphs
- Moment approximations for set-semidefinite polynomials
- Linear conic formulations for two-party correlations and values of nonlocal games
- Approximation hierarchies for copositive cone over symmetric cone and their comparison
- Approximate cone factorizations and lifts of polytopes
- Symmetric tensor approximation hierarchies for the completely positive cone
This page was built for publication: New approximations for the cone of copositive matrices and its dual
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2452380)
