A note on the computation of the CP-rank

DOI10.1016/J.LAA.2006.04.001MaRDI QIDQ854849zbMATH OpenOpenAlexFDO

Authors A. Berman, Uriel G. Rothblum

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)

Recommendations

• scientific article; zbMATH DE number 5613138
• Completely positive matrices.
• Factorization of cp-rank-\(3\) completely positive matrices.
• On the cp-rank and minimal cp factorizations of a completely positive matrix
• A polynomial-time algorithm for computing low CP-rank decompositions

Cites work

• scientific article; zbMATH DE number 5613138 (Why is no real title available?)
• scientific article; zbMATH DE number 1933860 (Why is no real title available?)
• scientific article; zbMATH DE number 3068536 (Why is no real title available?)
• Characterization of completely positive graphs
• Combinatorial results on completely positive matrices
• Completely positive matrices associated withM-matrices
• Minimal \(cp\) rank
• Nonnegative factorization of completely positive matrices
• Nonnegative ranks, decompositions, and factorizations of nonnegative matrices
• On the Matrix Equation X′X = A
• On the computational complexity and geometry of the first-order theory of the reals. III: Quantifier elimination
• The maximal cp-rank of rank \(k\) completely positive matrices
• \(\{0,1\}\) completely positive matrices

Cited in

(18)

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

This page was built for publication: A note on the computation of the CP-rank

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q854849)