{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,16]],"date-time":"2025-12-16T12:22:21Z","timestamp":1765887741890},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2015,11,23]],"date-time":"2015-11-23T00:00:00Z","timestamp":1448236800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Found Comput Math"],"published-print":{"date-parts":[[2017,4]]},"DOI":"10.1007\/s10208-015-9290-8","type":"journal-article","created":{"date-parts":[[2015,11,23]],"date-time":"2015-11-23T13:17:42Z","timestamp":1448284662000},"page":"359-422","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Steepest Descent Method with Random Step Lengths"],"prefix":"10.1007","volume":"17","author":[{"given":"Zden\u011bk","family":"Kalousek","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,11,23]]},"reference":[{"key":"9290_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01831719","volume":"11","author":"H Akaike","year":"1959","unstructured":"H. Akaike: On a successive transformation of probability distribution and its application to the analysis of the optimum gradient method. Ann. Inst. Statist. Math. Tokyo 11 (1959), 1 \u2013 16","journal-title":"Ann. Inst. Statist. Math. Tokyo"},{"key":"9290_CR2","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1093\/imanum\/8.1.141","volume":"8","author":"J Barzilai","year":"1988","unstructured":"J. Barzilai and J. M. Borwein: Two-point step size gradient methods. IMA Journal of Numerical Analysis 8 (1988), 141 \u2013 148","journal-title":"IMA Journal of Numerical Analysis"},{"key":"9290_CR3","first-page":"536","volume":"25","author":"A Cauchy","year":"1847","unstructured":"A. Cauchy: M\u00e9thode g\u00e9nerale pour la r\u00e9solution des syst\u00e8mes d\u2019\u00a0\u00e9quations simultan\u00e9es. Comptes Rendus Hebd. S\u00e9ances Acad. Sci. 25 (1847), 536\u2013538,","journal-title":"Comptes Rendus Hebd. S\u00e9ances Acad. Sci."},{"issue":"1","key":"9290_CR4","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/s00211-004-0569-y","volume":"100","author":"YH Dai","year":"2005","unstructured":"Y. H. Dai and R. Fletcher: Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming. Numerische Mathematik 100 (2005), No. 1, 21 \u2013 47","journal-title":"Numerische Mathematik"},{"key":"9290_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1093\/imanum\/22.1.1","volume":"22","author":"YH Dai","year":"2002","unstructured":"Y. H. Dai and L. Z. Liao: $$R$$ R -linear convergence of the Barzilai-Borwein gradient method. IMA Journal of Numerical Analysis vol. 22 (2002), 1 \u2013 10","journal-title":"IMA Journal of Numerical Analysis"},{"key":"9290_CR6","doi-asserted-by":"crossref","unstructured":"R. Fletcher and C. M. Reeves: Function minimization by conjugate gradients, The Computer Journal 1964, 149 \u2013 154","DOI":"10.1093\/comjnl\/7.2.149"},{"key":"9290_CR7","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/BF02165472","volume":"11","author":"GE Forsythe","year":"1968","unstructured":"G. E. Forsythe: On the asymptotic directions of the $$s$$ s -dimensional optimum gradient method. Numerische Mathematik 11 (1968), 57 \u2013 76","journal-title":"Numerische Mathematik"},{"key":"9290_CR8","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1137\/S003614299427315X","volume":"36","author":"A Friedlander","year":"1999","unstructured":"A. Friedlander, J. M. Mart\u00ednez, N. Molina and M. Raydan: Gradient method with retards and generalizations. SIAM J. Numer. Anal. 36 (1999), 275 \u2013 289","journal-title":"SIAM J. Numer. Anal."},{"key":"9290_CR9","unstructured":"Kalousek, Z.: Appeal of inexact calculations in Proceedings of conference \u201cModern mathematical methods in engineering\u201d, V\u0160B-TU Ostrava, 2013"},{"key":"9290_CR10","first-page":"186","volume":"16","author":"F Luengo","year":"2003","unstructured":"F. Luengo and M. Raydan: Gradient method with dynamical retards for large-scale optimization problems. Electronic Transactions on Numerical Analysis, 16 (2003), 186 \u2013 193","journal-title":"Electronic Transactions on Numerical Analysis"},{"key":"9290_CR11","first-page":"591","volume":"6","author":"Y Narushima","year":"2010","unstructured":"Y. Narushima, T. Wakamatsu and H. Yabe: Extended Barzilai-Borwein method for unconstrained minimization problems. Pacific journal of optimization 6 (2010), 591 - 613","journal-title":"Pacific journal of optimization"},{"key":"9290_CR12","doi-asserted-by":"crossref","unstructured":"L. Pronzato, P. Wynn and A. A. Zhigljavsky: A dynamical-system analysis of the optimum $$s$$ s -gradient algorithm in Optimal design and related areas in optimization and statistics (editors L. Pronzato and A. A. Zhigljavsky) , Springer, 2009, pp. 39 \u2013 80","DOI":"10.1007\/978-0-387-79936-0_3"},{"key":"9290_CR13","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1007\/s10589-010-9319-5","volume":"50","author":"L Pronzato","year":"2011","unstructured":"L. Pronzato and A. A. Zhigljavsky: Gradient algorithms for quadratic optimization with fast convergence rates. Computational Optimization and Applications 50 (2011), 597 \u2013 617","journal-title":"Computational Optimization and Applications"},{"key":"9290_CR14","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1137\/S1052623494266365","volume":"7","author":"M Raydan","year":"1997","unstructured":"M. Raydan: The Barzilai and Borwein gradient method for the large scale unconstrained minimization problem. SIAM Journal on Optimization 7 (1997), 26\u201333","journal-title":"SIAM Journal on Optimization"},{"key":"9290_CR15","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1023\/A:1013708715892","volume":"21","author":"M Raydan","year":"2002","unstructured":"M. Raydan and B. F. Svaiter: Relaxed steepest descent and Cauchy-Barzilai-Borwein method. Computational Optimization and Applications 21 (2002), 155 \u2013 167","journal-title":"Computational Optimization and Applications"}],"container-title":["Foundations of Computational Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10208-015-9290-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10208-015-9290-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10208-015-9290-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10208-015-9290-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T07:05:16Z","timestamp":1559113516000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10208-015-9290-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,11,23]]},"references-count":15,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,4]]}},"alternative-id":["9290"],"URL":"https:\/\/doi.org\/10.1007\/s10208-015-9290-8","relation":{},"ISSN":["1615-3375","1615-3383"],"issn-type":[{"value":"1615-3375","type":"print"},{"value":"1615-3383","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,11,23]]}}}