{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:46:45Z","timestamp":1740124005717,"version":"3.37.3"},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,4,22]],"date-time":"2022-04-22T00:00:00Z","timestamp":1650585600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,4,22]],"date-time":"2022-04-22T00:00:00Z","timestamp":1650585600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100013296","name":"Max Planck Institute for Mathematics in the Sciences","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100013296","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Optim Theory Appl"],"published-print":{"date-parts":[[2022,7]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Based on a result by Taylor et al. (J Optim Theory Appl 178(2):455\u2013476, 2018) on the attainable convergence rate of gradient descent for smooth and strongly convex functions in terms of function values, an elementary convergence analysis for general descent methods with fixed step sizes is presented. It covers general variable metric methods, gradient-related search directions under angle and scaling conditions, as well as inexact gradient methods. In all cases, optimal rates are obtained.<\/jats:p>","DOI":"10.1007\/s10957-022-02032-z","type":"journal-article","created":{"date-parts":[[2022,4,22]],"date-time":"2022-04-22T15:02:48Z","timestamp":1650639768000},"page":"364-373","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Note on the Optimal Convergence Rate of Descent Methods with Fixed Step Sizes for Smooth Strongly Convex Functions"],"prefix":"10.1007","volume":"194","author":[{"given":"Andr\u00e9","family":"Uschmajew","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bart","family":"Vandereycken","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,4,22]]},"reference":[{"issue":"2","key":"2032_CR1","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/BF00935546","volume":"33","author":"AI Cohen","year":"1981","unstructured":"Cohen, A.I.: Stepsize analysis for descent methods. J. Optim. Theory Appl. 33(2), 187\u2013205 (1981)","journal-title":"J. Optim. Theory Appl."},{"issue":"7","key":"2032_CR2","doi-asserted-by":"publisher","first-page":"1185","DOI":"10.1007\/s11590-016-1087-4","volume":"11","author":"E de Klerk","year":"2017","unstructured":"de Klerk, E., Glineur, F., Taylor, A.B.: On the worst-case complexity of the gradient method with exact line search for smooth strongly convex functions. Optim. Lett. 11(7), 1185\u20131199 (2017)","journal-title":"Optim. Lett."},{"issue":"3","key":"2032_CR3","doi-asserted-by":"publisher","first-page":"2053","DOI":"10.1137\/19M1281368","volume":"30","author":"E de Klerk","year":"2020","unstructured":"de Klerk, E., Glineur, F., Taylor, A.B.: Worst-case convergence analysis of inexact gradient and Newton methods through semidefinite programming performance estimation. SIAM J. Optim. 30(3), 2053\u20132082 (2020)","journal-title":"SIAM J. Optim."},{"key":"2032_CR4","doi-asserted-by":"crossref","unstructured":"Gannot, O.: A frequency-domain analysis of inexact gradient methods. Math. Program. (2021)","DOI":"10.1007\/s10107-021-01665-8"},{"key":"2032_CR5","unstructured":"Munthe-Kaas, H.: The convergence rate of inexact preconditioned steepest descent algorithm for solving linear systems. Technical report NA-87-04, Stanford University (1987)"},{"key":"2032_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-8853-9","volume-title":"Introductory Lectures on Convex Optimization","author":"Y Nesterov","year":"2004","unstructured":"Nesterov, Y.: Introductory Lectures on Convex Optimization. Kluwer, Boston (2004)"},{"key":"2032_CR7","volume-title":"Numerical Optimization","author":"J Nocedal","year":"2006","unstructured":"Nocedal, J., Wright, S.J.: Numerical Optimization, 2nd edn. Springer, New York (2006)","edition":"2"},{"key":"2032_CR8","volume-title":"Iterative Solution of Nonlinear Equations in Several Variables","author":"JM Ortega","year":"1970","unstructured":"Ortega, J.M., Rheinboldt, W.C.: Iterative Solution of Nonlinear Equations in Several Variables. Academic Press, New York (1970)"},{"issue":"2","key":"2032_CR9","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1007\/s10957-018-1298-1","volume":"178","author":"AB Taylor","year":"2018","unstructured":"Taylor, A.B., Hendrickx, J.M., Glineur, F.: Exact worst-case convergence rates of the proximal gradient method for composite convex minimization. J. Optim. Theory Appl. 178(2), 455\u2013476 (2018)","journal-title":"J. Optim. Theory Appl."},{"issue":"4","key":"2032_CR10","doi-asserted-by":"publisher","first-page":"815","DOI":"10.1287\/moor.19.4.815","volume":"19","author":"H Wolkowicz","year":"1994","unstructured":"Wolkowicz, H.: Measures for symmetric rank-one updates. Math. Oper. Res. 19(4), 815\u2013830 (1994)","journal-title":"Math. Oper. Res."}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-022-02032-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10957-022-02032-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-022-02032-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,31]],"date-time":"2022-05-31T16:56:04Z","timestamp":1654016164000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10957-022-02032-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,4,22]]},"references-count":10,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,7]]}},"alternative-id":["2032"],"URL":"https:\/\/doi.org\/10.1007\/s10957-022-02032-z","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"type":"print","value":"0022-3239"},{"type":"electronic","value":"1573-2878"}],"subject":[],"published":{"date-parts":[[2022,4,22]]},"assertion":[{"value":"1 July 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 March 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 April 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}