Two novel gradient methods with optimal step sizes
From MaRDI portal
Publication:3381082
Recommendations
- New stepsizes for the gradient method
- An efficient gradient method with approximate optimal stepsize for the strictly convex quadratic minimization problem
- Several efficient gradient methods with approximate optimal stepsizes for large scale unconstrained optimization
- On the acceleration of the Barzilai-Borwein method
- Equipping the Barzilai-Borwein method with the two dimensional quadratic termination property
Cited in
(23)- New adaptive stepsize selections in gradient methods
- An accelerated minimal gradient method with momentum for strictly convex quadratic optimization
- Two-point step size gradient method for solving a deep learning problem
- New stepsizes for the gradient method
- A second-order gradient method for convex minimization
- Several efficient gradient methods with approximate optimal stepsizes for large scale unconstrained optimization
- A new gradient method with an optimal stepsize property
- A harmonic framework for stepsize selection in gradient methods
- Step-sizes for the gradient method
- Two-Point Step Size Gradient Methods
- An efficient gradient method with approximate optimal stepsize for the strictly convex quadratic minimization problem
- Equipping the Barzilai-Borwein method with the two dimensional quadratic termination property
- Extending the Step-Size Restriction for Gradient Descent to Avoid Strict Saddle Points
- A new modified Barzilai-Borwein gradient method for the quadratic minimization problem
- On the Barzilai and Borwein choice of steplength for the gradient method
- A collection of efficient retractions for the symplectic Stiefel manifold
- A dynamical systems approach to machine learning
- Delayed weighted gradient method with simultaneous step-sizes for strongly convex optimization
- New gradient methods with adaptive stepsizes by approximate models
- Solving weighted orthogonal Procrustes problems via a projected gradient method
- A cyclic delayed weighted steplength for the gradient method
- A worst-case complexity analysis for Riemannian non-monotone line-search methods
- Gradient methods with adaptive step-sizes
This page was built for publication: Two novel gradient methods with optimal step sizes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3381082)
