Table of Contents
ISRN Applied Mathematics
Volume 2014 (2014), Article ID 846483, 11 pages
http://dx.doi.org/10.1155/2014/846483
Research Article

A Symmetric Rank-One Quasi-Newton Method for Nonnegative Matrix Factorization

1School of Mathematics Science, University of Electronic Science and Technology of China, Chengdu 611731, China
2School of Mechanical Engineering, Southwest Jiaotong University, Chengdu 610031, China

Received 10 October 2013; Accepted 5 November 2013; Published 22 January 2014

Academic Editors: I. K. Argyros and S. Zhang

Copyright © 2014 Shu-Zhen Lai et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. D. D. Lee and H. S. Seung, “Learning the parts of objects by non-negative matrix factorization,” Nature, vol. 401, no. 6755, pp. 788–791, 1999. View at Publisher · View at Google Scholar · View at Scopus
  2. M. W. Berry, M. Browne, A. N. Langville, V. P. Pauca, and R. J. Plemmons, “Algorithms and applications for approximate nonnegative matrix factorization,” Computational Statistics and Data Analysis, vol. 52, no. 1, pp. 155–173, 2007. View at Publisher · View at Google Scholar · View at Scopus
  3. C.-J. Lin, “Projected gradient methods for nonnegative matrix factorization,” Neural Computation, vol. 19, no. 10, pp. 2756–2779, 2007. View at Publisher · View at Google Scholar · View at Scopus
  4. R. Zdunek and A. Cichoki, “Non-negative matrix factorization with quasi-Newton optimization,” in Proceedings of the International Conference on Artificial Intelligence and soft Computing (ICAISC '06), pp. 870–879, 2006.
  5. D. Kim, S. Sra, and I. S. Dhillon, “Fast newton-type methods for the least squares nonnegative matrix approximation problem,” in Proceedings of the 7th SIAM International Conference on Data Mining, pp. 343–354, April 2007. View at Scopus
  6. D. Kim, S. Sra, and I. S. Dhillon, “Fast projection-based methods for the least squares nonnegative matrix approximation problem,” Statistical Analysis and Data Mining, vol. 1, no. 1, pp. 38–51, 2008. View at Publisher · View at Google Scholar · View at Scopus
  7. H. Kim and H. Park, “Nonnegative matrix factorization based on alternating nonnegativity constrained least squares and active set method,” SIAM Journal on Matrix Analysis and Applications, vol. 30, no. 2, pp. 713–730, 2008. View at Publisher · View at Google Scholar · View at Scopus
  8. J. Kim and H. Park, “Toward faster nonnegative matrix factorization: a new algorithm and comparisons,” in Proceedings of the 8th IEEE International Conference on Data Mining (ICDM '08), pp. 353–362, December 2008. View at Publisher · View at Google Scholar · View at Scopus
  9. J. Kim and H. Park, “Fast nonnegative matrix factorization: an active-set-like method and comparisons,” SIAM Journal on Scientific Computing, vol. 33, no. 6, pp. 3261–3281, 2011. View at Publisher · View at Google Scholar · View at Scopus
  10. D. Bertsekas, Nonlinear Programming, Athena Scientific, Belment, Mass, USA, 1999.
  11. P. Gong and C. Zhang, “Efficient nonnegative matrix factorization via projected Newton method,” Pattern Recognition, vol. 45, no. 9, pp. 3557–3565, 2012. View at Publisher · View at Google Scholar · View at Scopus
  12. D. Bertsekas, “Projected Newton methods for optimization problems with simple constrains,” SIAM Journal on Control and Optimization, vol. 20, no. 2, pp. 221–246, 1982. View at Google Scholar
  13. F. Öztoprak and Ş. I. Birbil, “A symmetric rank-one quasi-Newton line-search method using negative curvature directions,” Optimization Methods and Software, vol. 26, no. 3, pp. 455–486, 2011. View at Publisher · View at Google Scholar · View at Scopus
  14. G. H. Golub and C. F. van Loan, Matrix Computations, The John Hopkins University Press, 1996.
  15. D. D. Lee and H. S. Seung, “Algorithms for nonnegative matrix factorization,” in Proceedings of the Neural Information Proceesing Systems (NIPS '00), pp. 556–562, 2000.