Computing symmetric nonnegative rank factorizations

DOI10.1016/J.LAA.2011.03.016zbMATH Open1234.65024OpenAlexW2162985064WikidataQ29397851 ScholiaQ29397851MaRDI QIDQ651217FDOQ651217

Authors: V. Kalofolias, E. 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

Recommendations

• Nonnegative rank factorization -- a heuristic approach via rank reduction
• Nonnegative ranks, decompositions, and factorizations of nonnegative matrices
• On reduced rank nonnegative matrix factorization for symmetric nonnegative matrices
• The NMF problem and lattice-subspaces
• A symmetric rank-one quasi-Newton method for nonnegative matrix factorization

zbMATH Keywords

algorithmnonnegative matrix factorizationisometrymaximum independent setrank reductionsymmetricrotationprincipal submatrixill-conditioningcompletely positiveextreme rayarrowhead matrixnonnegative rank factorizationpivoted Cholesky factorizationsymmetric positive semidefinite

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05) Factorization of matrices (15A23) Positive matrices and their generalizations; cones of matrices (15B48)

Cites Work

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

Cited In (15)

• Semidefinite Programming and Nash Equilibria in Bimatrix Games
• Computing a nearest symmetric positive semidefinite matrix
• Title not available (Why is that?)
• On reduced rank nonnegative matrix factorization for symmetric nonnegative matrices
• Factoring symmetric totally nonpositive matrices and inverses with a diagonal pivoting method
• On nonnegative factorization of matrices
• Methods for nonnegative matrix factorization based on low-rank cross approximations
• Symmetry-based matrix factorization
• Building a completely positive factorization
• Symmetric rank revealing factorizations
• A polynomial-time algorithm for computing low CP-rank decompositions
• An efficient method for computing the inverse of arrowhead matrices
• The NMF problem and lattice-subspaces
• Symmetric nonnegative matrix trifactorization
• Multiplicative algorithms for symmetric nonnegative tensor factorizations and its applications

This page was built for publication: Computing symmetric nonnegative rank factorizations

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