New stepsizes for the gradient method
From MaRDI portal
Recommendations
- Two novel gradient methods with optimal step sizes
- Step-sizes for the gradient method
- New adaptive stepsize selections in gradient methods
- An efficient gradient method with approximate optimal stepsize for the strictly convex quadratic minimization problem
- Gradient methods exploiting spectral properties
Cites work
- A class of gradient unconstrained minimization algorithms with adaptive stepsize
- A limited memory steepest descent method
- A new analysis on the Barzilai-Borwein gradient method
- A new modified Barzilai-Borwein gradient method for the quadratic minimization problem
- A new stepsize for the steepest descent method
- A short note on the Q-linear convergence of the steepest descent method
- Alternate step gradient method*
- An efficient gradient method using the Yuan steplength
- Analysis of monotone gradient methods
- Gradient Method with Retards and Generalizations
- Gradient methods for large scale convex quadratic functions
- New adaptive stepsize selections in gradient methods
- On spectral properties of steepest descent methods
- On the asymptotic behaviour of some new gradient methods
- On the behavior of the gradient norm in the steepest descent method
- On the steepest descent algorithm for quadratic functions
- On the steplength selection in gradient methods for unconstrained optimization
- On the worst-case complexity of the gradient method with exact line search for smooth strongly convex functions
- Relaxed steepest descent and Cauchy-Barzilai-Borwein method
- Step-sizes for the gradient method
- The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
- The method of steepest descent for non-linear minimization problems
- Two-Point Step Size Gradient Methods
- R-linear convergence of the Barzilai and Borwein gradient method
Cited in
(24)- Alternate minimization gradient method
- A step control technique in gradient methods
- Gradient methods with the exponential relaxation
- A note on R-linear convergence of nonmonotone gradient methods
- A new gradient method with an optimal stepsize property
- An efficient gradient method using the Yuan steplength
- Steplengths in the extragradient type methods
- On the asymptotic convergence and acceleration of gradient methods
- On \(R\)-linear convergence analysis for a class of gradient methods
- Two novel gradient methods with optimal step sizes
- Near optimal step size and momentum in gradient descent for quadratic functions
- An accelerated minimal gradient method with momentum for strictly convex quadratic optimization
- New adaptive stepsize selections in gradient methods
- Step-sizes for the gradient method
- Cyclic gradient methods for unconstrained optimization
- Properties of the delayed weighted gradient method
- New gradient methods with adaptive stepsizes by approximate models
- Extending the Step-Size Restriction for Gradient Descent to Avoid Strict Saddle Points
- An asymptotically optimal gradient algorithm for quadratic optimization with low computational cost
- Fast gradient methods with alignment for symmetric linear systems without using Cauchy step
- An efficient gradient method with approximately optimal stepsize based on tensor model for unconstrained optimization
- A gradient method exploiting the two dimensional quadratic termination property
- A harmonic framework for stepsize selection in gradient methods
- Adaptive cyclic gradient methods with interpolation
This page was built for publication: New stepsizes for the gradient method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2228379)
