LP-based tractable subcones of the semidefinite plus nonnegative cone
From MaRDI portal
Publication:1657406
DOI10.1007/s10479-017-2720-zzbMath1423.90139arXiv1601.06878OpenAlexW2763814177MaRDI QIDQ1657406
Publication date: 13 August 2018
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1601.06878
linear programmingmaximum clique problemmatrix decompositioncopositive conedoubly nonnegative conequadratic optimization problemsemidefinite basissemidefinite plus nonnegative cone
Related Items
Cites Work
- Testing copositivity with the help of difference-of-convex optimization
- Copositive optimization -- recent developments and applications
- An improved algorithm to test copositivity
- On the computational complexity of membership problems for the completely positive cone and its dual
- Geometry of the copositive and completely positive cones
- Copositive and semidefinite relaxations of the quadratic assignment problem
- On the computation of \(C^*\) certificates
- Optimization over structured subsets of positive semidefinite matrices via column generation
- Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming
- Cones of diagonally dominant matrices
- Copositivity detection by difference-of-convex decomposition and \(\omega \)-subdivision
- Detecting copositivity of a symmetric matrix by an adaptive ellipsoid-based approximation scheme
- On the copositive representation of binary and continuous nonconvex quadratic programs
- On the exhaustivity of simplicial partitioning
- Algorithmic copositivity detection by simplicial partition
- Block pivoting and shortcut strategies for detecting copositivity
- Approximation of the Stability Number of a Graph via Copositive Programming
- An Introduction to Formally Real Jordan Algebras and Their Applications in Optimization
- Depth-first simplicial partition for copositivity detection, with an application to MaxClique
- On generalized bisection of 𝑛-simplices
- Constructing copositive matrices from interior matrices
- Matrix Analysis
- Some NP-complete problems in quadratic and nonlinear programming
- Variational Analysis
- A Copositive Programming Approach to Graph Partitioning
- On copositive programming and standard quadratic optimization problems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
