Related Experiment Videos
Projected gradient methods for nonnegative matrix factorization
1Department of Computer Science, National Taiwan University, Taipei 106, Taiwan. cjlin@csie.ntu.edu.tw
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 Concept Videos
Gradient Vectors and Their Applications
Gradient Fields
Significance of the Gradient Vector
Gradient and Del Operator
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
Maximizing the Directional Derivative