{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,24]],"date-time":"2026-07-24T15:05:11Z","timestamp":1784905511909,"version":"3.55.0"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2026,7,3]],"date-time":"2026-07-03T00:00:00Z","timestamp":1783036800000},"content-version":"vor","delay-in-days":2,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"Universit\u00e0 degli Studi di Roma La Sapienza"}],"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>We focus on the optimization problem with smooth, possibly nonconvex objectives and a convex constraint set for which the Euclidean projection operation is practically available. Focusing on this setting, we carry out a general convergence and complexity analysis for algorithmic frameworks. Consequently, we discuss theoretically sound strategies to integrate momentum information within classical projected gradient-type algorithms. One of these approaches is then developed in detail, up to the definition of a tailored algorithm with both theoretical guarantees and reasonable per-iteration cost. The proposed method is finally shown to outperform the standard (spectral) projected gradient method in two different experimental benchmarks, indicating that the addition of momentum terms is as beneficial in the constrained setting as it is in the unconstrained scenario.<\/jats:p>","DOI":"10.1007\/s10957-026-03054-7","type":"journal-article","created":{"date-parts":[[2026,7,3]],"date-time":"2026-07-03T04:52:39Z","timestamp":1783054359000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Projected Gradient Methods with Momentum"],"prefix":"10.1007","volume":"210","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2488-5486","authenticated-orcid":false,"given":"Matteo","family":"Lapucci","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4063-8370","authenticated-orcid":false,"given":"Giampaolo","family":"Liuzzi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4356-7958","authenticated-orcid":false,"given":"Stefano","family":"Lucidi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5234-3174","authenticated-orcid":false,"given":"Marco","family":"Sciandrone","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-9720-8855","authenticated-orcid":false,"given":"Diego","family":"Scuppa","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,7,3]]},"reference":[{"issue":"2","key":"3054_CR1","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1093\/imanum\/drh020","volume":"25","author":"R Andreani","year":"2005","unstructured":"Andreani, R., Birgin, E.G., Mart\u00ednez, J.M., Yuan, J.: Spectral projected gradient and variable metric methods for optimization with linear inequalities. IMA J. Numer. Anal. 25(2), 221\u2013252 (2005)","journal-title":"IMA J. Numer. Anal."},{"issue":"1","key":"3054_CR2","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/s11075-009-9289-9","volume":"53","author":"M Andretta","year":"2010","unstructured":"Andretta, M., Birgin, E.G., Mart\u00ednez, J.M.: Partial spectral projected gradient method with active-set strategy for linearly constrained optimization. Numerical Algorithms 53(1), 23\u201352 (2010)","journal-title":"Numerical Algorithms"},{"key":"3054_CR3","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, 141\u2013148 (1988). https:\/\/doi.org\/10.1093\/imanum\/8.1.141","journal-title":"IMA J. Numer. Anal."},{"key":"3054_CR4","unstructured":"Bertsekas, D.P.: Nonlinear Programming. Athena Scientific (1999)"},{"key":"3054_CR5","doi-asserted-by":"crossref","unstructured":"Birgin, E.G., Mario Mart\u00ednez, J.: Large-scale active-set box-constrained optimization method with spectral projected gradients. Comput. Optim. Appl. 23(1), 101\u2013125 (2002)","DOI":"10.1023\/A:1019928808826"},{"issue":"4","key":"3054_CR6","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(4), 1196\u20131211 (2000). https:\/\/doi.org\/10.1137\/S1052623497330963","journal-title":"SIAM J. Optim."},{"issue":"3","key":"3054_CR7","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1145\/502800.502803","volume":"27","author":"EG Birgin","year":"2001","unstructured":"Birgin, E.G., Mart\u00ednez, J.M., Raydan, M.: Algorithm 813: Spg-software for convex-constrained optimization. ACM Trans. Math. Softw. 27(3), 340\u2013349 (2001). https:\/\/doi.org\/10.1145\/502800.502803","journal-title":"ACM Trans. Math. Softw."},{"issue":"4","key":"3054_CR8","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":"3054_CR9","doi-asserted-by":"crossref","unstructured":"Bonettini, S., Prato, M.: New convergence results for the scaled gradient projection method. Inverse Problems 31(9), 095,008 (2015)","DOI":"10.1088\/0266-5611\/31\/9\/095008"},{"key":"3054_CR10","doi-asserted-by":"crossref","unstructured":"Bonettini, S., Zanella, R., Zanni, L.: A scaled gradient projection method for constrained image deblurring. Inverse Problems 25(1), 015,002 (2008)","DOI":"10.1088\/0266-5611\/25\/1\/015002"},{"issue":"2","key":"3054_CR11","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1137\/16M1080173","volume":"60","author":"L Bottou","year":"2018","unstructured":"Bottou, L., Curtis, F.E., Nocedal, J.: Optimization methods for large-scale machine learning. SIAM Rev. 60(2), 223\u2013311 (2018)","journal-title":"SIAM Rev."},{"key":"3054_CR12","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)"},{"issue":"1","key":"3054_CR13","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1007\/s10107-015-0946-6","volume":"158","author":"L Condat","year":"2016","unstructured":"Condat, L.: Fast projection onto the simplex and the l1 ball. Math. Program. 158(1), 575\u2013585 (2016)","journal-title":"Math. Program."},{"issue":"2","key":"3054_CR14","doi-asserted-by":"publisher","first-page":"693","DOI":"10.1007\/s10589-022-00407-6","volume":"83","author":"A Cristofari","year":"2022","unstructured":"Cristofari, A., De Santis, M., Lucidi, S., Rinaldi, F.: Minimization over the $$\\ell _1$$-ball using an active-set non-monotone projected gradient. Comput. Optim. Appl. 83(2), 693\u2013721 (2022)","journal-title":"Comput. Optim. Appl."},{"issue":"2","key":"3054_CR15","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(2), 201\u2013213 (2002)","journal-title":"Math. Program."},{"issue":"1","key":"3054_CR16","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/s10589-021-00331-1","volume":"81","author":"OP Ferreira","year":"2022","unstructured":"Ferreira, O.P., Lemes, M., Prudente, L.F.: On the inexact scaled gradient projection method. Comput. Optim. Appl. 81(1), 91\u2013125 (2022)","journal-title":"Comput. Optim. Appl."},{"issue":"10","key":"3054_CR17","doi-asserted-by":"publisher","first-page":"6707","DOI":"10.1109\/TIT.2018.2841379","volume":"64","author":"M Golbabaee","year":"2018","unstructured":"Golbabaee, M., Davies, M.E.: Inexact gradient projection and fast data driven compressed sensing. IEEE Trans. Inf. Theory 64(10), 6707\u20136721 (2018)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"3054_CR18","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1080\/02331934.2021.1887181","volume":"71","author":"DS Gon\u00e7alves","year":"2022","unstructured":"Gon\u00e7alves, D.S., Gon\u00e7alves, M.L., Menezes, T.C.: Inexact variable metric method for convex-constrained optimization problems. Optimization 71(1), 145\u2013163 (2022)","journal-title":"Optimization"},{"key":"3054_CR19","doi-asserted-by":"publisher","unstructured":"Gould, N., Orban, D., Toint, P.: CUTEst: a Constrained and Unconstrained Testing Environment with safe threads for mathematical optimization. Computational Optimization and Applications 60 (2014). https:\/\/doi.org\/10.1007\/s10589-014-9687-3","DOI":"10.1007\/s10589-014-9687-3"},{"issue":"4","key":"3054_CR20","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). https:\/\/doi.org\/10.1137\/0723046","journal-title":"SIAM J. Numer. Anal."},{"key":"3054_CR21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-26790-1","volume-title":"Introduction to methods for nonlinear optimization","author":"L Grippo","year":"2023","unstructured":"Grippo, L., Sciandrone, M.: Introduction to methods for nonlinear optimization. Unitext. Springer, Cham (2023)"},{"key":"3054_CR22","doi-asserted-by":"crossref","unstructured":"Hastie, T., Tibshirani, R., Friedman, J.: The Elements of Statistical Learning: Data Mining, Inference and Prediction, (2009). (2nd edn.)","DOI":"10.1007\/978-0-387-84858-7"},{"issue":"1","key":"3054_CR23","doi-asserted-by":"publisher","first-page":"1365","DOI":"10.1007\/s10107-022-01870-z","volume":"199","author":"X Jia","year":"2023","unstructured":"Jia, X., Kanzow, C., Mehlitz, P., Wachsmuth, G.: An augmented Lagrangian method for optimization problems with structured geometric constraints. Math. Program. 199(1), 1365\u20131415 (2023)","journal-title":"Math. Program."},{"key":"3054_CR24","doi-asserted-by":"crossref","unstructured":"Lapucci, M., Liuzzi, G., Lucidi, S., Pucci, D., Sciandrone, M.: A globally convergent gradient method with momentum. Comput. Optim. Appl. , 1\u201326 (2025)","DOI":"10.1007\/s10957-026-03054-7"},{"key":"3054_CR25","doi-asserted-by":"crossref","unstructured":"Lee, C.P., Wang, P.W., Lin, C.J.: Limited-memory common-directions method for large-scale optimization: convergence, parallelization, and distributed optimization. Math. Program. Comput. 14(3), 543\u2013591 (2022)","DOI":"10.1007\/s12532-022-00219-z"},{"key":"3054_CR26","unstructured":"Lee, S.I., Lee, H., Abbeel, P., Ng, A.Y.: Efficient L1 regularized logistic regression. In: AAAI, vol.\u00a06, pp. 401\u2013408 (2006)"},{"issue":"5","key":"3054_CR27","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0041-5553(66)90114-5","volume":"6","author":"ES Levitin","year":"1966","unstructured":"Levitin, E.S., Polyak, B.T.: Constrained minimization methods. USSR Comput. Math. Math. Phys. 6(5), 1\u201350 (1966)","journal-title":"USSR Comput. Math. Math. Phys."},{"key":"3054_CR28","doi-asserted-by":"crossref","unstructured":"Liu, J., Chen, J., Ye, J.: Large-scale sparse logistic regression. In: Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining, pp. 547\u2013556. (2009)","DOI":"10.1145\/1557019.1557082"},{"key":"3054_CR29","doi-asserted-by":"crossref","unstructured":"Polyak, B.: Some methods of speeding up the convergence of iteration methods. USSR Comput. Math. Math. Phys. 4(5), 1\u201317 (1964) 10.1016\/0041-5553(64)90137-5. https:\/\/www.sciencedirect.com\/science\/article\/pii\/0041555364901375","DOI":"10.1016\/0041-5553(64)90137-5"},{"issue":"1","key":"3054_CR30","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(1), 26\u201333 (1997). https:\/\/doi.org\/10.1137\/S1052623494266365","journal-title":"SIAM J. Optim."},{"issue":"3","key":"3054_CR31","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). https:\/\/doi.org\/10.1137\/23M1567229","journal-title":"SIAM J. Sci. Comput."},{"issue":"3","key":"3054_CR32","doi-asserted-by":"publisher","first-page":"1107","DOI":"10.1109\/TNNLS.2020.3040325","volume":"33","author":"W Tao","year":"2022","unstructured":"Tao, W., Wu, G.W., Tao, Q.: Momentum acceleration in the individual convergence of nonsmooth convex optimization with constraints. IEEE Transactions on Neural Networks and Learning Systems 33(3), 1107\u20131118 (2022)","journal-title":"IEEE Transactions on Neural Networks and Learning Systems"},{"key":"3054_CR33","doi-asserted-by":"crossref","unstructured":"Wright, S.J., Recht, B.: Optimization for Data Analysis, Cambridge University Press (2022)","DOI":"10.1017\/9781009004282"}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-026-03054-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10957-026-03054-7","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-026-03054-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,24]],"date-time":"2026-07-24T04:51:12Z","timestamp":1784868672000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10957-026-03054-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7]]},"references-count":33,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,7]]}},"alternative-id":["3054"],"URL":"https:\/\/doi.org\/10.1007\/s10957-026-03054-7","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"value":"0022-3239","type":"print"},{"value":"1573-2878","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,7]]},"assertion":[{"value":"23 January 2026","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 June 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 July 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":1,"name":"Ethics","label":"Competing interests","group":{"name":"EthicsHeading","label":"Declarations"}}],"article-number":"20"}}