A note on the computation of the CP-rank

DOI10.1016/J.LAA.2006.04.001zbMATH Open1105.65038OpenAlexW2061781854MaRDI QIDQ854849FDOQ854849

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

Recommendations

• scientific article
• 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

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)

Cites Work

• Title not available (Why is that?)
• Nonnegative ranks, decompositions, and factorizations of nonnegative matrices
• Combinatorial results on completely positive matrices
• On the Matrix Equation X′X = A
• Title not available (Why is that?)
• Characterization of completely positive graphs
• Completely positive matrices associated withM-matrices
• \(\{0,1\}\) completely positive matrices
• 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
• Nonnegative factorization of completely positive matrices
• Minimal \(cp\) rank
• Title not available (Why is that?)

Cited In (18)

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

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)