A semidefinite relaxation algorithm for checking completely positive separable matrices
Anwa Zhou Jinyan Fan

A symmetric matrix $A$ is completely positive (CP) if there exists an entrywise nonnegative matrix $V$ such that $A = VV ^T$. A real symmetric matrix is called completely positive separable (CPS) if it can be written as a sum of rank-1 Kronecker products of completely positive matrices. This paper studies the CPS problem. A criterion is given to determine whether a given matrix is CPS, and a specific CPS decomposition is constructed if the matrix is CPS.

keywords: Completely positive matrices completely positive separability moment problems semidefinite algorithm

Year of publication

Related Authors

Related Keywords

[Back to Top]