Interiors of completely positive cones
Optimization and Control
2014-01-08 v1
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.
Keywords
Cite
@article{arxiv.1401.1255,
title = {Interiors of completely positive cones},
author = {Anwa Zhou and Jinyan Fan},
journal= {arXiv preprint arXiv:1401.1255},
year = {2014}
}