On the worst case performance of the steepest descent algorithm for quadratic functions
From MaRDI portal
Publication:344945
DOI10.1007/S10107-016-0984-8zbMATH Open1349.90763OpenAlexW2283311117MaRDI QIDQ344945FDOQ344945
Publication date: 25 November 2016
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-016-0984-8
Recommendations
Numerical mathematical programming methods (65K05) Analysis of algorithms and problem complexity (68Q25) Nonlinear programming (90C30)
Cites Work
- The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
- Two-Point Step Size Gradient Methods
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the behavior of the gradient norm in the steepest descent method
- On spectral properties of steepest descent methods
- An efficient gradient method using the Yuan steplength
- On a successive transformation of probability distribution and its application to the analysis of the optimum gradient method
- Relaxed steepest descent and Cauchy-Barzilai-Borwein method
- On the asymptotic directions of the s-dimensional optimum gradient method
- Solution of Linear Systems by Richardson's Method
- Alternate step gradient method*
- On the steepest descent algorithm for quadratic functions
Cited In (5)
- Delayed Gradient Methods for Symmetric and Positive Definite Linear Systems
- On initial point selection of the steepest descent algorithm for general quadratic functions
- Some convergence properties of the steepest descent algorithm revealed by renormalisation.
- On the steplength selection in gradient methods for unconstrained optimization
- Title not available (Why is that?)
This page was built for publication: On the worst case performance of 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 Q344945)
