Efficient Nonnegative Matrix Factorization Via Modified Monotone Barzilai-Borwein Method with Adaptive Step Sizes Strategy
From MaRDI portal
Publication:6049032
DOI10.4208/jcm.2201-m2019-0145OpenAlexW4375843113MaRDI QIDQ6049032
Xuenian Liu, Ji-Cheng Li, Wenbo Li
Publication date: 16 October 2023
Published in: Journal of Computational Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4208/jcm.2201-m2019-0145
active set strategyadaptive step sizesalternating nonnegative least squareslarger step sizemonotone projected Barzilai-Borwein method
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Cites Work
- Unnamed Item
- Modified active set projected spectral gradient method for bound constrained optimization
- Alternating projected Barzilai-Borwein methods for nonnegative matrix factorization
- Quadratic regularization projected Barzilai-Borwein method for nonnegative matrix factorization
- Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming
- An active set feasible method for large-scale minimization problems with bound constraints
- On the convergence of the block nonlinear Gauss-Seidel method under convex constraints
- An efficient monotone projected Barzilai-Borwein method for nonnegative matrix factorization
- Document clustering using nonnegative matrix factorization
- Two-Point Step Size Gradient Methods
- An Active Set Newton Algorithm for Large-Scale Nonlinear Programs with Box Constraints
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- NeNMF: An Optimal Gradient Method for Nonnegative Matrix Factorization
- Learning the parts of objects by non-negative matrix factorization
- Projected Gradient Methods for Nonnegative Matrix Factorization
This page was built for publication: Efficient Nonnegative Matrix Factorization Via Modified Monotone Barzilai-Borwein Method with Adaptive Step Sizes Strategy