{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,24]],"date-time":"2025-06-24T07:10:56Z","timestamp":1750749056661,"version":"3.41.0"},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2024,11,2]],"date-time":"2024-11-02T00:00:00Z","timestamp":1730505600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,11,2]],"date-time":"2024-11-02T00:00:00Z","timestamp":1730505600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2025,7]]},"DOI":"10.1007\/s11590-024-02159-0","type":"journal-article","created":{"date-parts":[[2024,11,2]],"date-time":"2024-11-02T04:38:59Z","timestamp":1730522339000},"page":"1099-1116","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A new convergence rate of the steepest descent regarding the Euclidean norm"],"prefix":"10.1007","volume":"19","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9176-2999","authenticated-orcid":false,"given":"Ademir A.","family":"Ribeiro","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tatiane C.","family":"Silva","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gislaine A.","family":"Peri\u00e7aro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,11,2]]},"reference":[{"key":"2159_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01831719","volume":"1","author":"H Akaike","year":"1959","unstructured":"Akaike, H.: On a successive transformation of probability distribution and its application to the analysis of the optimum gradient method. Ann. Inst. Statist. Math. 1, 1\u201316 (1959). https:\/\/doi.org\/10.1007\/BF01831719","journal-title":"Ann. Inst. Statist. Math."},{"key":"2159_CR2","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1093\/imanum\/8.1.141","volume":"8","author":"J Barzilai","year":"1988","unstructured":"Barzilai, J., Borwein, J.M.: Two-point step size gradient methods. IMA J. Numer. Anal. 8, 141\u2013148 (1988). https:\/\/doi.org\/10.1093\/imanum\/8.1.141","journal-title":"IMA J. Numer. Anal."},{"key":"2159_CR3","doi-asserted-by":"publisher","DOI":"10.1002\/0471787779","volume-title":"Nonlinear programming theory and algorithms","author":"MS Bazaraa","year":"2006","unstructured":"Bazaraa, M.S., Sherali, H.D., Shetty, C.M.: Nonlinear programming theory and algorithms, 3rd edn. John Wiley & Sons, New Jersey (2006)","edition":"3"},{"key":"2159_CR4","volume-title":"Nonlinear programming","author":"DP Bertsekas","year":"1999","unstructured":"Bertsekas, D.P.: Nonlinear programming, 2nd edn. Athena Scientific, Belmont, Massachusetts (1999)","edition":"2"},{"issue":"1","key":"2159_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1093\/imanum\/22.1.1","volume":"22","author":"YH Dai","year":"2002","unstructured":"Dai, Y.H., Liao, L.Z.: R-linear convergence of the Barzilai and Borwein gradient method. IMA J. Numer. Anal. 22(1), 1\u201310 (2002). https:\/\/doi.org\/10.1093\/imanum\/22.1.1","journal-title":"IMA J. Numer. Anal."},{"key":"2159_CR6","volume-title":"Pratical methods of optimization","author":"R Fletcher","year":"1987","unstructured":"Fletcher, R.: Pratical methods of optimization, 2nd edn. John Wiley, New York (1987)","edition":"2"},{"key":"2159_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-74503-9","volume-title":"Linear and nonlinear programming","author":"DG Luenberger","year":"2008","unstructured":"Luenberger, D.G., Ye, Y.: Linear and nonlinear programming, 3rd edn. Springer, New York (2008)","edition":"3"},{"issue":"1","key":"2159_CR8","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1137\/S1052623494266365","volume":"7","author":"M Raydan","year":"1997","unstructured":"Raydan, M.: The Barzilai and Borwein gradient method for large scale unconstrained minimization problem. SIAM J. Optim. 7(1), 26\u201333 (1997). https:\/\/doi.org\/10.1137\/S1052623494266365","journal-title":"SIAM J. Optim."},{"key":"2159_CR9","doi-asserted-by":"publisher","unstructured":"Silva, T.C., Ribeiro, A.A., Peri\u00e7aro, G.A.: A new convergence rate of the steepest descent applied to the minimization of quadratic functions. In: Proceeding Series of the Brazilian Society of Computational and Applied Mathematics, vol.\u00a02. Brazilian Society of Computational and Applied Mathematics, Brazil (2014). https:\/\/doi.org\/10.5540\/03.2014.002.01.0119","DOI":"10.5540\/03.2014.002.01.0119"},{"key":"2159_CR10","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/s10107-009-0267-8","volume":"123","author":"Y Ya-xiang","year":"2010","unstructured":"Ya-xiang, Y.: A short note on the Q-linear convergence of the steepest descent method. Math. Program. 123, 339\u2013343 (2010)","journal-title":"Math. Program."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-024-02159-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11590-024-02159-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-024-02159-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:01:39Z","timestamp":1750197699000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11590-024-02159-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11,2]]},"references-count":10,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2025,7]]}},"alternative-id":["2159"],"URL":"https:\/\/doi.org\/10.1007\/s11590-024-02159-0","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"type":"print","value":"1862-4472"},{"type":"electronic","value":"1862-4480"}],"subject":[],"published":{"date-parts":[[2024,11,2]]},"assertion":[{"value":"21 November 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 October 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 November 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"All authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}