On the worst case performance of the steepest descent algorithm for quadratic functions

DOI10.1007/s10107-016-0984-8zbMath1349.90763OpenAlexW2283311117MaRDI QIDQ344945

Clóvis C. Gonzaga

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Related Items

On initial point selection of the steepest descent algorithm for general quadratic functions, Delayed Gradient Methods for Symmetric and Positive Definite Linear Systems, On the steplength selection in gradient methods for unconstrained optimization

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• On the behavior of the gradient norm in the steepest descent method
• On the asymptotic directions of the s-dimensional optimum gradient method
• On spectral properties of steepest descent methods
• The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
• Solution of Linear Systems by Richardson's Method
• Two-Point Step Size Gradient Methods
• Alternate step gradient method*
• Relaxed steepest descent and Cauchy-Barzilai-Borwein method
• On the steepest descent algorithm for quadratic functions