A note on upper bounds on the cp-rank
From MaRDI portal
Publication:1039748
DOI10.1016/j.laa.2009.04.015zbMath1180.15028OpenAlexW1970270635MaRDI QIDQ1039748
Publication date: 23 November 2009
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2009.04.015
Positive matrices and their generalizations; cones of matrices (15B48) Hermitian, skew-Hermitian, and related matrices (15B57) Vector spaces, linear dependence, rank, lineability (15A03)
Related Items
A polynomial-time algorithm for computing low CP-rank decompositions ⋮ New results on the cp-rank and related properties of co(mpletely )positive matrices ⋮ Computing symmetric nonnegative rank factorizations ⋮ Completely positive matrices: real, rational, and integral ⋮ Building a completely positive factorization ⋮ Factorization of cp-rank-3 completely positive matrices
Cites Work