A cyclic delayed weighted steplength for the gradient method
From MaRDI portal
Cites work
- R-linear convergence of the Barzilai and Borwein gradient method
- A delayed weighted gradient method for strictly convex quadratic minimization
- A family of spectral gradient methods for optimization
- A hybrid gradient method for strictly convex quadratic programming
- A new stepsize for the steepest descent method
- A two-phase gradient method for quadratic programming problems with a single linear constraint and bounds on the variables
- Algorithms for bound constrained quadratic programming problems
- 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
- Gradient Method with Retards and Generalizations
- Gradient methods with adaptive step-sizes
- scientific article; zbMATH DE number 3912096 (Why is no real title available?)
- scientific article; zbMATH DE number 3074442 (Why is no real title available?)
- Methods of conjugate gradients for solving linear systems
- New adaptive stepsize selections in gradient methods
- On the Barzilai and Borwein choice of steplength for the gradient method
- On the regularizing behavior of the SDA and SDC gradient methods in the solution of linear ill-posed problems
- On the steplength selection in gradient methods for unconstrained optimization
- Steplength selection in gradient projection methods for box-constrained quadratic programs
- The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
- Two novel gradient methods with optimal step sizes
- Two-Point Step Size Gradient Methods
This page was built for publication: A cyclic delayed weighted steplength for the gradient method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6964846)
