{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,24]],"date-time":"2026-07-24T05:03:52Z","timestamp":1784869432756,"version":"3.55.0"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2026,6,16]],"date-time":"2026-06-16T00:00:00Z","timestamp":1781568000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2026,6,16]],"date-time":"2026-06-16T00:00:00Z","timestamp":1781568000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100004434","name":"Universit\u00e0 degli Studi di Firenze","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100004434","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Optim Theory Appl"],"published-print":{"date-parts":[[2026,7]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>In this work, we deal with unconstrained nonlinear optimization problems. Specifically, we are interested in methods carrying out updates possibly along directions not of descent, like Polyak\u2019s heavy-ball algorithm. Instead of enforcing convergence properties through line searches and modifications of search direction when suitable safeguards are not satisfied, we propose a strategy based on searches along curve paths: a curve search starting from the first tentative update allows to smoothly revert towards a gradient-related direction if a sufficient decrease condition is not met. The resulting algorithm provably possesses global convergence guarantees, even with a nonmonotone decrease condition. While the presented framework is rather general, particularly of interest is the case of parabolic searches; in this case, under reasonable assumptions, the resulting algorithm can be shown to possess optimal worst case complexity bounds for reaching approximate stationarity in nonconvex settings. Practically, we show that the proposed globalization strategy allows to consistently accept (optimal) pure heavy-ball steps in the strongly convex case, while standard globalization approaches would at times reject them before even evaluating the objective function. Preliminary computational experiments also suggest that the proposed framework might be more convenient than classical safeguard-based approaches.<\/jats:p>","DOI":"10.1007\/s10957-026-03035-w","type":"journal-article","created":{"date-parts":[[2026,6,16]],"date-time":"2026-06-16T06:52:20Z","timestamp":1781592740000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Efficient Globalization of Heavy-Ball Type Methods for Unconstrained Optimization Based on Curve Searches"],"prefix":"10.1007","volume":"210","author":[{"ORCID":"https:\/\/orcid.org\/0009-0004-0377-2046","authenticated-orcid":false,"given":"Federica","family":"Donnini","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Matteo","family":"Lapucci","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Pierluigi","family":"Mansueto","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,6,16]]},"reference":[{"issue":"5","key":"3035_CR1","doi-asserted-by":"publisher","first-page":"669","DOI":"10.1080\/02331939008843594","volume":"21","author":"A Ben-Tal","year":"1990","unstructured":"Ben-Tal, A., Melman, A., Zowe, J.: Curved search methods for unconstrained optimization. Optimization 21(5), 669\u2013695 (1990)","journal-title":"Optimization"},{"key":"3035_CR2","volume-title":"Nonlinear Programming","author":"DP Bertsekas","year":"1999","unstructured":"Bertsekas, D.P.: Nonlinear Programming, 2nd edn. Athena Scientific, Belmont, MA (1999)","edition":"2"},{"issue":"1","key":"3035_CR3","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/0022-247X(78)90114-2","volume":"63","author":"CA Botsaris","year":"1978","unstructured":"Botsaris, C.A.: Differential gradient methods. J. Math. Anal. Appl. 63(1), 177\u2013198 (1978)","journal-title":"J. Math. Anal. Appl."},{"key":"3035_CR4","volume-title":"Evaluation Complexity of Algorithms for Nonconvex Optimization: Theory","author":"C Cartis","year":"2022","unstructured":"Cartis, C., Gould, N.I., Toint, P.L.: Evaluation Complexity of Algorithms for Nonconvex Optimization: Theory. SIAM, Computation and Perspectives (2022)"},{"key":"3035_CR5","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)","journal-title":"Math. Program."},{"key":"3035_CR6","unstructured":"Fan, C., Vaswani, S., Thrampoulidis, C., Schmidt, M.: MSL: An Adaptive Momentum-based Stochastic Line-search Framework. In: OPT 2023: Optimization for Machine Learning, (2023)"},{"key":"3035_CR7","doi-asserted-by":"crossref","unstructured":"Farin, G., Hansford, D.: The essentials of CAGD, AK Peters\/CRC Press (2000)","DOI":"10.1201\/9781439864111"},{"key":"3035_CR8","doi-asserted-by":"crossref","unstructured":"Ghadimi, E., Feyzmahdavian, H.R., Johansson, M.: Global convergence of the Heavy-Ball method for convex optimization. In: European Control Conference (ECC), pp. 310\u2013315. IEEE (2015)","DOI":"10.1109\/ECC.2015.7330562"},{"issue":"1","key":"3035_CR9","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/BF01588294","volume":"18","author":"D Goldfarb","year":"1980","unstructured":"Goldfarb, D.: Curvilinear path steplength algorithms for minimization which use directions of negative curvature. Math. Program. 18(1), 31\u201340 (1980)","journal-title":"Math. Program."},{"issue":"1\u20132","key":"3035_CR10","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1080\/10556780008805794","volume":"14","author":"NI Gould","year":"2000","unstructured":"Gould, N.I., Lucidi, S., Roma, M., Toint, P.L.: Exploiting negative curvature directions in linesearch methods for unconstrained optimization. Optimization Methods and Software 14(1\u20132), 75\u201398 (2000)","journal-title":"Optimization Methods and Software"},{"key":"3035_CR11","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1007\/s10589-014-9687-3","volume":"60","author":"NI Gould","year":"2015","unstructured":"Gould, N.I., Orban, D., Toint, P.L.: CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization. Comput. Optim. Appl. 60, 545\u2013557 (2015)","journal-title":"Comput. Optim. Appl."},{"issue":"4","key":"3035_CR12","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(4), 707\u2013716 (1986)","journal-title":"SIAM J. Numer. Anal."},{"key":"3035_CR13","doi-asserted-by":"crossref","unstructured":"Grippo, L., Sciandrone, M.: Introduction to methods for nonlinear optimization, vol. 152, Springer Nature (2023)","DOI":"10.1007\/978-3-031-26790-1"},{"key":"3035_CR14","unstructured":"Kassing, S., Weissmann, S.: Polyak\u2019s Heavy Ball Method Achieves Accelerated Local Rate of Convergence under Polyak-Lojasiewicz Inequality (2026). https:\/\/arxiv.org\/abs\/2410.16849"},{"issue":"2","key":"3035_CR15","doi-asserted-by":"publisher","first-page":"795","DOI":"10.1007\/s10589-025-00741-5","volume":"93","author":"M Lapucci","year":"2026","unstructured":"Lapucci, M., Liuzzi, G., Lucidi, S., Pucci, D., Sciandrone, M.: A globally convergent gradient method with momentum. Comput. Optim. Appl. 93(2), 795\u2013820 (2026)","journal-title":"Comput. Optim. Appl."},{"key":"3035_CR16","doi-asserted-by":"crossref","unstructured":"Lee, C.P., Wang, P.W., Chen, W., Lin, C.J.: Limited-memory Common-directions Method for Distributed Optimization and its Application on Empirical Risk Minimization. In: Proceedings of the 2017 SIAM International Conference on Data Mining (SDM), pp. 732\u2013740. , SIAM (2017)","DOI":"10.1137\/1.9781611974973.82"},{"issue":"1","key":"3035_CR17","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1137\/15M1009597","volume":"26","author":"L Lessard","year":"2016","unstructured":"Lessard, L., Recht, B., Packard, A.: Analysis and design of optimization algorithms via integral quadratic constraints. SIAM J. Optim. 26(1), 57\u201395 (2016)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"3035_CR18","doi-asserted-by":"publisher","first-page":"820","DOI":"10.1007\/s10957-023-02325-x","volume":"200","author":"Z Liu","year":"2024","unstructured":"Liu, Z., Ni, Y., Liu, H., Sun, W.: A New Subspace Minimization Conjugate Gradient Method for Unconstrained Minimization. J. Optim. Theory Appl. 200(2), 820\u2013851 (2024)","journal-title":"J. Optim. Theory Appl."},{"issue":"5","key":"3035_CR19","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":"3035_CR20","volume-title":"Introduction to Optimization","author":"BT Polyak","year":"1987","unstructured":"Polyak, B.T.: Introduction to Optimization. Optimization Software, New York (1987)"},{"issue":"1","key":"3035_CR21","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/BF01593790","volume":"12","author":"MJD Powell","year":"1977","unstructured":"Powell, M.J.D.: Restart procedures for the conjugate gradient method. Math. Program. 12(1), 241\u2013254 (1977)","journal-title":"Math. Program."},{"issue":"9","key":"3035_CR22","doi-asserted-by":"publisher","first-page":"3245","DOI":"10.1007\/s10994-022-06215-7","volume":"111","author":"S Saab","year":"2022","unstructured":"Saab, S., Phoha, S., Zhu, M., Ray, A.: An adaptive Polyak Heavy-Ball method. Mach. Learn. 111(9), 3245\u20133277 (2022)","journal-title":"Mach. Learn."},{"issue":"3","key":"3035_CR23","first-page":"753","volume":"161","author":"ZJ Shi","year":"2005","unstructured":"Shi, Z.J., Shen, J.: A new descent algorithm with curve search rule. Appl. Math. Comput. 161(3), 753\u2013768 (2005)","journal-title":"Appl. Math. Comput."},{"issue":"3","key":"3035_CR24","doi-asserted-by":"publisher","first-page":"A2025","DOI":"10.1137\/23M1567229","volume":"46","author":"T Tang","year":"2024","unstructured":"Tang, T., Toh, K.C., Xiao, N., Ye, Y.: A Riemannian Dimension-Reduced Second-Order Method with Application in Sensor Network Localization. SIAM J. Sci. Comput. 46(3), A2025\u2013A2046 (2024)","journal-title":"SIAM J. Sci. Comput."},{"issue":"07","key":"3035_CR25","doi-asserted-by":"publisher","first-page":"721","DOI":"10.4236\/am.2016.77066","volume":"7","author":"Z Xu","year":"2016","unstructured":"Xu, Z., Tang, Y., Shi, Z.J.: Global Convergence of Curve Search Methods for Unconstrained Optimization. Appl. Math. 7(07), 721 (2016)","journal-title":"Appl. Math."},{"key":"3035_CR26","unstructured":"Zhang, C., Ge, D., He, C., Jiang, B., Jiang, Y., Ye, Y.: DRSOM: A Dimension Reduced Second-Order Method (2023). https:\/\/arxiv.org\/abs\/2208.00208"}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-026-03035-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10957-026-03035-w","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-026-03035-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,24]],"date-time":"2026-07-24T04:51:19Z","timestamp":1784868679000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10957-026-03035-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6,16]]},"references-count":26,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,7]]}},"alternative-id":["3035"],"URL":"https:\/\/doi.org\/10.1007\/s10957-026-03035-w","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"value":"0022-3239","type":"print"},{"value":"1573-2878","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,6,16]]},"assertion":[{"value":"23 May 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 May 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 June 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors declare that they have no conflict of interest.","order":1,"name":"Ethics","label":"Conflicts of Interest","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The implementation code of the approach presented in the paper can be found at\n                      \n                      .","order":2,"name":"Ethics","label":"Code availability","group":{"name":"EthicsHeading","label":"Declarations"}}],"article-number":"5"}}