Interiors of completely positive cones

DOI10.1007/S10898-015-0309-0zbMATH Open1342.65147arXiv1401.1255OpenAlexW1562905296MaRDI QIDQ897047FDOQ897047

Authors: Anwa Zhou, Jinyan Fan 

Publication date: 16 December 2015

Published in: Journal of Global Optimization (Search for Journal in Brave)

Abstract: A symmetric matrix $A$ is completely positive (CP) if there exists an entrywise nonnegative matrix $B$ such that $A=B{B}^T$. 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.

Full work available at URL: https://arxiv.org/abs/1401.1255

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

zbMATH Keywords

numerical exampleslinear optimization with momentssemidefinite algorithmcompletely positive cone

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Linear programming (90C05) Semidefinite programming (90C22)

Cites Work

• Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
• Detecting Global Optimality and Extracting Solutions in GloptiPoly
• Benchmarking optimization software with performance profiles.
• On the copositive representation of binary and continuous nonconvex quadratic programs
• Approximation of the stability number of a graph via copositive programming
• GloptiPoly 3: moments, optimization and semidefinite programming
• Interior points of the completely positive cone
• Sums of squares, moment matrices and optimization over polynomials
• Computing the Stability Number of a Graph Via Linear and Semidefinite Programming
• Title not available (Why is that?)
• Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming
• Factorization and cutting planes for completely positive matrices by copositive projection
• On the computational complexity of membership problems for the completely positive cone and its dual
• Title not available (Why is that?)
• Optimality conditions and finite convergence of Lasserre's hierarchy
• On the cp-rank and minimal cp factorizations of a completely positive matrix
• Copositive optimization -- recent developments and applications
• A semidefinite approach for truncated \(K\)-moment problems
• New approximations for the cone of copositive matrices and its dual
• The truncated moment problem via homogenization and flat extensions
• The \(\mathcal A\)-truncated \(K\)-moment problem
• Truncated \(K\)-moment problems in several variables
• On copositive programming and standard quadratic optimization problems
• Linear-time complete positivity detection and decomposition of sparse matrices
• Cones, matrices and mathematical programming
• An improved characterisation of the interior of the completely positive cone
• The CP-matrix completion problem
• Title not available (Why is that?)

Cited In (8)

• Interior points of the completely positive cone
• Computing the distance between the linear matrix pencil and the completely positive cone
• Building a completely positive factorization
• Partially positive matrices
• CP-rays in simplicial cones
• On the computation of \(C^*\) certificates
• An improved characterisation of the interior of the completely positive cone
• A semidefinite algorithm for completely positive tensor decomposition

Uses Software

• SeDuMi
• GloptiPoly

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)