{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,17]],"date-time":"2026-04-17T15:29:43Z","timestamp":1776439783489,"version":"3.51.2"},"reference-count":52,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,5,31]],"date-time":"2024-05-31T00:00:00Z","timestamp":1717113600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,5,31]],"date-time":"2024-05-31T00:00:00Z","timestamp":1717113600000},"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":["Comput Optim Appl"],"published-print":{"date-parts":[[2024,9]]},"DOI":"10.1007\/s10589-024-00586-4","type":"journal-article","created":{"date-parts":[[2024,5,31]],"date-time":"2024-05-31T11:02:24Z","timestamp":1717153344000},"page":"151-182","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Delayed Weighted Gradient Method with simultaneous step-sizes for strongly convex optimization"],"prefix":"10.1007","volume":"89","author":[{"given":"Hugo","family":"Lara","sequence":"first","affiliation":[]},{"given":"Rafael","family":"Aleixo","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9139-0881","authenticated-orcid":false,"given":"Harry","family":"Oviedo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,5,31]]},"reference":[{"issue":"2","key":"586_CR1","doi-asserted-by":"publisher","first-page":"862","DOI":"10.1006\/jcph.1999.6224","volume":"151","author":"EG Birgin","year":"1999","unstructured":"Birgin, E.G., Chambouleyron, I., Mart\u0131nez, J.M.: Estimation of the optical constants and the thickness of thin films using unconstrained optimization. J. Comput. Phys. 151(2), 862\u2013880 (1999). https:\/\/doi.org\/10.1006\/jcph.1999.6224","journal-title":"J. Comput. Phys."},{"issue":"2\u20133","key":"586_CR2","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). https:\/\/doi.org\/10.1080\/10556780512331318182","journal-title":"Optim. Methods Softw."},{"issue":"4","key":"586_CR3","doi-asserted-by":"publisher","first-page":"586","DOI":"10.1109\/JSTSP.2007.910281","volume":"1","author":"MA Figueiredo","year":"2007","unstructured":"Figueiredo, M.A., Nowak, R.D., Wright, S.J.: Gradient projection for sparse reconstruction: application to compressed sensing and other inverse problems. IEEE J. Sel. Top. Signal Process. 1(4), 586\u2013597 (2007). https:\/\/doi.org\/10.1109\/JSTSP.2007.910281","journal-title":"IEEE J. Sel. Top. Signal Process."},{"key":"586_CR4","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1007\/s10851-015-0591-y","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, 106\u2013116 (2016). https:\/\/doi.org\/10.1007\/s10851-015-0591-y","journal-title":"J. Math. Imaging Vis."},{"key":"586_CR5","volume-title":"Linear and Nonlinear Programming","author":"DG Luenberger","year":"1984","unstructured":"Luenberger, D.G., Ye, Y.: Linear and Nonlinear Programming, vol. 2. Addison-wesley, Reading, MA (1984)"},{"key":"586_CR6","doi-asserted-by":"publisher","first-page":"536","DOI":"10.1017\/CBO9780511702396.063","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. Comp. Rend. Sci. Paris 25, 536\u2013538 (1847). https:\/\/doi.org\/10.1017\/CBO9780511702396.063","journal-title":"Comp. Rend. Sci. Paris"},{"key":"586_CR7","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). https:\/\/doi.org\/10.1016\/j.amc.2017.07.037","journal-title":"Appl. Math. Comput."},{"key":"586_CR8","unstructured":"Gould, N.: Section C: continuous optimisation, Lecture 3: steepest descent, gradient search and Newton\u2019s method. https:\/\/www.numerical.rl.ac.uk\/people\/nimg\/course\/lectures\/raphael\/lectures\/lecture3.pdf. Accessed 04 Oct 2023 (2006)"},{"key":"586_CR9","unstructured":"Nemirovsky, A., Yudin, D.: Informational complexity and efficient methods for solution of convex extremal problems. \u00c9konomika i Mathematicheskie Metody 12 (1983)"},{"issue":"4","key":"586_CR10","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). https:\/\/doi.org\/10.1016\/0041-5553(84)90234-9","journal-title":"USSR Comput. Math. Math. Phys."},{"issue":"1","key":"586_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). https:\/\/doi.org\/10.1093\/imanum\/8.1.141","journal-title":"IMA J. Numer. Anal."},{"key":"586_CR12","first-page":"165","volume":"26","author":"R Fletcher","year":"1990","unstructured":"Fletcher, R.: Low storage methods for uncosntrained optimization. Lect. Appl. Math. (AMS) 26, 165\u2013179 (1990)","journal-title":"Lect. Appl. Math. (AMS)"},{"key":"586_CR13","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, 321\u2013326 (1993). https:\/\/doi.org\/10.1093\/imanum\/13.3.321","journal-title":"IMA J. Numer. Anal."},{"issue":"1","key":"586_CR14","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":"586_CR15","doi-asserted-by":"publisher","DOI":"10.1007\/s40305-023-00468-2","author":"XR Li","year":"2023","unstructured":"Li, X.R., Huang, Y.K.: A note on R-linear convergence of nonmonotone gradient methods. J. Oper. Res. Soc. China (2023). https:\/\/doi.org\/10.1007\/s40305-023-00468-2","journal-title":"J. Oper. Res. Soc. China"},{"key":"586_CR16","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 the large scale unconstrained minimization problem. SIAM J. Optim. 7, 26\u201333 (1997). https:\/\/doi.org\/10.1137\/S1052623494266365","journal-title":"SIAM J. Optim."},{"key":"586_CR17","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). https:\/\/doi.org\/10.1137\/0723046","journal-title":"SIAM J. Numer. Anal."},{"issue":"1","key":"586_CR18","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1137\/S003614299427315X","volume":"36","author":"A Friedlander","year":"1998","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 (1998). https:\/\/doi.org\/10.1137\/S003614299427315X","journal-title":"SIAM J. Numer. Anal."},{"issue":"4\u20135","key":"586_CR19","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1080\/02331930310001611547","volume":"52","author":"YH Dai","year":"2003","unstructured":"Dai, Y.H.: Alternate step gradient method. Optimization 52(4\u20135), 395\u2013415 (2003). https:\/\/doi.org\/10.1080\/02331930310001611547","journal-title":"Optimization"},{"issue":"3","key":"586_CR20","doi-asserted-by":"publisher","first-page":"604","DOI":"10.1093\/imanum\/drl006","volume":"26","author":"YH Dai","year":"2006","unstructured":"Dai, Y.H., Fletcher, R.: The cyclic Barzilai\u2013Borwein method for unconstrained optimization. IMA J. Numer. Anal. 26(3), 604\u2013627 (2006). https:\/\/doi.org\/10.1093\/imanum\/drl006","journal-title":"IMA J. Numer. Anal."},{"key":"586_CR21","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\u2013Barzilai\u2013Borwein method. Comput. Optim. Appl. 21, 155\u2013167 (2002). https:\/\/doi.org\/10.1023\/A:1013708715892","journal-title":"Comput. Optim. Appl."},{"key":"586_CR22","doi-asserted-by":"publisher","DOI":"10.1007\/s11587-021-00646-5","author":"H Oviedo","year":"2021","unstructured":"Oviedo, H.: A cyclic delayed weighted steplength for the gradient method. Ric. Mat. (2021). https:\/\/doi.org\/10.1007\/s11587-021-00646-5","journal-title":"Ric. Mat."},{"key":"586_CR23","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). https:\/\/doi.org\/10.1007\/s10589-006-6446-0","journal-title":"Comput. Optim. Appl."},{"issue":"2","key":"586_CR24","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). https:\/\/doi.org\/10.3934\/jimo.2008.4.299","journal-title":"J. Ind. Manag. Optim."},{"issue":"3","key":"586_CR25","doi-asserted-by":"publisher","first-page":"375","DOI":"10.4208\/jcm.2001-m2018-0205","volume":"39","author":"H Oviedo","year":"2021","unstructured":"Oviedo, H., Dalmau, O., Herrera, R.: Two novel gradient methods with optimal step sizes. J. Comput. Math. 39(3), 375\u2013391 (2021). https:\/\/doi.org\/10.4208\/jcm.2001-m2018-0205","journal-title":"J. Comput. Math."},{"issue":"2","key":"586_CR26","first-page":"149","volume":"24","author":"YX Yuan","year":"2006","unstructured":"Yuan, Y.X.: A new stepsize for the steepest descent method. J. Comput. Math. 24(2), 149\u2013156 (2006)","journal-title":"J. Comput. Math."},{"issue":"4","key":"586_CR27","doi-asserted-by":"publisher","first-page":"3068","DOI":"10.1137\/21M139078","volume":"31","author":"YK Huang","year":"2021","unstructured":"Huang, Y.K., Dai, Y.H., Liu, X.W.: Equipping the Barzilai\u2013Borwein method with the two dimensional quadratic termination property. SIAM J. Optim. 31(4), 3068\u20133096 (2021). https:\/\/doi.org\/10.1137\/21M139078","journal-title":"SIAM J. Optim."},{"key":"586_CR28","unstructured":"Huang Y., Dai Y. H., Liu, X. W.: Achieving three dimensional quadratic termination for gradient methods. arXiv:2212.07255 (2022)"},{"issue":"2","key":"586_CR29","doi-asserted-by":"publisher","first-page":"181","DOI":"10.3934\/jimo.2005.1.181","volume":"1","author":"YH Dai","year":"2005","unstructured":"Dai, Y.H., Yuan, Y.X.: Analyses of monotone gradient methods. J. Ind. Manag. Optim. 1(2), 181\u2013192 (2005). https:\/\/doi.org\/10.3934\/jimo.2005.1.181","journal-title":"J. Ind. Manag. Optim."},{"key":"586_CR30","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, 541\u2013563 (2014). https:\/\/doi.org\/10.1007\/s10589-014-9669-5","journal-title":"Comput. Optim. Appl."},{"issue":"4","key":"586_CR31","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. Methods Softw. 35(4), 681\u2013705 (2020). https:\/\/doi.org\/10.1080\/10556788.2020.1727476","journal-title":"Optim. Methods Softw."},{"issue":"3","key":"586_CR32","doi-asserted-by":"publisher","first-page":"717","DOI":"10.1007\/s10589-022-00349-z","volume":"81","author":"Y Huang","year":"2022","unstructured":"Huang, Y., Dai, Y.H., Liu, X.W., Zhang, H.: On the acceleration of the Barzilai\u2013Borwein method. Comput. Optim. Appl. 81(3), 717\u2013740 (2022). https:\/\/doi.org\/10.1007\/s10589-022-00349-z","journal-title":"Comput. Optim. Appl."},{"key":"586_CR33","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\u2013Borwein method. J. Comput. Math. 37, 916\u2013936 (2019). https:\/\/doi.org\/10.4208\/jcm.1911-m2019-0171","journal-title":"J. Comput. Math."},{"key":"586_CR34","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. 135, 413\u2013436 (2012). https:\/\/doi.org\/10.1007\/s10107-011-0479-6","journal-title":"Math. Program."},{"key":"586_CR35","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/s10589-019-00107-8","volume":"74","author":"YH Dai","year":"2019","unstructured":"Dai, Y.H., Huang, Y., Liu, X.W.: A family of spectral gradient methods for optimization. Comput. Optim. Appl. 74, 43\u201365 (2019). https:\/\/doi.org\/10.1007\/s10589-019-00107-8","journal-title":"Comput. Optim. Appl."},{"issue":"1","key":"586_CR36","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). https:\/\/doi.org\/10.1007\/s10589-023-00455-6","journal-title":"Comput. Optim. Appl."},{"issue":"3","key":"586_CR37","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(3), 729\u2013746 (2019). https:\/\/doi.org\/10.1007\/s10589-019-00125-6","journal-title":"Comput. Optim. Appl."},{"issue":"1","key":"586_CR38","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(1), 167\u2013180 (2021). https:\/\/doi.org\/10.1007\/s10589-020-00232-9","journal-title":"Comput. Optim. Appl."},{"issue":"6","key":"586_CR39","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.: Methods of conjugate gradients for solving linear systems. J. Res. Natl. Bureau Stand. 49(6), 409\u2013436 (1952). https:\/\/doi.org\/10.6028\/JRES.049.044","journal-title":"J. Res. Natl. Bureau Stand."},{"key":"586_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, 1225\u20131252 (2022). https:\/\/doi.org\/10.1007\/s11075-021-01228-0","journal-title":"Numer. Algorithms"},{"issue":"4","key":"586_CR41","doi-asserted-by":"publisher","DOI":"10.1002\/nla.2360","volume":"28","author":"H Oviedo","year":"2021","unstructured":"Oviedo, H., Dalmau, O., Herrera, R.: A hybrid gradient method for strictly convex quadratic programming. Numer. Linear Algebra Appl. 28(4), e2360 (2021). https:\/\/doi.org\/10.1002\/nla.2360","journal-title":"Numer. Linear Algebra Appl."},{"key":"586_CR42","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). https:\/\/doi.org\/10.1016\/j.cam.2022.114525","journal-title":"J. Comput. Appl. Math."},{"issue":"1","key":"586_CR43","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1145\/1132973.1132979","volume":"32","author":"WW Hager","year":"2006","unstructured":"Hager, W.W., Zhang, H.: Algorithm 851: CG_DESCENT, a conjugate gradient method with guaranteed descent. ACM Trans. Math. Softw. (TOMS) 32(1), 113\u2013137 (2006). https:\/\/doi.org\/10.1145\/1132973.1132979","journal-title":"ACM Trans. Math. Softw. (TOMS)"},{"issue":"1","key":"586_CR44","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1137\/030601880","volume":"16","author":"WW Hager","year":"2005","unstructured":"Hager, W.W., Zhang, H.: A new conjugate gradient method with guaranteed descent and an efficient line search. SIAM J. Optim. 16(1), 170\u2013192 (2005). https:\/\/doi.org\/10.1137\/030601880","journal-title":"SIAM J. Optim."},{"key":"586_CR45","doi-asserted-by":"publisher","DOI":"10.5540\/03.2022.009.01.0288","author":"HL Urdaneta","year":"2022","unstructured":"Urdaneta, H.L., Aleixo, R.: On the delayed weighted gradient method with simultaneous step-size search. Proc. Ser. Braz. Soc. Comput. Appl. Math. (2022). https:\/\/doi.org\/10.5540\/03.2022.009.01.0288","journal-title":"Proc. Ser. Braz. Soc. Comput. Appl. Math."},{"key":"586_CR46","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441","volume-title":"Convex Optimization","author":"SP Boyd","year":"2004","unstructured":"Boyd, S.P., Vandenberghe, L.: Convex Optimization. Cambridge University Press, Cambridge (2004). https:\/\/doi.org\/10.1017\/CBO9780511804441"},{"key":"586_CR47","unstructured":"Shalev-Shwartz, S., Singer, Y.: Logarithmic Regret Algorithms for Strongly Convex Repeated Games. The Hebrew University (2007)"},{"issue":"1","key":"586_CR48","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2049662.2049663","volume":"38","author":"TA Davis","year":"2011","unstructured":"Davis, T.A., Hu, Y.: The University of Florida sparse matrix collection. ACM Trans. Math. Softw. (TOMS) 38(1), 1\u201325 (2011). https:\/\/doi.org\/10.1145\/2049662.2049663","journal-title":"ACM Trans. Math. Softw. (TOMS)"},{"issue":"35","key":"586_CR49","doi-asserted-by":"publisher","first-page":"1244","DOI":"10.21105\/joss.01244","volume":"4","author":"SP Kolodziej","year":"2019","unstructured":"Kolodziej, S.P., Aznaveh, M., Bullock, M., David, J., Davis, T.A., Henderson, M., Sandstrom, R.: The suitesparse matrix collection website interface. J. Open Source Softw. 4(35), 1244 (2019). https:\/\/doi.org\/10.21105\/joss.01244","journal-title":"J. Open Source Softw."},{"key":"586_CR50","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. 91, 201\u2013213 (2002). https:\/\/doi.org\/10.1007\/s101070100263","journal-title":"Math. Program."},{"issue":"1","key":"586_CR51","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."},{"issue":"2","key":"586_CR52","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1504\/IJMMNO.2013.055204","volume":"4","author":"M Jamil","year":"2013","unstructured":"Jamil, M., Yang, X.S.: A literature survey of benchmark functions for global optimisation problems. Int. J. Math. Model. Numer. Optim. 4(2), 150\u2013194 (2013). https:\/\/doi.org\/10.1504\/IJMMNO.2013.055204","journal-title":"Int. J. Math. Model. Numer. Optim."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-024-00586-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-024-00586-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-024-00586-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,5]],"date-time":"2024-08-05T08:13:01Z","timestamp":1722845581000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-024-00586-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,5,31]]},"references-count":52,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,9]]}},"alternative-id":["586"],"URL":"https:\/\/doi.org\/10.1007\/s10589-024-00586-4","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,5,31]]},"assertion":[{"value":"14 March 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 May 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 May 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":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval"}},{"value":"Not applicable.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent to participate"}},{"value":"Not applicable.","order":5,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}}]}}