{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T12:03:49Z","timestamp":1759838629796,"version":"3.37.3"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2019,8,28]],"date-time":"2019-08-28T00:00:00Z","timestamp":1566950400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,8,28]],"date-time":"2019-08-28T00:00:00Z","timestamp":1566950400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2019,12]]},"DOI":"10.1007\/s10589-019-00125-6","type":"journal-article","created":{"date-parts":[[2019,8,28]],"date-time":"2019-08-28T13:11:27Z","timestamp":1566997887000},"page":"729-746","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["A delayed weighted gradient method for strictly convex quadratic minimization"],"prefix":"10.1007","volume":"74","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9139-0881","authenticated-orcid":false,"given":"Harry Fernando","family":"Oviedo Leon","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,8,28]]},"reference":[{"key":"125_CR1","unstructured":"Kincaid, D., Kincaid, D.R., Cheney, E.W.: Numerical analysis: mathematics of scientific computing, vol. 2. American Mathematical Society (2009)"},{"issue":"1847","key":"125_CR2","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(1847), 536\u2013538 (1847)","journal-title":"Comptes Rendus Sci. Paris"},{"volume-title":"Methods of Conjugate Gradients for Solving Linear Systems","year":"1952","key":"125_CR3","unstructured":"Hestenes, M.R., Stiefel, E. (eds.): Methods of Conjugate Gradients for Solving Linear Systems, vol. 49. NBS, Washington (1952)"},{"issue":"1","key":"125_CR4","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(1), 141\u2013148 (1988)","journal-title":"IMA J. Numer. Anal."},{"issue":"2","key":"125_CR5","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(2), 149\u2013156 (2006)","journal-title":"J. Comput. Math."},{"issue":"3","key":"125_CR6","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1093\/imanum\/23.3.377","volume":"23","author":"Y-H Dai","year":"2003","unstructured":"Dai, Y.-H., Yuan, Y.-X.: Alternate minimization gradient method. IMA J. Numer. Anal. 23(3), 377\u2013393 (2003)","journal-title":"IMA J. Numer. Anal."},{"issue":"4\u20135","key":"125_CR7","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1080\/02331930310001611547","volume":"52","author":"Y-H Dai","year":"2003","unstructured":"Dai, Y.-H.: Alternate step gradient method. Optimization 52(4\u20135), 395\u2013415 (2003)","journal-title":"Optimization"},{"issue":"4","key":"125_CR8","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1016\/0041-5553(84)90234-9","volume":"24","author":"YE Nesterov","year":"1984","unstructured":"Nesterov, Y.E.: One class of methods of unconditional minimization of a convex function, having a high rate of convergence. USSR Comput. Math. Math. Phys. 24(4), 80\u201382 (1984)","journal-title":"USSR Comput. Math. Math. Phys."},{"issue":"3","key":"125_CR9","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1093\/imanum\/13.3.321","volume":"13","author":"M Raydan","year":"1993","unstructured":"Raydan, M.: On the Barzilai and Borwein choice of steplength for the gradient method. IMA J. Numer. Anal. 13(3), 321\u2013326 (1993)","journal-title":"IMA J. Numer. Anal."},{"issue":"1","key":"125_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1093\/imanum\/22.1.1","volume":"22","author":"Y-H 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)","journal-title":"IMA J. Numer. Anal."},{"key":"125_CR11","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."},{"issue":"3","key":"125_CR12","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1007\/s10107-004-0516-9","volume":"103","author":"Y-H Dai","year":"2005","unstructured":"Dai, Y.-H., Fletcher, R.: On the asymptotic behaviour of some new gradient methods. Math. Program. 103(3), 541\u2013559 (2005)","journal-title":"Math. Program."},{"issue":"1","key":"125_CR13","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(1), 69\u201386 (2006)","journal-title":"Comput. Optim. Appl."},{"issue":"2","key":"125_CR14","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., et al.: New adaptive stepsize selections in gradient methods. J. Ind. Manag. Optim. 4(2), 299\u2013312 (2008)","journal-title":"J. Ind. Manag. Optim."},{"issue":"4","key":"125_CR15","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":"125_CR16","volume-title":"Linear and Nonlinear Programming","author":"DG Luenberger","year":"1984","unstructured":"Luenberger, D.G., Ye, Y., et al.: Linear and Nonlinear Programming, vol. 2. Springer, New York (1984)"},{"issue":"3","key":"125_CR17","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.W., Toraldo, G., Zhang, H.: An efficient gradient method using the Yuan steplength. Comput. Optim. Appl. 59(3), 541\u2013563 (2014)","journal-title":"Comput. Optim. Appl."},{"issue":"3","key":"125_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.18637\/jss.v060.i03","volume":"60","author":"EG Birgin","year":"2014","unstructured":"Birgin, E.G., Mart\u00ednez, J.M., Raydan, M., et al.: Spectral projected gradient methods: review and perspectives. J. Stat. Softw. 60(3), 1\u201321 (2014)","journal-title":"J. Stat. Softw."},{"issue":"1","key":"125_CR19","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":"9\u201310","key":"125_CR20","doi-asserted-by":"publisher","first-page":"1161","DOI":"10.1016\/S0895-7177(02)00266-2","volume":"36","author":"J-L Lamotte","year":"2002","unstructured":"Lamotte, J.-L., Molina, B., Raydan, M.: Smooth and adaptive gradient method with retards. Math. Comput. Model. 36(9\u201310), 1161\u20131168 (2002)","journal-title":"Math. Comput. Model."},{"issue":"5","key":"125_CR21","first-page":"33","volume":"3","author":"C Brezinski","year":"1996","unstructured":"Brezinski, C.: Variations on richardson\u2019s method and acceleration. Bull. Belg. Math. Soc. Simon Stevin 3(5), 33\u201344 (1996)","journal-title":"Bull. Belg. Math. Soc. Simon Stevin"},{"issue":"1\u20133","key":"125_CR22","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/S0024-3795(99)00112-3","volume":"296","author":"C Brezinski","year":"1999","unstructured":"Brezinski, C.: Multiparameter descent methods. Linear Algebra Appl. 296(1\u20133), 113\u2013141 (1999)","journal-title":"Linear Algebra Appl."},{"issue":"1","key":"125_CR23","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), 1\u201319 (1994)","journal-title":"Numer. Math."},{"issue":"3","key":"125_CR24","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"},{"issue":"1","key":"125_CR25","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/s00211-004-0569-y","volume":"100","author":"Y-H Dai","year":"2005","unstructured":"Dai, Y.-H., Fletcher, R.: Projected Barzilai\u2013Borwein methods for large-scale box-constrained quadratic programming. Numer. Math. 100(1), 21\u201347 (2005)","journal-title":"Numer. Math."},{"issue":"3","key":"125_CR26","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(3), 626\u2013637 (1983)","journal-title":"SIAM J. Numer. Anal."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-019-00125-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-019-00125-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-019-00125-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,26]],"date-time":"2020-08-26T23:25:21Z","timestamp":1598484321000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-019-00125-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,8,28]]},"references-count":26,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2019,12]]}},"alternative-id":["125"],"URL":"https:\/\/doi.org\/10.1007\/s10589-019-00125-6","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"type":"print","value":"0926-6003"},{"type":"electronic","value":"1573-2894"}],"subject":[],"published":{"date-parts":[[2019,8,28]]},"assertion":[{"value":"24 September 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 August 2019","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}