Factorization and cutting planes for completely positive matrices by copositive projection
From MaRDI portal
Publication:2436642
DOI10.1007/s10107-012-0601-4zbMath1286.90106OpenAlexW2045426493MaRDI QIDQ2436642
Publication date: 25 February 2014
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-012-0601-4
Semidefinite programming (90C22) Nonconvex programming, global optimization (90C26) Quadratic programming (90C20)
Related Items (17)
Cutting planes for semidefinite relaxations based on triangle-free subgraphs ⋮ On conic QPCCs, conic QCQPs and completely positive programs ⋮ Bounding the separable rank via polynomial optimization ⋮ Completely positive tensor recovery with minimal nuclear value ⋮ An Analytic Center Cutting Plane Method to Determine Complete Positivity of a Matrix ⋮ Completely positive factorizations associated with Euclidean distance matrices corresponding to an arithmetic progression ⋮ A factorization method for completely positive matrices ⋮ Completely positive factorization by a Riemannian smoothing method ⋮ Semidefinite Approaches for MIQCP: Convex Relaxations and Practical Methods ⋮ Dehomogenization for completely positive tensors ⋮ Interiors of completely positive cones ⋮ Computational aspects of column generation for nonlinear and conic optimization: classical and linearized schemes ⋮ Copositivity and complete positivity. Abstracts from the workshop held October 29 -- Novermber 4, 2017 ⋮ A simplex algorithm for rational cp-factorization ⋮ The CP-Matrix Approximation Problem ⋮ Building a completely positive factorization ⋮ A note on completely positive relaxations of quadratic problems in a multiobjective framework
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Copositive optimization -- recent developments and applications
- Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization
- On the computational complexity of membership problems for the completely positive cone and its dual
- The difference between \(5\times 5\) doubly nonnegative and completely positive matrices
- A note on the computation of the CP-rank
- New and old bounds for standard quadratic optimization: dominance, equivalence and incomparability
- On the computation of \(C^*\) certificates
- Numeric computation of the projection of a point onto a polyhedron
- Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming
- Separating doubly nonnegative and completely positive matrices
- Separation and relaxation for cones of quadratic forms
- On the copositive representation of binary and continuous nonconvex quadratic programs
- Copositivity cuts for improving SDP bounds on the clique number
- Approximation of the Stability Number of a Graph via Copositive Programming
- On the accuracy of uniform polyhedral approximations of the copositive cone
- A Variational Approach to Copositive Matrices
- Gap, cosum and product properties of the θ′ bound on the clique number
- An improved characterisation of the interior of the completely positive cone
- On generalized bisection of 𝑛-simplices
- Some NP-complete problems in quadratic and nonlinear programming
- Completely positive matrices associated withM-matrices
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Linear-Time Complete Positivity Detection and Decomposition of Sparse Matrices
- An Adaptive Linear Approximation Algorithm for Copositive Programs
- Computing the Stability Number of a Graph Via Linear and Semidefinite Programming
This page was built for publication: Factorization and cutting planes for completely positive matrices by copositive projection
