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

DOI10.1080/03081087.2013.869591zbMath1310.15064arXiv1305.0737OpenAlexW2028158177MaRDI QIDQ2938346

Florian Jarre, Werner Schachinger, Abraham Berman, Immanuel M. Bomze, Naomi Shaked-Monderer

Publication date: 14 January 2015

Published in: Linear and Multilinear Algebra (Search for Journal in Brave)

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

zbMATH Keywords

completely positive matricescopositive matricescp-rankcopositive optimizationnonnegative factorization

Mathematics Subject Classification ID

Factorization of matrices (15A23) Convex programming (90C25) Positive matrices and their generalizations; cones of matrices (15B48) Vector spaces, linear dependence, rank, lineability (15A03)

Related Items

Preservers of the cp-rank, Matrices with high completely positive semidefinite rank, On the DJL conjecture for order 6, A fresh CP look at mixed-binary QPs: new formulations and relaxations, Approximate completely positive semidefinite factorizations and their ranks, From seven to eleven: completely positive matrices with high cp-rank, Symmetric nonnegative matrix trifactorization, Copositivity and complete positivity. Abstracts from the workshop held October 29 -- Novermber 4, 2017, The structure of completely positive matrices according to their CP-rank and CP-plus-rank, Completely positive matrices: real, rational, and integral, Notoriously hard (mixed-)binary QPs: empirical evidence on new completely positive approaches, The extreme rays of the \(6\times 6\) copositive cone, Extended trust-region problems with one or two balls: exact copositive and Lagrangian relaxations, Extremal copositive matrices with minimal zero supports of cardinality two, Building a completely positive factorization, Unnamed Item, Conic Programming Reformulations of Two-Stage Distributionally Robust Linear Programs over Wasserstein Balls, Robust Quadratic Programming with Mixed-Integer Uncertainty, Unnamed Item, Lower bounds on matrix factorization ranks via noncommutative polynomial optimization, Copositive Relaxation Beats Lagrangian Dual Bounds in Quadratically and Linearly Constrained Quadratic Optimization Problems

Cites Work

• Copositive optimization -- recent developments and applications
• Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization
• The extreme rays of the \(5 \times 5\) copositive cone
• On nonnegative factorization of matrices
• A note on upper bounds on the cp-rank
• The maximal cp-rank of rank \(k\) completely positive matrices
• CP rank of completely positive matrices of order 5
• Copositive Programming
• On the cp-Rank and Minimal cp Factorizations of a Completely Positive Matrix
• Remarks on completey positive matrices
• Completely positive matrices associated withM-matrices