{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,17]],"date-time":"2026-04-17T15:30:20Z","timestamp":1776439820402,"version":"3.51.2"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2021,11,25]],"date-time":"2021-11-25T00:00:00Z","timestamp":1637798400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,11,25]],"date-time":"2021-11-25T00:00:00Z","timestamp":1637798400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100016883","name":"Funda\u00e7\u00e3o Getulio Vargas","doi-asserted-by":"crossref","id":[{"id":"10.13039\/100016883","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001807","name":"FAPESP","doi-asserted-by":"crossref","award":["2013\/05475-7"],"award-info":[{"award-number":["2013\/05475-7"]}],"id":[{"id":"10.13039\/501100001807","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001807","name":"FAPESP","doi-asserted-by":"crossref","award":["2017\/18308-2"],"award-info":[{"award-number":["2017\/18308-2"]}],"id":[{"id":"10.13039\/501100001807","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100003593","name":"CNPq","doi-asserted-by":"crossref","award":["301888\/2017- 5"],"award-info":[{"award-number":["301888\/2017- 5"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001871","name":"Funda\u00e7\u00e3o para a Ci\u00eancia e a Tecnologia","doi-asserted-by":"publisher","award":["UIDB\/MAT\/00297\/2020"],"award-info":[{"award-number":["UIDB\/MAT\/00297\/2020"]}],"id":[{"id":"10.13039\/501100001871","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Numer Algor"],"published-print":{"date-parts":[[2022,7]]},"DOI":"10.1007\/s11075-021-01228-0","type":"journal-article","created":{"date-parts":[[2021,11,25]],"date-time":"2021-11-25T14:03:47Z","timestamp":1637849027000},"page":"1225-1252","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A family of optimal weighted conjugate-gradient-type methods for strictly convex quadratic minimization"],"prefix":"10.1007","volume":"90","author":[{"given":"Harry","family":"Oviedo","sequence":"first","affiliation":[]},{"given":"Roberto","family":"Andreani","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0417-7981","authenticated-orcid":false,"given":"Marcos","family":"Raydan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,11,25]]},"reference":[{"key":"1228_CR1","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/s10589-020-00232-9","volume":"78","author":"R Andreani","year":"2021","unstructured":"Andreani, R., Raydan, M.: Properties of the delayed weighted gradient method. Comput. Optim. Appl. 78, 167\u2013180 (2021)","journal-title":"Comput. Optim. Appl."},{"key":"1228_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: Two-point step size gradient methods. IMA J. Numer. Anal. 8, 141\u2013148 (1988)","journal-title":"IMA J. Numer. Anal."},{"key":"1228_CR3","first-page":"271","volume":"508","author":"C Brezinski","year":"1998","unstructured":"Brezinski, C: Hybrid methods for solving systems of equations. NATO ASI Ser. C Math. Phys. Sci.-Adv. Study Inst. 508, 271\u2013290 (1998)","journal-title":"NATO ASI Ser. C Math. Phys. Sci.-Adv. Study Inst."},{"key":"1228_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s002110050015","volume":"67","author":"C Brezinski","year":"1994","unstructured":"Brezinski, C., Redivo-Zaglia, M: Hybrid procedures for solving linear systems. Numer. Math. 67, 1\u201319 (1994)","journal-title":"Numer. Math."},{"key":"1228_CR5","doi-asserted-by":"publisher","first-page":"916","DOI":"10.4208\/jcm.1911-m2019-0171","volume":"37","author":"O Burdakov","year":"2019","unstructured":"Burdakov, O., Dai, Y.-H., Huang, N: Stabilized Barzilai-Borwein method. J. Comput. Math. 37, 916\u2013936 (2019)","journal-title":"J. Comput. Math."},{"key":"1228_CR6","first-page":"536","volume":"25","author":"A Cauchy","year":"1847","unstructured":"Cauchy, A: M\u00e9thode g\u00e9n\u00e9rale pour la r\u00e9solution des systemes d\u2019\u00e9quations simultan\u00e9es. Comptes Rendus Sci. Paris 25, 536\u2013538 (1847)","journal-title":"Comptes Rendus Sci. Paris"},{"key":"1228_CR7","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1007\/s10107-004-0516-9","volume":"13","author":"Y-H Dai","year":"2005","unstructured":"Dai, Y.-H., Fletcher, R.: On the asymptotic behaviour of some new gradient methods. Math. Program. Ser. A 13, 541\u2013559 (2005)","journal-title":"Math. Program. Ser. A"},{"key":"1228_CR8","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/s10589-019-00107-8","volume":"74","author":"Y-H Dai","year":"2019","unstructured":"Dai, Y.-H., Huang, Y., Liu, X.: A family of spectral gradient methods for optimization. Comput. Optim. Appl. 74, 43\u201365 (2019)","journal-title":"Comput. Optim. Appl."},{"key":"1228_CR9","first-page":"1","volume":"38","author":"T-A Davis","year":"2011","unstructured":"Davis, T.-A., Hu, Y.: The University of Florida sparse matrix collection. ACM Trans. Math. Softw. 38, 1\u201325 (2011)","journal-title":"ACM Trans. Math. Softw."},{"issue":"4","key":"1228_CR10","doi-asserted-by":"publisher","first-page":"1416","DOI":"10.1093\/imanum\/drs056","volume":"33","author":"R De Asmundis","year":"2013","unstructured":"De Asmundis, R., Di Serafino, D., Riccio, F., Toraldo, G: On spectral properties of steepest descent methods. IMA J. Numer. Anal. 33(4), 1416\u20131435 (2013)","journal-title":"IMA J. Numer. Anal."},{"key":"1228_CR11","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1007\/s10589-014-9669-5","volume":"59","author":"R De Asmundis","year":"2014","unstructured":"De Asmundis, R., Di Serafino, D., Hager, W., Toraldo, G., Zhang, H: An efficient gradient method using the Yuan steplength. Comput. Optim. Appl. 59, 541\u2013563 (2014)","journal-title":"Comput. Optim. Appl."},{"key":"1228_CR12","first-page":"176","volume":"318","author":"D Di Serafino","year":"2018","unstructured":"Di Serafino, D., Ruggiero, V., Toraldo, G., Zanni, L: On the steplength selection in gradient methods for unconstrained optimization. Appl. Math. Comput. 318, 176\u2013195 (2018)","journal-title":"Appl. Math. Comput."},{"key":"1228_CR13","doi-asserted-by":"crossref","unstructured":"Fletcher, R.: On the Barzilai-Borwein method. In: Qi, L., Teo, K., Yang, X. (eds.) Optimization and Control with Applications, vol. 96, pp 235\u2013256. Series in Applied Optimization, Kluwer (2005)","DOI":"10.1007\/0-387-24255-4_10"},{"key":"1228_CR14","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1007\/s10107-011-0479-6","volume":"135","author":"R Fletcher","year":"2012","unstructured":"Fletcher, R: A limited memory steepest descent method. Math. Program. Ser. A 135, 513\u2013436 (2012)","journal-title":"Math. Program. Ser. A"},{"issue":"2","key":"1228_CR15","doi-asserted-by":"publisher","first-page":"299","DOI":"10.3934\/jimo.2008.4.299","volume":"4","author":"G Frassoldati","year":"2008","unstructured":"Frassoldati, G., Zanni, L., Zanghirati, G.: New adaptive stepsize selections in gradient methods. J. Ind. Manag. Optim. 4(2), 299\u2013312 (2008)","journal-title":"J. Ind. Manag. Optim."},{"issue":"1","key":"1228_CR16","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1137\/S003614299427315X","volume":"36","author":"A Friedlander","year":"1999","unstructured":"Friedlander, A., Mart\u00ednez, J.M., Molina, B., Raydan, M.: Gradient method with retards and generalizations. SIAM J. Numer. Anal. 36(1), 275\u2013289 (1999)","journal-title":"SIAM J. Numer. Anal."},{"issue":"2","key":"1228_CR17","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1007\/s10589-015-9775-z","volume":"63","author":"C Gonzaga","year":"2016","unstructured":"Gonzaga, C., Schneider, R.M.: On the steepest descent algorithm for quadratic functions. Comput. Optim. Appl. 63(2), 523\u2013542 (2016)","journal-title":"Comput. Optim. Appl."},{"key":"1228_CR18","doi-asserted-by":"publisher","first-page":"409","DOI":"10.6028\/jres.049.044","volume":"49","author":"MR Hestenes","year":"1952","unstructured":"Hestenes, M.R., Stiefel, E.: Method of conjugate gradient for solving linear system. J. Res. Nat. Bur. Stand. 49, 409\u2013436 (1952)","journal-title":"J. Res. Nat. Bur. Stand."},{"issue":"4","key":"1228_CR19","doi-asserted-by":"publisher","first-page":"681","DOI":"10.1080\/10556788.2020.1727476","volume":"35","author":"Y Huang","year":"2020","unstructured":"Huang, Y., Dai, Y.-H., Liu, X.-W., Zhang, H: Gradient methods exploiting spectral properties. Optim. Meth. Soft. 35(4), 681\u2013705 (2020)","journal-title":"Optim. Meth. Soft."},{"issue":"2","key":"1228_CR20","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1137\/S1052623494267127","volume":"7","author":"C Lemar\u00e9chal","year":"1997","unstructured":"Lemar\u00e9chal, C., Sagastiz\u00e1bal, C.: Practical aspects of the Moreau\u2013Yosida regularization: theoretical preliminaries. SIAM J. Optim. 7(2), 367\u2013385 (1997)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"1228_CR21","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1080\/02331934.2017.1399392","volume":"67","author":"Z Liu","year":"2018","unstructured":"Liu, Z., Liu, H., Dong, X.: An efficient gradient method with approximate optimal stepsize for the strictly convex quadratic minimization problem. Optimization 67(3), 427\u2013440 (2018)","journal-title":"Optimization"},{"key":"1228_CR22","volume-title":"Introduction to Linear and Nonlinear Programming","author":"D Luenberger","year":"1984","unstructured":"Luenberger, D.: Introduction to Linear and Nonlinear Programming, 2nd ed. Addison Wesley, Amsterdam (1984)","edition":"2nd ed."},{"key":"1228_CR23","first-page":"1069","volume":"256","author":"J-J Moreau","year":"1963","unstructured":"Moreau, J. -J.: Propri\u00e9t\u00e9s des applications \u201cprox\u201d. C. R. Acad. Sci. Paris 256, 1069\u20131071 (1963)","journal-title":"C. R. Acad. Sci. Paris"},{"key":"1228_CR24","first-page":"5","volume":"22","author":"J-J Moreau","year":"1965","unstructured":"Moreau, J.-J.: Proximit\u00e9 et dualit\u00e9 dans un espace Hilbertien. Bull. Soc. Math. France 22, 5\u201335 (1965)","journal-title":"Bull. Soc. Math. France"},{"key":"1228_CR25","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/A:1014897230089","volume":"22","author":"J Nocedal","year":"2002","unstructured":"Nocedal, J., Sartenaer, A., Zhu, C: On the behavior of the gradient norm in the steepest descent method. Comput. Optim. Appl. 22, 5\u201335 (2002)","journal-title":"Comput. Optim. Appl."},{"key":"1228_CR26","volume-title":"Numerical Optimization","author":"J Nocedal","year":"2006","unstructured":"Nocedal, J., Wright, S.: Numerical Optimization, 2nd ed. Springer, New York (2006)","edition":"2nd ed."},{"key":"1228_CR27","doi-asserted-by":"publisher","first-page":"729","DOI":"10.1007\/s10589-019-00125-6","volume":"74","author":"HF Oviedo-Leon","year":"2019","unstructured":"Oviedo-Leon, H.F.: A delayed weighted gradient method for strictly convex quadratic minimization. Comput. Optim. Appl. 74, 729\u2013746 (2019)","journal-title":"Comput. Optim. Appl."},{"key":"1228_CR28","doi-asserted-by":"publisher","unstructured":"Oviedo, H., Dalmau, O., Herrera, R.: A hybrid gradient method for strictly convex quadratic programming, to appear in Numerical Linear Algebra with Applications, 28(4), https:\/\/doi.org\/10.1002\/nla.2360https:\/\/doi.org\/10.1002\/ https:\/\/doi.org\/10.1002\/nla.2360nla.2360 (2020)","DOI":"10.1002\/nla.2360 10.1002\/nla.2360"},{"key":"1228_CR29","doi-asserted-by":"crossref","unstructured":"Planiden, C., Wang, X.: Proximal Mappings and Moreau Envelopes of Single-Variable Convex Piecewise Cubic Functions and Multivariable Gauge Functions. In: Hosseini, S., Mordukhovich, B., Uschmajew, A. (eds.) Nonsmooth Optimization and Its Applications, International Series of Numerical Mathematics, vol. 170, pp 89\u2013130. Springer Nature, Birkh\u00e4user (2019)","DOI":"10.1007\/978-3-030-11370-4_5"},{"key":"1228_CR30","doi-asserted-by":"publisher","first-page":"626","DOI":"10.1137\/0720042","volume":"20","author":"T Steihaug","year":"1983","unstructured":"Steihaug, T: The conjugate gradient method and trust regions in large scale optimization. SIAM J. Numer. Anal. 20, 626\u2013637 (1983)","journal-title":"SIAM J. Numer. Anal."},{"key":"1228_CR31","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1007\/s10589-017-9912-y","volume":"67","author":"L Stella","year":"2017","unstructured":"Stella, L., Themelis, A., Patrinos, P: Forward\u2013backward quasi-Newton methods for nonsmooth optimization problems. Comput. Optim. Appl. 67, 443\u2013487 (2017)","journal-title":"Comput. Optim. Appl."},{"key":"1228_CR32","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719574","volume-title":"Numerical Linear Algebra","author":"LN Trefethen","year":"1997","unstructured":"Trefethen, L.N., Bau, D.: Numerical Linear Algebra. SIAM, Philadelphia (1997)"},{"key":"1228_CR33","first-page":"149","volume":"24","author":"Y Yuan","year":"2006","unstructured":"Yuan, Y.: A new stepsize for the steepest descent method. J. Comput. Math. 24, 149\u2013156 (2006)","journal-title":"J. Comput. Math."},{"key":"1228_CR34","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/s10589-006-6446-0","volume":"35","author":"B Zhou","year":"2006","unstructured":"Zhou, B., Gao, L., Dai, Y.-H.: Gradient methods with adaptive step-sizes. Comput. Optim. Appl. 35, 69\u201386 (2006)","journal-title":"Comput. Optim. Appl."}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-021-01228-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11075-021-01228-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-021-01228-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,8]],"date-time":"2022-06-08T07:33:22Z","timestamp":1654673602000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11075-021-01228-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,11,25]]},"references-count":34,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,7]]}},"alternative-id":["1228"],"URL":"https:\/\/doi.org\/10.1007\/s11075-021-01228-0","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"value":"1017-1398","type":"print"},{"value":"1572-9265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,11,25]]},"assertion":[{"value":"25 February 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 October 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 November 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"<!--Emphasis Type='Bold' removed-->Conflict of interest"}}]}}