Computing symmetric nonnegative rank factorizations
From MaRDI portal
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
Cites work
- scientific article; zbMATH DE number 3138903 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 734901 (Why is no real title available?)
- scientific article; zbMATH DE number 1933860 (Why is no real title available?)
- scientific article; zbMATH DE number 194668 (Why is no real title available?)
- scientific article; zbMATH DE number 3014797 (Why is no real title available?)
- scientific article; zbMATH DE number 3326540 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- scientific article; zbMATH DE number 4189084 (Why is no real title available?)
- A Rank–One Reduction Formula and Its Applications to Matrix Factorizations
- A Second-Order Rosenbrock Method Applied to Photochemical Dispersion Problems
- A note on the computation of the CP-rank
- A note on upper bounds on the cp-rank
- A reverse Hadamard inequality
- Computing nonnegative rank factorizations
- Inverses of nonnegative matrices
- Non-negative matrix factorization: Ill-posedness and a geometric algorithm
- Nonnegative factorization of positive semidefinite nonnegative matrices
- Nonnegative rank factorization -- a heuristic approach via rank reduction
- Nonnegative ranks, decompositions, and factorizations of nonnegative matrices
- On nonnegative factorization of matrices
- On reduced rank nonnegative matrix factorization for symmetric nonnegative matrices
- On the complexity of nonnegative matrix factorization
- On the copositive representation of binary and continuous nonconvex quadratic programs
- On the parameterization of the CreditRisk\(^+\) model for estimating credit portfolio risk
- The difference between \(5\times 5\) doubly nonnegative and completely positive matrices
- Using underapproximations for sparse nonnegative matrix factorization
Cited in
(16)- The NMF problem and lattice-subspaces
- Semidefinite Programming and Nash Equilibria in Bimatrix Games
- scientific article; zbMATH DE number 4168848 (Why is no real title available?)
- Factoring symmetric totally nonpositive matrices and inverses with a diagonal pivoting method
- An efficient method for computing the inverse of arrowhead matrices
- A polynomial-time algorithm for computing low CP-rank decompositions
- Building a completely positive factorization
- On nonnegative factorization of matrices
- On reduced rank nonnegative matrix factorization for symmetric nonnegative matrices
- Computing a nearest symmetric positive semidefinite matrix
- Methods for nonnegative matrix factorization based on low-rank cross approximations
- Multiplicative algorithms for symmetric nonnegative tensor factorizations and its applications
- Nonnegative rank factorization -- a heuristic approach via rank reduction
- Symmetric nonnegative matrix trifactorization
- Symmetric rank revealing factorizations
- Symmetry-based matrix factorization
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)
