{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T12:03:08Z","timestamp":1780315388573,"version":"3.54.1"},"reference-count":54,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2026,4,17]],"date-time":"2026-04-17T00:00:00Z","timestamp":1776384000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2026,4,17]],"date-time":"2026-04-17T00:00:00Z","timestamp":1776384000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100009448","name":"Universit\u00e0 degli Studi della Campania Luigi Vanvitelli","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100009448","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2026,6]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>In this paper, we propose a new acceleration strategy for gradient-based methods applied to strictly convex Quadratic Programming (QP) problems. The strategy consists in performing, at selected iterations, minimization steps along alternative descent directions or even within low-dimensional affine subspaces. In particular, considering the contribution of the linear and quadratic part of the objective function could be useful in designing line searches in acceleration steps. We present numerical experiments to assess the impact of acceleration steps on the performance of different gradient methods. We examined randomly generated QP and box constrained QP test problems, designed to assess the algorithms under various conditions, such as matrix dimensions, condition numbers, and initialization strategies. Our experiments show that the use of acceleration steps in some Barzilai\u2013Borwein methods significantly improves computational results. Moving to general minimization problems, the extension of our approach is not straightforward; in particular, it is not possible to directly extend the two-dimensional minimization phase. In this work, we take a first step in this direction by providing preliminary ideas for a possible extension of the accelerated algorithm to the minimization of general functions.<\/jats:p>","DOI":"10.1007\/s10589-026-00778-0","type":"journal-article","created":{"date-parts":[[2026,4,17]],"date-time":"2026-04-17T03:51:50Z","timestamp":1776397910000},"page":"509-541","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A speed up strategy for gradient methods"],"prefix":"10.1007","volume":"94","author":[{"ORCID":"https:\/\/orcid.org\/0009-0004-1633-2365","authenticated-orcid":false,"given":"Anna","family":"De Magistris","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Serena","family":"Crisci","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Valentina","family":"De Simone","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gerardo","family":"Toraldo","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,4,17]]},"reference":[{"issue":"1","key":"778_CR1","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/s00211-004-0569-y","volume":"100","author":"YH Dai","year":"2005","unstructured":"Dai, Y.H., Fletcher, R.: Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming. Numer. Math. 100(1), 21\u201347 (2005)","journal-title":"Numer. Math."},{"issue":"2","key":"778_CR2","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/j.acha.2009.02.003","volume":"27","author":"I Loris","year":"2009","unstructured":"Loris, I., Bertero, M., De Mol, C., Zanella, R., Zanni, L.: Accelerating gradient projection methods for $$\\ell _1$$-constrained signal recovery by steplength selection rules. Appl. Comput. Harmon. Anal. 27(2), 247\u2013254 (2009)","journal-title":"Appl. Comput. Harmon. Anal."},{"issue":"2\u20133","key":"778_CR3","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1080\/10556780512331318182","volume":"20","author":"T Serafini","year":"2005","unstructured":"Serafini, T., Zanghirati, G., Zanni, L.: Gradient projection methods for quadratic programs and applications in training support vector machines. Optim. Methods Softw. 20(2\u20133), 353\u2013378 (2005)","journal-title":"Optim. Methods Softw."},{"issue":"7","key":"778_CR4","doi-asserted-by":"publisher","first-page":"2479","DOI":"10.1109\/TSP.2009.2016892","volume":"57","author":"SJ Wright","year":"2009","unstructured":"Wright, S.J., Nowak, R.D., Figueiredo, M.A.T.: Sparse reconstruction by separable approximation. IEEE Trans. Signal Process. 57(7), 2479\u20132493 (2009)","journal-title":"IEEE Trans. Signal Process."},{"issue":"1","key":"778_CR5","doi-asserted-by":"publisher","first-page":"2523","DOI":"10.1038\/srep02523","volume":"3","author":"R Zanella","year":"2013","unstructured":"Zanella, R., Zanghirati, G., Cavicchioli, R., Zanni, L., Boccacci, P., Bertero, M., Vicidomini, G.: Towards real-time image deconvolution: application to confocal and STED microscopy. Sci. Rep. 3(1), 2523 (2013)","journal-title":"Sci. Rep."},{"issue":"3","key":"778_CR6","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1007\/s10589-008-9225-2","volume":"47","author":"M Zhu","year":"2010","unstructured":"Zhu, M., Wright, S.J., Chan, T.F.: Duality-based algorithms for total-variation-regularized image restoration. Comput. Optim. Appl. 47(3), 377\u2013400 (2010)","journal-title":"Comput. Optim. Appl."},{"issue":"1","key":"778_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01831719","volume":"11","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. Stat. Math. 11(1), 1\u201316 (1959). https:\/\/doi.org\/10.1007\/BF01831719","journal-title":"Ann. Inst. Stat. Math."},{"key":"778_CR8","doi-asserted-by":"publisher","first-page":"413","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, 413\u2013436 (2012)","journal-title":"Math. Program. Ser. A"},{"issue":"2","key":"778_CR9","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":"778_CR10","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":"1","key":"778_CR11","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."},{"key":"778_CR12","doi-asserted-by":"crossref","unstructured":"Fletcher, R.: On the Barzilai-Borwein method. In: Optimization and Control with Applications, pp. 235\u2013256. Springer, Boston (2005)","DOI":"10.1007\/0-387-24255-4_10"},{"issue":"1","key":"778_CR13","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/s10589-023-00455-6","volume":"85","author":"G Ferrandi","year":"2023","unstructured":"Ferrandi, G., Hochstenbach, M.E., Kreji\u0107, N.: A harmonic framework for stepsize selection in gradient methods. Comput. Optim. Appl. 85(1), 75\u2013106 (2023)","journal-title":"Comput. Optim. Appl."},{"issue":"1","key":"778_CR14","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."},{"key":"778_CR15","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1016\/j.amc.2017.07.037","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":"1","key":"778_CR16","doi-asserted-by":"publisher","DOI":"10.1088\/0266-5611\/25\/1\/015002","volume":"25","author":"S Bonettini","year":"2009","unstructured":"Bonettini, S., Zanella, R., Zanni, L.: A scaled gradient projection method for constrained image deblurring. Inverse Prob. 25(1), 015002 (2009)","journal-title":"Inverse Prob."},{"issue":"1","key":"778_CR17","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1007\/s10851-015-0588-3","volume":"54","author":"L Antonelli","year":"2016","unstructured":"Antonelli, L., De Simone, V., di Serafino, D.: On the application of the spectral projected gradient method in image segmentation. J. Math. Imaging Vis. 54(1), 106\u2013116 (2016). https:\/\/doi.org\/10.1007\/s10851-015-0588-3","journal-title":"J. Math. Imaging Vis."},{"key":"778_CR18","doi-asserted-by":"publisher","first-page":"1196","DOI":"10.1137\/S1052623497330963","volume":"10","author":"EG Birgin","year":"2000","unstructured":"Birgin, E.G., Mart\u00ednez, J.M., Raydan, M.: Nonmonotone spectral projected gradient methods on convex sets. SIAM J. Optim. 10, 1196\u20131211 (2000)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"778_CR19","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1093\/imanum\/23.4.539","volume":"23","author":"EG Birgin","year":"2003","unstructured":"Birgin, E.G., Mart\u00ednez, J.M., Raydan, M.: Inexact spectral projected gradient methods on convex sets. IMA J. Numer. Anal. 23(4), 539\u2013559 (2003)","journal-title":"IMA J. Numer. Anal."},{"key":"778_CR20","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.matcom.2017.10.003","volume":"145","author":"L Posp\u00ed\u0161il","year":"2018","unstructured":"Posp\u00ed\u0161il, L., Dost\u00e1l, Z.: The projected Barzilai-Borwein method with fall-back for strictly convex QCQP problems with separable constraints. Math. Comput. Simul. 145, 79\u201389 (2018)","journal-title":"Math. Comput. Simul."},{"key":"778_CR21","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1007\/s10589-015-9775-z","volume":"63","author":"CC Gonzaga","year":"2016","unstructured":"Gonzaga, C.C., Schneider, R.M.: On the steepest descent algorithm for quadratic functions. Comput. Optim. Appl. 63, 523\u2013542 (2016)","journal-title":"Comput. Optim. Appl."},{"issue":"1","key":"778_CR22","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(1), 5\u201335 (2002)","journal-title":"Comput. Optim. Appl."},{"issue":"3","key":"778_CR23","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1080\/10556788.2023.2285489","volume":"39","author":"S Crisci","year":"2024","unstructured":"Crisci, S., Rebegoldi, S., Toraldo, G., Viola, M.: Barzilai\u2013Borwein-like rules in proximal gradient schemes for $$\\ell _1$$-regularized problems. Optim. Methods Softw. 39(3), 601\u2013633 (2024)","journal-title":"Optim. Methods Softw."},{"key":"778_CR24","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1016\/j.amc.2019.03.039","volume":"356","author":"S Crisci","year":"2019","unstructured":"Crisci, S., Ruggiero, V., Zanni, L.: Steplength selection in gradient projection methods for box-constrained quadratic programs. Appl. Math. Comput. 356, 312\u2013327 (2019)","journal-title":"Appl. Math. Comput."},{"issue":"2","key":"778_CR25","doi-asserted-by":"publisher","first-page":"1300","DOI":"10.1137\/19M1268641","volume":"30","author":"S Crisci","year":"2020","unstructured":"Crisci, S., Porta, F., Ruggiero, V., Zanni, L.: Spectral properties of Barzilai-Borwein rules in solving singly linearly constrained optimization problems subject to lower and upper bounds. SIAM J. Optim. 30(2), 1300\u20131326 (2020)","journal-title":"SIAM J. Optim."},{"key":"778_CR26","unstructured":"Birman, M.S.: Nekotorye ocenki dlja metoda naiskorei\u0161ego spuska. Uspehi Matem. Nauk (N.S.) 5, 152\u2013155 (1950)"},{"key":"778_CR27","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/BF02165472","volume":"11","author":"GE Forsythe","year":"1968","unstructured":"Forsythe, G.E.: On the asymptotic directions of the s-dimensional optimum gradient method. Numer. Math. 11, 57\u201376 (1968)","journal-title":"Numer. Math."},{"key":"778_CR28","doi-asserted-by":"crossref","unstructured":"Pronzato, L., Wynn, H.P., Zhigljavsky, A.: In: Pronzato, L., Zhigljavsky, A. (eds.) A Dynamical-System Analysis of the Optimum s-Gradient Algorithm, pp. 39\u201380. Springer, New York (2009)","DOI":"10.1007\/978-0-387-79936-0_3"},{"key":"778_CR29","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/B978-0-12-597050-1.50006-3","volume-title":"Nonlinear Programming","author":"MJD Powell","year":"1970","unstructured":"Powell, M.J.D.: A new algorithm for unconstrained optimization. In: Rosen, J.B., Mangasarian, O.L., Ritter, K. (eds.) Nonlinear Programming, pp. 31\u201365. Academic Press, New York (1970)"},{"issue":"2","key":"778_CR30","first-page":"109","volume":"5","author":"M Bartholomew-Biggs","year":"2003","unstructured":"Bartholomew-Biggs, M.: A Newton method with a two-dimensional line search. Adv. Model. Optim. 5(2), 109\u2013127 (2003)","journal-title":"Adv. Model. Optim."},{"key":"778_CR31","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2020.125612","volume":"409","author":"D di Serafino","year":"2021","unstructured":"di Serafino, D., Toraldo, G., Viola, M.: Using gradient directions to get global convergence of Newton-type methods. Appl. Math. Comput. 409, 125612 (2021)","journal-title":"Appl. Math. Comput."},{"issue":"4","key":"778_CR32","doi-asserted-by":"publisher","first-page":"1326","DOI":"10.1137\/S1064827502410451","volume":"25","author":"J Bardsley","year":"2004","unstructured":"Bardsley, J., Vogel, C.: A nonnegatively constrained convex programming method for image reconstruction. SIAM J. Sci. Comput. 25(4), 1326\u20131343 (2004)","journal-title":"SIAM J. Sci. Comput."},{"issue":"1","key":"778_CR33","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1023\/A:1004641125471","volume":"104","author":"MC Bartholomew-Biggs","year":"2000","unstructured":"Bartholomew-Biggs, M.C., Forbes, A.B.: A two-dimensional search used with a non-linear least squares solver. J. Optim. Theory Appl. 104(1), 181\u2013198 (2000)","journal-title":"J. Optim. Theory Appl."},{"issue":"4","key":"778_CR34","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1007\/BF00932218","volume":"28","author":"JE Dennis","year":"1979","unstructured":"Dennis, J.E., Mei, H.H.W.: An unconstrained optimization algorithm which uses function and gradient values. J. Optim. Theory Appl. 28(4), 453\u2013482 (1979)","journal-title":"J. Optim. Theory Appl."},{"issue":"5","key":"778_CR35","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0041-5553(64)90137-5","volume":"4","author":"BT Polyak","year":"1964","unstructured":"Polyak, B.T.: Some methods of speeding up the convergence of iteration methods. USSR Comput. Math. Math. Phys. 4(5), 1\u201317 (1964)","journal-title":"USSR Comput. Math. Math. Phys."},{"key":"778_CR36","volume-title":"Nonlinear Programming","author":"DP Bertsekas","year":"1999","unstructured":"Bertsekas, D.P.: Nonlinear Programming. Athena Scientific, Belmont (1999)"},{"key":"778_CR37","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/0377-0427(89)90045-9","volume":"25","author":"AT Chronopoulos","year":"1989","unstructured":"Chronopoulos, A.T., Gear, C.W.: s-step iterative methods for symmetric linear systems. J. Comput. Appl. Math. 25, 153\u2013168 (1989)","journal-title":"J. Comput. Appl. Math."},{"issue":"1","key":"778_CR38","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/s10589-024-00586-4","volume":"89","author":"H Lara","year":"2024","unstructured":"Lara, H., Aleixo, R., Oviedo, H.: Delayed weighted gradient method with simultaneous step-sizes for strongly convex optimization. Comput. Optim. Appl. 89(1), 151\u2013182 (2024)","journal-title":"Comput. Optim. Appl."},{"key":"778_CR39","doi-asserted-by":"publisher","DOI":"10.1016\/j.cam.2022.114525","volume":"416","author":"R Andreani","year":"2022","unstructured":"Andreani, R., Oviedo, H., Raydan, M., Secchin, L.D.: An extended delayed weighted gradient algorithm for solving strongly convex optimization problems. J. Comput. Appl. Math. 416, 114525 (2022)","journal-title":"J. Comput. Appl. Math."},{"issue":"3","key":"778_CR40","doi-asserted-by":"publisher","first-page":"1225","DOI":"10.1007\/s11075-021-01228-0","volume":"90","author":"H Oviedo","year":"2022","unstructured":"Oviedo, H., Andreani, R., Raydan, M.: A family of optimal weighted conjugate-gradient-type methods for strictly convex quadratic minimization. Numer. Algorithms 90(3), 1225\u20131252 (2022)","journal-title":"Numer. Algorithms"},{"issue":"2","key":"778_CR41","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1023\/A:1013708715892","volume":"21","author":"M Raydan","year":"2002","unstructured":"Raydan, M., Svaiter, B.F.: Relaxed steepest descent and Cauchy-Barzilai-Borwein method. Comput. Optim. Appl. 21(2), 155\u2013167 (2002)","journal-title":"Comput. Optim. Appl."},{"key":"778_CR42","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/s10107-023-01979-9","volume":"205","author":"D di Serafino","year":"2024","unstructured":"di Serafino, D., Hager, W.W., Toraldo, G., Viola, M.: On the stationarity for nonlinear optimization problems with polyhedral constraints. Math. Program. 205, 107\u2013134 (2024)","journal-title":"Math. Program."},{"issue":"5","key":"778_CR43","doi-asserted-by":"publisher","first-page":"1483","DOI":"10.1137\/0730077","volume":"30","author":"PL De Angelis","year":"1993","unstructured":"De Angelis, P.L., Toraldo, G.: On the identification property of a projected gradient method. SIAM J. Numer. Anal. 30(5), 1483\u20131497 (1993)","journal-title":"SIAM J. Numer. Anal."},{"key":"778_CR44","doi-asserted-by":"publisher","first-page":"707","DOI":"10.1137\/0723046","volume":"23","author":"L Grippo","year":"1986","unstructured":"Grippo, L., Lampariello, F., Lucidi, S.: A nonmonotone line search technique for Newton\u2019s method. SIAM J. Numer. Anal. 23, 707\u2013716 (1986)","journal-title":"SIAM J. Numer. Anal."},{"issue":"1","key":"778_CR45","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1137\/0801008","volume":"1","author":"JJ Mor\u00e9","year":"1991","unstructured":"Mor\u00e9, J.J., Toraldo, G.: On the solution of large quadratic programming problems with bound constraints. SIAM J. Optim. 1(1), 93\u2013113 (1991)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"778_CR46","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/BF02592073","volume":"39","author":"PH Calamai","year":"1987","unstructured":"Calamai, P.H., Mor\u00e9, J.J.: Projected gradient methods for linearly constrained problems. Math. Program. 39(1), 93\u2013116 (1987)","journal-title":"Math. Program."},{"issue":"9","key":"778_CR47","doi-asserted-by":"publisher","DOI":"10.1088\/0266-5611\/31\/9\/095008","volume":"31","author":"S Bonettini","year":"2015","unstructured":"Bonettini, S., Prato, M.: New convergence results for the scaled gradient projection method. Inverse Prob. 31(9), 095008 (2015)","journal-title":"Inverse Prob."},{"key":"778_CR48","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"ED Dolan","year":"2002","unstructured":"Dolan, E.D., Mor\u00e9, J.J.: Benchmarking optimization software with performance profiles. Math. Program Ser. A 91, 201\u2013213 (2002)","journal-title":"Math. Program Ser. A"},{"issue":"2","key":"778_CR49","first-page":"15","volume":"43","author":"N Gould","year":"2016","unstructured":"Gould, N., Scott, J.: A note on performance profiles for benchmarking software. ACM Trans. Math. Softw. 43(2), 15 (2016)","journal-title":"ACM Trans. Math. Softw."},{"issue":"4","key":"778_CR50","doi-asserted-by":"publisher","first-page":"2809","DOI":"10.1137\/17M1128538","volume":"28","author":"D di Serafino","year":"2018","unstructured":"di Serafino, D., Toraldo, G., Viola, M., Barlow, J.: A two-phase gradient method for quadratic programming problems with a single linear constraint and bounds on the variables. SIAM J. Optim. 28(4), 2809\u20132838 (2018)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"778_CR51","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1137\/1011036","volume":"11","author":"P Wolfe","year":"1969","unstructured":"Wolfe, P.: Convergence conditions for ascent methods. SIAM Rev. 11(2), 226\u2013235 (1969)","journal-title":"SIAM Rev."},{"issue":"2","key":"778_CR52","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1023\/A:1013653923062","volume":"112","author":"YH Dai","year":"2002","unstructured":"Dai, Y.H.: On the nonmonotone line search. J. Optim. Theory Appl. 112(2), 315\u2013330 (2002)","journal-title":"J. Optim. Theory Appl."},{"issue":"4","key":"778_CR53","doi-asserted-by":"publisher","first-page":"1043","DOI":"10.1137\/S1052623403428208","volume":"14","author":"H Zhang","year":"2004","unstructured":"Zhang, H., Hager, W.W.: A nonmonotone line search technique and its application to unconstrained optimization. SIAM J. Optim. 14(4), 1043\u20131056 (2004)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"778_CR54","first-page":"147","volume":"10","author":"N Andrei","year":"2008","unstructured":"Andrei, N.: An unconstrained optimization test functions collection. Adv. Model. Optim. 10(1), 147\u2013161 (2008)","journal-title":"Adv. Model. Optim."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-026-00778-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-026-00778-0","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-026-00778-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T11:04:10Z","timestamp":1780311850000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-026-00778-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,4,17]]},"references-count":54,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2026,6]]}},"alternative-id":["778"],"URL":"https:\/\/doi.org\/10.1007\/s10589-026-00778-0","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,4,17]]},"assertion":[{"value":"17 June 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 February 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 April 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}