Non-monotone projection gradient method for non-negative matrix factorization
From MaRDI portal
Publication:429483
DOI10.1007/s10589-010-9387-6zbMath1239.49011OpenAlexW2032532623MaRDI QIDQ429483
Xiuyun Zheng, Xiang-Li Li, Hong-Wei Liu
Publication date: 19 June 2012
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-010-9387-6
Variational inequalities (49J40) Newton-type methods (49M15) Optimality conditions for problems in abstract spaces (49K27)
Related Items (2)
Spectral residual methods with two new non-monotone line searches for large-scale nonlinear systems of equations ⋮ Iterative algorithm for the Q-weighted nonnegative matrix factorization
Cites Work
- Unnamed Item
- Unnamed Item
- Document clustering using nonnegative matrix factorization
- On the Goldstein-Levitin-Polyak gradient projection method
- Introducing a weighted non-negative matrix factorization for image classification
- Alternate minimization gradient method
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
- A Nonmonotone Line Search Technique for Newton’s Method
- An Assessment of Nonmonotone Linesearch Techniques for Unconstrained Optimization
- Learning the parts of objects by non-negative matrix factorization
This page was built for publication: Non-monotone projection gradient method for non-negative matrix factorization