On linear convergence of gradient-type minimization algorithms

DOI10.1023/A:1022601920647zbMath0908.90208OpenAlexW37831537MaRDI QIDQ1265067

Marco Gaviano, Daniela Lera

Publication date: 28 February 1999

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1022601920647

zbMATH Keywords

convergence ratesconvex programmingoptimization algorithmsdescent algorithms

Mathematics Subject Classification ID

Convex programming (90C25)

Related Items (1)

Convergence of line search methods for unconstrained optimization

Cites Work

• Unnamed Item
• Computational methods in optimization. A unified approach.
• Global convergence rates for descent algorithms: Improved results for strictly convex problems

This page was built for publication: On linear convergence of gradient-type minimization algorithms