A Dynamical-System Analysis of the Optimum s-Gradient Algorithm
From MaRDI portal
Publication:3567628
DOI10.1007/978-0-387-79936-0_3zbMath1220.90080OpenAlexW94444364WikidataQ61855778 ScholiaQ61855778MaRDI QIDQ3567628
Henry P. Wynn, Anatoly A. Zhigljavsky, Luc Pronzato
Publication date: 17 June 2010
Published in: Optimal Design and Related Areas in Optimization and Statistics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-0-387-79936-0_3
Related Items
Steepest descent method with random step lengths, An asymptotically optimal gradient algorithm for quadratic optimization with low computational cost, Estimation of spectral bounds in gradient algorithms, On the Forsythe conjecture, Gradient algorithms for quadratic optimization with fast convergence rates, Level set of the asymptotic rate of convergence for the method of steepest descent
