New approximations for the cone of copositive matrices and its dual
From MaRDI portal
Publication:2452380
DOI10.1007/s10107-013-0632-5zbMath1292.15034arXiv1012.2552OpenAlexW2049904561MaRDI QIDQ2452380
Publication date: 2 June 2014
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1012.2552
Semidefinite programming (90C22) Positive matrices and their generalizations; cones of matrices (15B48)
Related Items
On standard quadratic programs with exact and inexact doubly nonnegative relaxations, Computing the distance between the linear matrix pencil and the completely positive cone, An Analytic Center Cutting Plane Method to Determine Complete Positivity of a Matrix, Moment approximations for set-semidefinite polynomials, Interiors of completely positive cones, Conic optimization: a survey with special focus on copositive optimization and binary quadratic problems, Approximation hierarchies for copositive cone over symmetric cone and their comparison, The \(\mathcal A\)-truncated \(K\)-moment problem, Analysis of copositive optimization based linear programming bounds on standard quadratic optimization, Approximation hierarchies for the cone of flow matrices, Linear conic formulations for two-party correlations and values of nonlocal games, Extended trust-region problems with one or two balls: exact copositive and Lagrangian relaxations, Completely positive semidefinite rank, Inner approximating the completely positive cone via the cone of scaled diagonally dominant matrices, An alternative perspective on copositive and convex relaxations of nonconvex quadratic programs, Lower bounds on matrix factorization ranks via noncommutative polynomial optimization
Cites Work
- Copositive optimization -- recent developments and applications
- Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization
- Linear inequalities and quadratic forms
- A linear programming reformulation of the standard quadratic optimization problem
- The \(K\)-moment problem for compact semi-algebraic sets
- Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming
- A Nullstellensatz and a Positivstellensatz in semialgebraic geometry
- Computable representations for convex hulls of low-dimensional quadratic forms
- Approximation of the Stability Number of a Graph via Copositive Programming
- Copositive Programming
- On the accuracy of uniform polyhedral approximations of the copositive cone
- A Variational Approach to Copositive Matrices
- A New Look at Nonnegativity on Closed Sets and Polynomial Optimization
- Invariant Integration Formulas for the n-Simplex by Combinatorial Methods
- Semidefinite Programming
- Computing the Stability Number of a Graph Via Linear and Semidefinite Programming
- Convex Analysis
- Global Optimization of Polynomials Using Gradient Tentacles and Sums of Squares
