A note on the computation of the CP-rank

DOI10.1016/j.laa.2006.04.001zbMath1105.65038OpenAlexW2061781854MaRDI QIDQ854849

Uriel G. Rothblum, Abraham Berman

Publication date: 7 December 2006

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

Full work available at URL: https://doi.org/10.1016/j.laa.2006.04.001

zbMATH Keywords

nonnegative matricescomplete positivityRenegar's algorithmTarski's principle

Mathematics Subject Classification ID

Positive matrices and their generalizations; cones of matrices (15B48) Vector spaces, linear dependence, rank, lineability (15A03)

Related Items

The difference between \(5\times 5\) doubly nonnegative and completely positive matrices, A polynomial-time algorithm for computing low CP-rank decompositions, Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization, Factorization and cutting planes for completely positive matrices by copositive projection, Computing symmetric nonnegative rank factorizations, Copositivity and complete positivity. Abstracts from the workshop held October 29 -- Novermber 4, 2017, The \(\mathcal A\)-truncated \(K\)-moment problem, Completely positive matrices: real, rational, and integral, Nonnegative rank factorization -- a heuristic approach via rank reduction, Optimizing a polyhedral-semidefinite relaxation of completely positive programs, A simplex algorithm for rational cp-factorization, Building a completely positive factorization, Copositive Programming, Semialgebraic Geometry of Nonnegative Tensor Rank, On the computation of \(C^*\) certificates, Real rank versus nonnegative rank, Lower bounds on matrix factorization ranks via noncommutative polynomial optimization

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Characterization of completely positive graphs
• Nonnegative ranks, decompositions, and factorizations of nonnegative matrices
• Nonnegative factorization of completely positive matrices
• Combinatorial results on completely positive matrices
• On the computational complexity and geometry of the first-order theory of the reals. III: Quantifier elimination
• \(\{0,1\}\) completely positive matrices
• The maximal cp-rank of rank \(k\) completely positive matrices
• Minimal CP rank
• On the Matrix Equation X′X = A
• Completely positive matrices associated withM-matrices