A short note on the Q-linear convergence of the steepest descent method

DOI10.1007/s10107-009-0267-8zbMath1189.90164OpenAlexW2054163799MaRDI QIDQ964182

Ya-Xiang Yuan

Publication date: 15 April 2010

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-009-0267-8

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Related Items (3)

Delayed Gradient Methods for Symmetric and Positive Definite Linear Systems ⋮ New stepsizes for the gradient method ⋮ On \(R\)-linear convergence analysis for a class of gradient methods

Cites Work

• Optimization theory and methods. Nonlinear programming
• On the asymptotic directions of the s-dimensional optimum gradient method
• Numerical Optimization

This page was built for publication: A short note on the Q-linear convergence of the steepest descent method