Randomized algorithms for orthogonal nonnegative matrix factorization
From MaRDI portal
Publication:6097384
DOI10.1007/s40305-020-00322-9zbMath1524.68438OpenAlexW3104036117MaRDI QIDQ6097384
Publication date: 5 June 2023
Published in: Journal of the Operations Research Society of China (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40305-020-00322-9
augmented Lagrangian methoddimensionality reductionorthogonal nonnegative matrix factorizationrandom projection methodhierarchical alternating least-squares algorithm
Factorization of matrices (15A23) Applications of mathematical programming (90C90) Randomized algorithms (68W20)
Cites Work
- A feasible method for optimization with orthogonality constraints
- Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions
- A column-wise update algorithm for nonnegative matrix factorization in Bregman divergence with an orthogonal constraint
- An alternating projected gradient algorithm for nonnegative matrix factorization
- On the global and linear convergence of the generalized alternating direction method of multipliers
- A convergent algorithm for orthogonal nonnegative matrix factorization
- Frequent Directions: Simple and Deterministic Matrix Sketching
- A sequential updating scheme of the Lagrange multiplier for separable convex programming
- Alternating Direction Algorithms for $\ell_1$-Problems in Compressive Sensing
- A Symmetric Alternating Direction Method of Multipliers for Separable Nonconvex Minimization Problems
- Compressed Nonnegative Matrix Factorization Is Fast and Accurate
- An Effective Initialization for Orthogonal Nonnegative Matrix Factorization
- A Convergent 3-Block SemiProximal Alternating Direction Method of Multipliers for Conic Programming with 4-Type Constraints
- Projected Gradient Methods for Nonnegative Matrix Factorization
This page was built for publication: Randomized algorithms for orthogonal nonnegative matrix factorization
