Fast projection-based methods for the least squares nonnegative matrix approximation problem

Statistical Analysis and Data Mining

Volumn 1, Issue 1, 2008, Pages 38-51

  Kim, Dongmin ^a   Sra, Suvrit ^a   Dhillon, Inderjit S ^a  

^a UNIVERSITY OF TEXAS AT AUSTIN   (United States)

Author keywords

Active sets; Factorization; Least squares; Nonnegative matrix approximation; Projected Newton methods

Indexed keywords

CONJUGATE GRADIENT METHOD; HEURISTIC METHODS; IMAGE PROCESSING; LEAST SQUARES APPROXIMATIONS; MATRIX ALGEBRA; MATRIX FACTORIZATION; NEWTON-RAPHSON METHOD; NUMERICAL METHODS;

ACTIVE SETS; ALTERNATING LEAST SQUARES; APPROXIMATION PROBLEMS; DECOMPOSITION TECHNIQUE; DOCUMENT IMAGES; DOCUMENTS ANALYSIS; LEAST SQUARE; MATRIX DECOMPOSITION; NON-NEGATIVE MATRIX APPROXIMATIONS; PROJECTED NEWTON METHODS;

COMPUTATIONAL EFFICIENCY;

EID: 70350175761     PISSN: 19321872     EISSN: 19321864     Source Type: Journal    
DOI: 10.1002/sam.104     Document Type: Article

References (20)

1. M. Berry, M. Browne, A. Langville, P. Pauca, and R. J. Plemmons, Algorithms and applications for approximation nonnegative matrix factorization, Comput Stat Data Anal (2006), Preprint.
2. D. D. Lee and H. S. Seung, Learning the parts of objects by nonnegative matrix factorization, Nature 401 (1999), 788-791.
3. P. Paatero and U. Tapper, Positive matrix factorization: A nonnegative factor model with optimal utilization of error estimates of data values, Environmetrics 5 (1994), 111-126.
4. D. D. Lee and H. S. Seung, Algorithms for Nonnegative Matrix Factorization. In Neural Information Processing Systems, 2000, 556-562.
5. C. L. Lawson and R. J. Hanson, Solving Least Squares Problems, Prentice-Hall, 1974.
6. R. Bro and S. D. Jong, A Fast Non-negativity-constrained Least Squares Algorithm, J Chemomet 11(5) (1997), 393-401.
7. Åke Björck, Numerical Methods for Least Squares Problems, SIAM, 1996
8. D. Kim, S. Sra, and I. S. Dhillon, A New Projected Quasi-Newton Approach for the Non-negative Least Squares Problem. Technical Report TR-06-54, Computer Sciences, The University of Texas at Austin, 2006.
9. P. Paatero, Least-squares formulation of robust nonnegative factor analysis, Chemomet Intell Lab Syst 37 (1997), 23-35.
10. P. Paatero, The multilinear engine-a table-driven least squares program for solving multilinear problems, including the N-way parallel factor analysis model, J Comput Graphical Statist 8(4) (1999), 854-888.
11. M. Bierlaire, P. L. Toint, and D. Tuyttens, On iterative algorithms for linear least squares problems with bound constraints, Linear Algebra Appl 143 (1991), 111-143.
12. C. Lin, Projected Gradient Methods for Non-negative Matrix Factorization. Technical Report ISSTECH-95-013, National Taiwan University, 2005.
13. M. Merritt and Y. Zhang, Interior-point gradient method for large-scale totally nonnegative least squares problems, J Optim Theory Appl 126(1) (2005), 191-202.
14. E. F. Gonzalez and Y. Zhang, Accelerating The Lee-Seung Algorithm for Nonnegative Matrix Factorization. Technical Report TR-05-02, Rice University, 2005.
15. R. Zdunek and A. Cichocki, Non-Negative Matrix Factorization with Quasi-Newton Optimization. In Eighth International Conference on Artificial Intelligence and Soft Computing, ICAISC, 2006, 870-879.
16. D. P. Bertsekas, Projected Newton methods for optimization problems with simple constraints, SIAM J Control Optimizat 20(2) (1982), 221-246.
17. L. Grippo and M. Sciandrone, On the convergence of the block nonlinear gauss-seidel method under convex constraints, Operat Res Lett 26 (2000), 127-136.
18. A. Cichocki and R. Zdunek, NMFLAB-MATLAB Toolbox for Non-Negative Matrix Factorization, Online, 2006.
19. S. Sra and I. S. Dhillon, Nonnegative Matrix Approximation: Algorithms and Applications. Technical Report Tr-06-27, Computer Sciences, University of Texas at Austin, 2006.
20. D. Donoho and V. Stodden, When Does Nonnegative Matrix Factorization Give a Correct Decomposition into Parts? In Neural Information Processing Systems, 2003.