Interiors of completely positive cones
From MaRDI portal
Publication:897047
DOI10.1007/s10898-015-0309-0zbMath1342.65147arXiv1401.1255OpenAlexW1562905296MaRDI QIDQ897047
Publication date: 16 December 2015
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1401.1255
Numerical mathematical programming methods (65K05) Semidefinite programming (90C22) Convex programming (90C25) Linear programming (90C05)
Related Items (4)
Computing the distance between the linear matrix pencil and the completely positive cone ⋮ Partially positive matrices ⋮ A semidefinite algorithm for completely positive tensor decomposition ⋮ Building a completely positive factorization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimality conditions and finite convergence of Lasserre's hierarchy
- Copositive optimization -- recent developments and applications
- The truncated moment problem via homogenization and flat extensions
- On the computational complexity of membership problems for the completely positive cone and its dual
- The \(\mathcal A\)-truncated \(K\)-moment problem
- Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming
- A semidefinite approach for truncated \(K\)-moment problems
- On the copositive representation of binary and continuous nonconvex quadratic programs
- Factorization and cutting planes for completely positive matrices by copositive projection
- New approximations for the cone of copositive matrices and its dual
- Cones, matrices and mathematical programming
- Approximation of the Stability Number of a Graph via Copositive Programming
- On the cp-Rank and Minimal cp Factorizations of a Completely Positive Matrix
- The CP-Matrix Completion Problem
- An improved characterisation of the interior of the completely positive cone
- GloptiPoly 3: moments, optimization and semidefinite programming
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Detecting Global Optimality and Extracting Solutions in GloptiPoly
- Linear-Time Complete Positivity Detection and Decomposition of Sparse Matrices
- Computing the Stability Number of a Graph Via Linear and Semidefinite Programming
- On copositive programming and standard quadratic optimization problems
- Benchmarking optimization software with performance profiles.
This page was built for publication: Interiors of completely positive cones
