Computing symmetric nonnegative rank factorizations

DOI10.1016/j.laa.2011.03.016zbMath1234.65024WikidataQ29397851 ScholiaQ29397851MaRDI QIDQ651217

V. Kalofolias, Efstratios Gallopoulos

Publication date: 8 December 2011

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

Full work available at URL: http://infoscience.epfl.ch/record/198764

zbMATH Keywords

algorithm; rotation; isometry; completely positive; ill-conditioning; maximum independent set; symmetric; nonnegative matrix factorization; rank reduction; principal submatrix; extreme ray; arrowhead matrix; nonnegative rank factorization; pivoted Cholesky factorization; symmetric positive semidefinite

Mathematics Subject Classification ID

15A23: Factorization of matrices

15B48: Positive matrices and their generalizations; cones of matrices

65F05: Direct numerical methods for linear systems and matrix inversion

Related Items

Semidefinite Programming and Nash Equilibria in Bimatrix Games, A polynomial-time algorithm for computing low CP-rank decompositions, Building a completely positive factorization, The NMF problem and lattice-subspaces, Methods for nonnegative matrix factorization based on low-rank cross approximations, An efficient method for computing the inverse of arrowhead matrices

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On nonnegative factorization of matrices
• Nonnegative ranks, decompositions, and factorizations of nonnegative matrices
• On reduced rank nonnegative matrix factorization for symmetric nonnegative matrices
• The difference between \(5\times 5\) doubly nonnegative and completely positive matrices
• A note on the computation of the CP-rank
• Using underapproximations for sparse nonnegative matrix factorization
• On the parameterization of the CreditRisk\(^+\) model for estimating credit portfolio risk
• Non-negative matrix factorization: Ill-posedness and a geometric algorithm
• A note on upper bounds on the cp-rank
• Nonnegative factorization of positive semidefinite nonnegative matrices
• Computing nonnegative rank factorizations
• Nonnegative rank factorization -- a heuristic approach via rank reduction
• On the copositive representation of binary and continuous nonconvex quadratic programs
• A reverse Hadamard inequality
• On the Complexity of Nonnegative Matrix Factorization
• Inverses of nonnegative matrices
• A Second-Order Rosenbrock Method Applied to Photochemical Dispersion Problems
• A Rank–One Reduction Formula and Its Applications to Matrix Factorizations