An alternating projected gradient algorithm for nonnegative matrix factorization
From MaRDI portal
Publication:555416
DOI10.1016/j.amc.2011.04.070zbMath1219.65036MaRDI QIDQ555416
Publication date: 22 July 2011
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2011.04.070
nonnegative matrix factorization; low-rank decomposition; multiplicative updating method; projected gradient algorithm
65F05: Direct numerical methods for linear systems and matrix inversion
Uses Software
Cites Work
- Unnamed Item
- Interior-point gradient method for large-scale totally nonnegative least squares problems
- Algorithms and applications for approximate nonnegative matrix factorization
- Nonnegative matrix factorization for spectral data analysis
- Document clustering using nonnegative matrix factorization
- On successive-overrelaxation acceleration of the Hermitian and skew-Hermitian splitting iterations
- Hermitian and Skew-Hermitian Splitting Methods for Non-Hermitian Positive Definite Linear Systems
- Block Triangular and Skew-Hermitian Splitting Methods for Positive-Definite Linear Systems
- Newton's Method for Large Bound-Constrained Optimization Problems
- Learning the parts of objects by non-negative matrix factorization
- Projected Gradient Methods for Nonnegative Matrix Factorization