Projected Gradient Methods for Nonnegative Matrix Factorization

Citations Over TimeTop 1% of 2007 papers

Abstract

Nonnegative matrix factorization (NMF) can be formulated as a minimization problem with bound constraints. Although bound-constrained optimization has been studied extensively in both theory and practice, so far no study has formally applied its techniques to NMF. In this letter, we propose two projected gradient methods for NMF, both of which exhibit strong optimization properties. We discuss efficient implementations and demonstrate that one of the proposed methods converges faster than the popular multiplicative update approach. A simple Matlab code is also provided.

Related Papers

• → CUR+NMF for learning spectral features from large data matrix(2008)10 cited
• → Stability analysis of multiplicative update algorithms for non-negative matrix factorization(2011)6 cited
• → Sparsity promoted non-negative matrix factorization for source separation and detection(2014)3 cited
• → Detection of Brain Activity in Functional Magnetic Resonance Imaging Data using Matrix Factorization(2013)1 cited
• → PHASL-NMF: Hierarchical ALS Based Power Non-Negative Matrix Factorization(2023)