HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS		QUICK SEARCH:   [advanced] Author: Keyword(s): Year:  Vol:  Page:

This Article Full Text Full Text (PDF) Alert me when this article is cited Alert me if a correction is posted Services Similar articles in this journal Alert me to new issues of the journal Download to citation manager Citing Articles Citing Articles via HighWire Citing Articles via Google Scholar Google Scholar Articles by Lin, C.-J. Search for Related Content PubMed Articles by Lin, C.-J.

Projected Gradient Methods for Nonnegative Matrix Factorization

cjlin{at}csie.ntu.edu.tw Department of Computer Science, National Taiwan University, Taipei 106, Taiwan

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.

This article has been cited by other articles:

				M. Morup, L. K. Hansen, and S. M. Arnfred Algorithms for Sparse Nonnegative Tucker Decompositions Neural Comput., August 1, 2008; 20(8): 2112 - 2131. [Abstract] [Full Text] [PDF]