Cyclic gradient methods for unconstrained optimization
From MaRDI portal
Recommendations
- The cyclic block conditional gradient method for convex optimization problems
- A nonmonotone conjugate gradient algorithm for unconstrained optimization
- Global convergence of a memory gradient method for unconstrained optimization
- The cyclic Barzilai-–Borwein method for unconstrained optimization
- New conjugate gradient method for unconstrained optimization
Cites work
- R-linear convergence of the Barzilai and Borwein gradient method
- A limited memory steepest descent method
- A modified limited memory steepest descent method motivated by an inexact super-linear convergence rate analysis
- A new analysis on the Barzilai-Borwein gradient method
- A new stepsize for the steepest descent method
- A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
- A Nonmonotone Line Search Technique for Newton’s Method
- Alternate minimization gradient method
- Alternate step gradient method*
- An efficient gradient method using the Yuan steplength
- An efficient gradient method with approximate optimal stepsize for the strictly convex quadratic minimization problem
- An efficient gradient method with approximately optimal stepsize based on tensor model for unconstrained optimization
- An unconstrained optimization test functions collection
- Analysis of monotone gradient methods
- CUTE
- Equipping the Barzilai-Borwein method with the two dimensional quadratic termination property
- Feasible Barzilai-Borwein-like methods for extreme symmetric eigenvalue problems
- Gradient methods exploiting spectral properties
- Gradient methods with adaptive step-sizes
- Gravity-magnetic cross-gradient joint inversion by the cyclic gradient method
- New adaptive stepsize selections in gradient methods
- New stepsizes for the gradient method
- On a successive transformation of probability distribution and its application to the analysis of the optimum gradient method
- On spectral properties of steepest descent methods
- On the Barzilai and Borwein choice of steplength for the gradient method
- On the rate of convergence of projected Barzilai-Borwein methods
- On the steplength selection in gradient methods for unconstrained optimization
- Optimization methods for large-scale machine learning
- Quadratic regularization projected Barzilai-Borwein method for nonnegative matrix factorization
- Smoothing projected Barzilai-Borwein method for constrained non-Lipschitz optimization
- Some Numerical Results Using a Sparse Matrix Updating Formula in Unconstrained Optimization
- Step-sizes for the gradient method
- Testing Unconstrained Optimization Software
- The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
- The cyclic Barzilai-–Borwein method for unconstrained optimization
- The Lasso problem and uniqueness
- The topological gradient method: from optimal design to image processing
- Two-Point Step Size Gradient Methods
Cited in
(3)
This page was built for publication: Cyclic gradient methods for unconstrained optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6601975)
