On the steepest descent algorithm for quadratic functions
From MaRDI portal
Recommendations
Cites work
- Alternate step gradient method*
- An efficient gradient method using the Yuan steplength
- Benchmarking optimization software with performance profiles.
- 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 asymptotic directions of the s-dimensional optimum gradient method
- On the behavior of the gradient norm in the steepest descent method
- Relaxed steepest descent and Cauchy-Barzilai-Borwein method
- The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
- Two-Point Step Size Gradient Methods
Cited in
(31)- A new descent algorithm using the three-step discretization method for solving unconstrained optimization problems
- A cyclic block coordinate descent method with generalized gradient projections
- Reconstruction of 3D X-ray CT images from reduced sampling by a scaled gradient projection algorithm
- A coordinate descent method for total variation minimization
- Steplength selection in gradient projection methods for box-constrained quadratic programs
- On the asymptotic convergence and acceleration of gradient methods
- On the acceleration of the Barzilai-Borwein method
- On initial point selection of the steepest descent algorithm for general quadratic functions
- Fast gradient methods with alignment for symmetric linear systems without using Cauchy step
- New stepsizes for the gradient method
- A family of spectral gradient methods for optimization
- Gradient method with multiple damping for large-scale unconstrained optimization
- On the steplength selection in gradient methods for unconstrained optimization
- A family of optimal weighted conjugate-gradient-type methods for strictly convex quadratic minimization
- Some convergence properties of the steepest descent algorithm revealed by renormalisation.
- scientific article; zbMATH DE number 3861897 (Why is no real title available?)
- On the worst case performance of the steepest descent algorithm for quadratic functions
- On Steepest Descent Algorithms for Discrete Convex Functions
- scientific article; zbMATH DE number 1374516 (Why is no real title available?)
- Delayed gradient methods for symmetric and positive definite linear systems
- A new modified Barzilai-Borwein gradient method for the quadratic minimization problem
- Gradient methods exploiting spectral properties
- Semistability of steepest descent with momentum for quadratic functions
- A study on the optimal double parameters for steepest descent with momentum
- On the Forsythe conjecture
- Fast gradient method for low-rank matrix estimation
- Barzilai–Borwein-like rules in proximal gradient schemes for ℓ 1 -regularized problems
- On a family of relaxed gradient descent methods for strictly convex quadratic minimization
- A speed up strategy for gradient methods
- A Proof of the Forsythe Conjecture for the Two-Step Restarted Conjugate Gradient Method
- A short note on the Q-linear convergence of the steepest descent method
This page was built for publication: On the steepest descent algorithm for quadratic functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5963682)
