A nonmonotone line search technique for Newton's method
SIAM Journal on Numerical Analysis
An assessment of nonmonotone linesearch techniques for unconstrained optimization
SIAM Journal on Scientific Computing
Nonmonotone Spectral Projected Gradient Methods on Convex Sets
SIAM Journal on Optimization
Introducing a weighted non-negative matrix factorization for image classification
Pattern Recognition Letters
A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
SIAM Journal on Optimization
Non-negative matrix factorization based methods for object recognition
Pattern Recognition Letters
CSB '04 Proceedings of the 2004 IEEE Computational Systems Bioinformatics Conference
Nonnegative features of spectro-temporal sounds for classification
Pattern Recognition Letters
Nonsmooth Nonnegative Matrix Factorization (nsNMF)
IEEE Transactions on Pattern Analysis and Machine Intelligence
Learning Image Components for Object Recognition
The Journal of Machine Learning Research
Fast nonnegative matrix factorization and its application for protein fold recognition
EURASIP Journal on Applied Signal Processing
Hi-index | 0.00 |
Since Non-negative Matrix Factorization (NMF) was first proposed over a decade ago, it has attracted much attention, particularly when applied to numerous data analysis problems. Most of the existing algorithms for NMF are based on multiplicative iterative and alternating least squares algorithms. However, algorithms based on the optimization method are few, especially in the case where two variables are derived at the same time. In this paper, we propose a non-monotone projection gradient method for NMF and establish the convergence results of our algorithm. Experimental results show that our algorithm converges to better solutions than popular multiplicative update-based algorithms.