Global convergence rates for descent algorithms: Improved results for strictly convex problems

DOI10.1007/BF00933460MaRDI QIDQ1245148zbMATH OpenFDO

Authors J. C. Allwright

Publication date 1978

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

Full work available at URL https://doi.org/10.1007/BF00933460

Mathematics Subject Classification ID

Rate of convergence, degree of approximation (41A25) Search theory (90B40) Convex programming (90C25)

Cited in

(3)

• On linear convergence of gradient-type minimization algorithms
• Line search by curve fitting in minimization algorithms
• Some properties of \([tr(Q^{2p})]^{1/2p}\) with application to linear minimax estimation

This page was built for publication: Global convergence rates for descent algorithms: Improved results for strictly convex problems

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