On the nonnegative rank of Euclidean distance matrices
From MaRDI portal
Publication:977487
DOI10.1016/j.laa.2010.03.038zbMath1194.15003OpenAlexW2005300783WikidataQ42078332 ScholiaQ42078332MaRDI QIDQ977487
Publication date: 22 June 2010
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: http://europepmc.org/articles/pmc3747005
Factorization of matrices (15A23) Positive matrices and their generalizations; cones of matrices (15B48) Vector spaces, linear dependence, rank, lineability (15A03)
Related Items
Extension complexity of low-dimensional polytopes, Completely positive factorizations associated with Euclidean distance matrices corresponding to an arithmetic progression, Symmetric nonnegative matrix trifactorization, On the nonnegative rank of distance matrices, On the condition number anomaly of Gaussian correlation matrices, Nonnegative rank factorization -- a heuristic approach via rank reduction, On the geometric interpretation of the nonnegative rank, Algorithms for nonnegative matrix and tensor factorizations: a unified view based on block coordinate descent framework, An upper bound for nonnegative rank
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Nonnegative ranks, decompositions, and factorizations of nonnegative matrices
- Equality relating Euclidean distance cone to positive semidefinite cone
- Real rank versus nonnegative rank
- Computing nonnegative rank factorizations
- A note on nonnegative rank factorizations
- Low-Dimensional Polytope Approximation and Its Applications to Nonnegative Matrix Factorization
- Matrix Group Monotonicity
- Primes in the semigroup of non-negative matrices
- Nonnegative Rank Factorization of a Nonnegative Matrix A with A A ≥0