Interiors of completely positive cones
From MaRDI portal
Publication:897047
Abstract: A symmetric matrix is completely positive (CP) if there exists an entrywise nonnegative matrix such that . We characterize the interior of the CP cone. A semidefinite algorithm is proposed for checking interiors of the CP cone, and its properties are studied. A CP-decomposition of a matrix in Dickinson's form can be obtained if it is an interior of the CP cone. Some computational experiments are also presented.
Recommendations
- Interior points of the completely positive cone
- An improved characterisation of the interior of the completely positive cone
- On the computation of \(C^*\) certificates
- Computing the distance between the linear matrix pencil and the completely positive cone
- Geometry of the copositive and completely positive cones
Cites work
- scientific article; zbMATH DE number 2089586 (Why is no real title available?)
- scientific article; zbMATH DE number 1933860 (Why is no real title available?)
- scientific article; zbMATH DE number 3311772 (Why is no real title available?)
- A semidefinite approach for truncated \(K\)-moment problems
- An improved characterisation of the interior of the completely positive cone
- Approximation of the stability number of a graph via copositive programming
- Benchmarking optimization software with performance profiles.
- Computing the Stability Number of a Graph Via Linear and Semidefinite Programming
- Cones, matrices and mathematical programming
- Copositive optimization -- recent developments and applications
- Detecting Global Optimality and Extracting Solutions in GloptiPoly
- Factorization and cutting planes for completely positive matrices by copositive projection
- GloptiPoly 3: moments, optimization and semidefinite programming
- Interior points of the completely positive cone
- Linear-time complete positivity detection and decomposition of sparse matrices
- New approximations for the cone of copositive matrices and its dual
- On copositive programming and standard quadratic optimization problems
- On the computational complexity of membership problems for the completely positive cone and its dual
- On the copositive representation of binary and continuous nonconvex quadratic programs
- On the cp-rank and minimal cp factorizations of a completely positive matrix
- Optimality conditions and finite convergence of Lasserre's hierarchy
- Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming
- Sums of squares, moment matrices and optimization over polynomials
- The CP-matrix completion problem
- The \(\mathcal A\)-truncated \(K\)-moment problem
- The truncated moment problem via homogenization and flat extensions
- Truncated \(K\)-moment problems in several variables
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
Cited in
(9)- Partially positive matrices
- Building a completely positive factorization
- CP-rays in simplicial cones
- An improved characterisation of the interior of the completely positive cone
- Computing the distance between the linear matrix pencil and the completely positive cone
- A semidefinite algorithm for completely positive tensor decomposition
- On the computation of \(C^*\) certificates
- The cone of \(5 \times 5\) completely positive matrices
- Interior points of the completely positive cone
This page was built for publication: Interiors of completely positive cones
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q897047)
