Orthogonal nonnegative matrix factorization via minimization over the null space

DOI10.1137/24M1695762MaRDI QIDQ7299116zbMATH OpenFDO

Authors Xiaojun Chen, Wen Li, Qi-Lun Luo

Publication date 17 July 2026

Published in SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/24M1695762

Mathematics Subject Classification ID

Orthogonalization in numerical linear algebra (65F25) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)

Cites work

• A convergent algorithm for orthogonal nonnegative matrix factorization
• A New First-Order Algorithmic Framework for Optimization Problems with Orthogonality Constraints
• An augmented Lagrangian method for non-Lipschitz nonconvex programming
• An exact penalty approach for optimization with nonnegative orthogonality constraints
• Bisection is optimal
• Combinatorial matrix theory
• Exact penalty function for \(\ell_{2,1}\) norm minimization over the Stiefel manifold
• scientific article; zbMATH DE number 734901 (Why is no real title available?)
• Introduction to Information Retrieval
• Orthogonal nonnegative matrix factorization by sparsity and nuclear norm optimization
• Practical augmented Lagrangian methods for constrained optimization
• Tight error bounds for the sign-constrained Stiefel manifold
• Towards a Generalized Singular Value Decomposition
• Two fast vector-wise update algorithms for orthogonal nonnegative matrix factorization with sparsity constraint

This page was built for publication: Orthogonal nonnegative matrix factorization via minimization over the null space

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