Lin CJ. (2007). Projected gradient methods for nonnegative matrix factorization. Neural computation. 19 [PubMed]

See more from authors: Lin CJ

References and models cited by this paper

Bertsekas DP. (1976). On the Goldstein-Levitin-Polyak gradient projection method IEEE Trans Automatic Control. 21

Bertsekas DP. (1999). Nonlinear programming (2nd ed).

Brunet JP. (2004). An NMF Program. Available online at http:--www.broad.mit.edu-mpr-publications-projects-NMF-nmf.m.

Brunet JP, Tamayo P, Golub TR, Mesirov JP. (2004). Metagenes and molecular pattern discovery using matrix factorization. Proceedings of the National Academy of Sciences of the United States of America. 101 [PubMed]

Calamai PH, More JJ. (1987). Projected gradient methods for linearly constrained problems Mathematical Programming. 39

Chu M, Diele F, Plemmons R, Ragni S. (2005). Optimality, computation and interpretation of nonnegative matrix factorizations Available online athttp:--www4.ncsu.edu-mtchu-Research-Papers-nnmf.ps.

Donoho D, Stodden V. (2004). When does non-negative matrix factorization give a correct decomposition into parts? Advances in neural information processing systems. 16

Grippo L, Sciandrone M. (2000). On the convergence of the block nonlinear Gauss-Seidel method under convex constraints Operations Research Letters. 26

Hoyer PO. (2002). Non-negative sparse coding Proceedings of IEEE Workshop on Neural Networks for Signal Processing.

Hoyer PO. (2004). Non-negative matrix factorization with sparseness constraints J Mach Learn Res. 5

Lawson CL, Hanson RJ. (1974). Linear least squares with linear inequality constraints Solving least squares problems.

Lee DD, Seung HS. (1999). Learning the parts of objects by non-negative matrix factorization. Nature. 401 [PubMed]

Lin CJ. (1999). Newtons method for large-scale bound constrained problems SIAM J Optim. 9

Liu X, Xu W, Gong Y. (2003). Document clustering based on non-negative matrix factorization Proc 26th Ann Intl ACM SIGIR Conf.

Mccormick GP, Tapia RA. (1972). The gradient projection method under mild differentiability conditions SIAM J Control. 10

Paatero P. (1999). The multilinear engine table-driven, least squares program for solving multilinear problems, including the n-way parallel factor analysis model J Comput Graph Stat. 8

Paatero P, Tapper U. (1994). Positive matrix factorization: A non-negative factor model with optimal utilization of error Environmetrics. 5

Plemmons R, Piper J, Pauca P, Giffin M. (2004). Object characterization from spectral data using nonnegative factorization and information theory Proc AMOS Tech Conf.

Powell MJD. (1973). On search directions for minimization Mathematical Programming. 4

Seung HS, Lee DD. (2000). Algorithms for non-negative matrix factorization Advances in neural information processing systems. 13

Shepherd S. (2004). Non-negative matrix factorization Available online at http:--www.simonshepherd.supanet.com-nnmf.htm.

Yang Y, Li F, Lewis DD, Rose TG. (2004). RCV1: A new benchmark collection for text categorization research J Mach Learn Res. 5

Zhang Y, Gonzales EF. (2005). Accelerating the Lee-Seung algorithm for non-negative matrix factorization Tech Rep Department of Computational and Applied Mathematics, Rice University.

References and models that cite this paper
This website requires cookies and limited processing of your personal data in order to function. By continuing to browse or otherwise use this site, you are agreeing to this use. See our Privacy policy and how to cite and terms of use.