New results on the cp rank and related properties of co(mpletely)positive matrices

Abstract

Copositive and completely positive matrices play an increasingly important role in Applied Mathematics, namely as a key concept for approximating NP-hard optimization problems. The cone of copositive matrices of a given order and the cone of completely positive matrices of the same order are dual to each other with respect to the standard scalar product on the space of symmetric matrices. This paper establishes some new relations between orthogonal pairs of such matrices lying on the boundary of either cone. As a consequence, we can establish an improvement on the upper bound of the cp-rank of completely positive matrices of general order, and a further improvement for such matrices of order six.

15 pages; Following a minor revision: improved set notations, phrasing of some proofs (Cor. 2.1, Prop. 4.2)

Cited by in corpus (7)

• Conic Programming Reformulations of Two-Stage Distributionally Robust Linear Programs over Wasserstein Balls
• Matrices with high completely positive semidefinite rank
• Symmetric Nonnegative Matrix Trifactorization
• Extremal copositive matrices with minimal zero supports of cardinality two
• Lower bounds on matrix factorization ranks via noncommutative polynomial optimization
• Exterior Point Method for Completely Positive Factorization
• Approximate Completely Positive Semidefinite Factorizations and their Ranks