Randomized algorithms for orthogonal nonnegative matrix factorization

DOI10.1007/s40305-020-00322-9zbMath1524.68438MaRDI QIDQ6097384

Yongyong Chen, Fang Fang Xu

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

zbMATH Keywords

augmented Lagrangian method; dimensionality reduction; orthogonal nonnegative matrix factorization; random projection method; hierarchical alternating least-squares algorithm

Mathematics Subject Classification ID

15A23: Factorization of matrices

90C90: Applications of mathematical programming

68W20: Randomized algorithms

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