On linear convergence of gradient-type minimization algorithms

DOI10.1023/A:1022601920647MaRDI QIDQ1265067zbMATH OpenOpenAlexFDO

Authors 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 programmingdescent algorithmsoptimization algorithms

Mathematics Subject Classification ID

Convex programming (90C25)

Recommendations

• scientific article; zbMATH DE number 165427
• scientific article; zbMATH DE number 3896674
• Publication:4490820
• On the Linear Convergence of Descent Methods for Convex Essentially Smooth Minimization

Cites work

• Computational methods in optimization. A unified approach.
• Global convergence rates for descent algorithms: Improved results for strictly convex problems
• scientific article; zbMATH DE number 3381785 (Why is no real title available?)

Cited in

(2)

• Convergence of line search methods for unconstrained optimization
• New analysis of linear convergence of gradient-type methods via unifying error bound conditions

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1265067)