Modified subspace Barzilai-Borwein gradient method for non-negative matrix factorization
From MaRDI portal
Recommendations
- An adaptive nonmonotone projected Barzilai-Borwein gradient method with active set prediction for nonnegative matrix factorization
- Solving non-negative matrix factorization by alternating least squares with a modified strategy
- An efficient monotone projected Barzilai-Borwein method for nonnegative matrix factorization
- Alternating projected Barzilai-Borwein methods for nonnegative matrix factorization
- Quadratic regularization projected Barzilai-Borwein method for nonnegative matrix factorization
Cites work
- 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
- Document clustering using nonnegative matrix factorization
- Evaluation of distance metrics for recognition based on non-negative matrix factorization
- Introducing a weighted non-negative matrix factorization for image classification
- Learning image components for object recognition
- Learning the parts of objects by non-negative matrix factorization
- Modified two-point stepsize gradient methods for unconstrained optimization
- New adaptive stepsize selections in gradient methods
- Non-negative matrix factorization with sparseness constraints
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- On the asymptotic behaviour of some new gradient methods
- On the convergence of the block nonlinear Gauss-Seidel method under convex constraints
- Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming
- Projected Gradient Methods for Nonnegative Matrix Factorization
- Subspace Barzilai-Borwein gradient method for large-scale bound constrained optimization
- Two-Metric Projection Methods for Constrained Optimization
- Two-Point Step Size Gradient Methods
- \(R\)-linear convergence of the Barzilai and Borwein gradient method
Cited in
(11)- A modified strategy in alternating non-negative least squares for non-negative matrix factorization
- Efficient algorithms for solving condition number-constrained matrix minimization problems
- An adaptive nonmonotone projected Barzilai-Borwein gradient method with active set prediction for nonnegative matrix factorization
- A class of modified FR conjugate gradient method and applications to non-negative matrix factorization
- An efficient monotone projected Barzilai-Borwein method for nonnegative matrix factorization
- Solving non-negative matrix factorization by alternating least squares with a modified strategy
- A modified non-monotonic projection gradient method for non-negative matrix factorization
- Alternating projected Barzilai-Borwein methods for nonnegative matrix factorization
- An efficient gradient method with approximately optimal stepsize based on tensor model for unconstrained optimization
- Index search method for solving nonnegative matrix factorization
- Nonmonotone quasi-Newton-based conjugate gradient methods with application to signal processing
This page was built for publication: Modified subspace Barzilai-Borwein gradient method for non-negative matrix factorization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q354621)
