Global convergence rates for descent algorithms: Improved results for strictly convex problems
From MaRDI portal
Publication:1245148
DOI10.1007/BF00933460zbMath0373.90057MaRDI QIDQ1245148
Publication date: 1978
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Convex programming (90C25) Search theory (90B40) Rate of convergence, degree of approximation (41A25)
Related Items (3)
Some properties of \([tr(Q^{2p})^{1/2p}\) with application to linear minimax estimation] ⋮ On linear convergence of gradient-type minimization algorithms ⋮ Line search by curve fitting in minimization algorithms
Cites Work
This page was built for publication: Global convergence rates for descent algorithms: Improved results for strictly convex problems
