Separation and relaxation for cones of quadratic forms
From MaRDI portal
Publication:1942279
DOI10.1007/s10107-011-0495-6zbMath1273.90140OpenAlexW2166522144MaRDI QIDQ1942279
Publication date: 18 March 2013
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-011-0495-6
Semidefinite programming (90C22) Nonconvex programming, global optimization (90C26) Quadratic programming (90C20)
Related Items
Cutting planes for semidefinite relaxations based on triangle-free subgraphs, Simulated annealing for convex optimization: rigorous complexity analysis and practical perspectives, An Analytic Center Cutting Plane Method to Determine Complete Positivity of a Matrix, Semidefinite Approaches for MIQCP: Convex Relaxations and Practical Methods, (Global) optimization: historical notes and recent developments, Factorization and cutting planes for completely positive matrices by copositive projection, Adaptive computable approximation to cones of nonnegative quadratic functions, A new algorithm for concave quadratic programming, Copositive Programming
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- BARON
- \(5 \times 5\) completely positive matrices
- Globally solving box-constrained nonconvex quadratic programs with semidefinite-based finite branch-and-bound
- The difference between \(5\times 5\) doubly nonnegative and completely positive matrices
- Criteria for copositive matrices
- Almost copositive matrices
- The Boolean quadratic polytope: Some characteristics, facets and relatives
- Spectral theory of copositive matrices
- A polyhedral study of nonconvex quadratic programs with box constraints
- A branch-and-cut algorithm for nonconvex quadratic programs with box constraints
- BARON: A general purpose global optimization software package
- Separating doubly nonnegative and completely positive matrices
- On copositive matrices with -1, 9, 1 entries
- On the copositive representation of binary and continuous nonconvex quadratic programs
- Algorithmic copositivity detection by simplicial partition
- Computable representations for convex hulls of low-dimensional quadratic forms
- Approximation of the Stability Number of a Graph via Copositive Programming
- A Variational Approach to Copositive Matrices
- An improved characterisation of the interior of the completely positive cone
- On Nonconvex Quadratic Programming with Box Constraints
- Some NP-complete problems in quadratic and nonlinear programming
- Cones of Matrices and Set-Functions and 0–1 Optimization
- CSDP, A C library for semidefinite programming
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- On Cones of Nonnegative Quadratic Functions
