{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T07:08:56Z","timestamp":1780988936578,"version":"3.54.1"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2026,2,18]],"date-time":"2026-02-18T00:00:00Z","timestamp":1771372800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,2,18]],"date-time":"2026-02-18T00:00:00Z","timestamp":1771372800000},"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":["J Optim Theory Appl"],"published-print":{"date-parts":[[2026,3]]},"DOI":"10.1007\/s10957-025-02927-7","type":"journal-article","created":{"date-parts":[[2026,2,18]],"date-time":"2026-02-18T10:49:01Z","timestamp":1771411741000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Universal Subgradient and Proximal Bundle Methods for Convex and Strongly Convex Hybrid Composite Optimization"],"prefix":"10.1007","volume":"208","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8862-3696","authenticated-orcid":false,"given":"Vincent","family":"Guigues","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jiaming","family":"Liang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Renato D. C.","family":"Monteiro","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,2,18]]},"reference":[{"key":"2927_CR1","doi-asserted-by":"crossref","unstructured":"Alamo, T., Krupa, P., Limon, D.: Gradient based restart FISTA. In 2019 IEEE 58th Conference on Decision and Control (CDC), pp. 3936\u20133941. IEEE (2019)","DOI":"10.1109\/CDC40024.2019.9029983"},{"issue":"1","key":"2927_CR2","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1109\/TAC.2022.3146054","volume":"68","author":"T Alamo","year":"2022","unstructured":"Alamo, T., Krupa, P., Limon, D.: Restart of accelerated first-order methods with linear convergence under a quadratic functional growth condition. IEEE Trans. Autom. Control 68(1), 612\u2013619 (2022)","journal-title":"IEEE Trans. Autom. Control"},{"key":"2927_CR3","doi-asserted-by":"crossref","unstructured":"Alamo, T., Limon, D., Krupa, P.: Restart FISTA with global linear convergence. In 2019 18th European Control Conference (ECC), pp. 1969\u20131974. IEEE (2019)","DOI":"10.23919\/ECC.2019.8795831"},{"issue":"4","key":"2927_CR4","doi-asserted-by":"publisher","first-page":"3259","DOI":"10.1137\/23M158961X","volume":"34","author":"J-F Aujol","year":"2024","unstructured":"Aujol, J.-F., Calatroni, L., Dossal, C., Labarri\u00e8re, H., Rondepierre, A.: Parameter-free FISTA by adaptive restart and backtracking. SIAM J. Optim. 34(4), 3259\u20133285 (2024)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"2927_CR5","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1007\/s10107-023-01960-6","volume":"204","author":"J-F Aujol","year":"2024","unstructured":"Aujol, J.-F., Dossal, C., Rondepierre, A.: FISTA is an automatic geometrically optimized algorithm for strongly convex functions. Math. Program. 204(1), 449\u2013491 (2024)","journal-title":"Math. Program."},{"issue":"2","key":"2927_CR6","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/s10957-025-02688-3","volume":"206","author":"J-F Aujol","year":"2025","unstructured":"Aujol, J.-F., Dossal, C.H., Labarri\u00e8re, H., Rondepierre, A.: FISTA restart using an automatic estimation of the growth parameter. J. Optim. Theory Appl. 206(2), 51 (2025)","journal-title":"J. Optim. Theory Appl."},{"issue":"3","key":"2927_CR7","doi-asserted-by":"publisher","first-page":"908","DOI":"10.1007\/s10957-017-1108-1","volume":"173","author":"Y Du","year":"2017","unstructured":"Du, Y., Ruszczy\u0144ski, A.: Rate of convergence of the bundle method. J. Optim. Theory Appl. 173(3), 908\u2013922 (2017)","journal-title":"J. Optim. Theory Appl."},{"issue":"4","key":"2927_CR8","doi-asserted-by":"publisher","first-page":"2069","DOI":"10.1093\/imanum\/drz007","volume":"39","author":"O Fercoq","year":"2019","unstructured":"Fercoq, O., Qu, Z.: Adaptive restart of accelerated gradient methods under local quadratic growth condition. IMA J. Numer. Anal. 39(4), 2069\u20132095 (2019)","journal-title":"IMA J. Numer. Anal."},{"issue":"2","key":"2927_CR9","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/s11590-023-02060-2","volume":"18","author":"B Grimmer","year":"2024","unstructured":"Grimmer, B.: On optimal universal first-order methods for minimizing heterogeneous sums. Optim. Lett. 18(2), 427\u2013445 (2024)","journal-title":"Optim. Lett."},{"key":"2927_CR10","unstructured":"Iouditski, A., Nesterov, Y.: Primal-dual subgradient methods for minimizing uniformly convex functions. arXiv (2014)"},{"issue":"1","key":"2927_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10107-013-0737-x","volume":"149","author":"G Lan","year":"2015","unstructured":"Lan, G.: Bundle-level type methods uniformly optimal for smooth and nonsmooth convex optimization. Math. Program. 149(1), 1\u201345 (2015)","journal-title":"Math. Program."},{"issue":"1","key":"2927_CR12","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/s10107-012-0588-x","volume":"138","author":"G Lan","year":"2013","unstructured":"Lan, G., Monteiro, R.D.C.: Iteration-complexity of first-order penalty methods for convex programming. Math. Program. 138(1), 115\u2013139 (2013)","journal-title":"Math. Program."},{"key":"2927_CR13","unstructured":"Lan, G., Ouyang, Y., Zhang, Z.: Optimal and parameter-free gradient minimization methods for convex and nonconvex optimization. arXiv:2310.12139 (2023)"},{"key":"2927_CR14","doi-asserted-by":"crossref","unstructured":"Li, T., Lan, G.: A simple uniformly optimal method without line search for convex optimization. Math. Programm. 1\u201338 (2025)","DOI":"10.1007\/s10107-025-02250-z"},{"issue":"1","key":"2927_CR15","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/s10107-023-02035-2","volume":"208","author":"J Liang","year":"2024","unstructured":"Liang, J., Guigues, V., Monteiro, R.D.C.: A single cut proximal bundle method for stochastic convex composite optimization. Math. Program. 208(1), 173\u2013208 (2024)","journal-title":"Math. Program."},{"key":"2927_CR16","doi-asserted-by":"crossref","unstructured":"Liang, J., Monteiro, R.D.C.: A proximal bundle variant with optimal iteration-complexity for a large range of prox stepsizes. Extended version available on arXiv:2003.11457 (2020)","DOI":"10.1137\/20M1327513"},{"issue":"1","key":"2927_CR17","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1137\/19M1294277","volume":"31","author":"J Liang","year":"2021","unstructured":"Liang, J., Monteiro, R.D.C.: An average curvature accelerated composite gradient method for nonconvex smooth composite optimization problems. SIAM J. Optim. 31(1), 217\u2013243 (2021)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"2927_CR18","doi-asserted-by":"publisher","first-page":"2955","DOI":"10.1137\/20M1327513","volume":"31","author":"J Liang","year":"2021","unstructured":"Liang, J., Monteiro, R.D.C.: A proximal bundle variant with optimal iteration-complexity for a large range of prox stepsizes. SIAM J. Optim. 31(4), 2955\u20132986 (2021)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"2927_CR19","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/s10589-023-00490-3","volume":"86","author":"J Liang","year":"2023","unstructured":"Liang, J., Monteiro, R.D.C.: Average curvature fista for nonconvex smooth composite optimization problems. Comput. Optim. Appl. 86(1), 275\u2013302 (2023)","journal-title":"Comput. Optim. Appl."},{"issue":"2","key":"2927_CR20","doi-asserted-by":"publisher","first-page":"832","DOI":"10.1287\/moor.2023.1372","volume":"49","author":"J Liang","year":"2024","unstructured":"Liang, J., Monteiro, R.D.C.: A unified analysis of a class of proximal bundle methods for solving hybrid convex composite optimization problems. Math. Oper. Res. 49(2), 832\u2013855 (2024)","journal-title":"Math. Oper. Res."},{"key":"2927_CR21","unstructured":"Lin, Q., Xiao, L.: An adaptive accelerated proximal gradient method and its homotopy continuation for sparse optimization. In Eric\u00a0P. Xing and Tony Jebara, editors, Proceedings of the 31st International Conference on Machine Learning, volume\u00a032 of Proceedings of Machine Learning Research, pages 73\u201381, Bejing, China, 22\u201324 Jun (2014). PMLR"},{"key":"2927_CR22","unstructured":"Malitsky, Y., Mishchenko, K.: Adaptive gradient descent without descent. In Hal\u00a0Daum\u00e9 III and Aarti Singh, editors, Proceedings of the 37th International Conference on Machine Learning, volume 119 of Proceedings of Machine Learning Research, pages 6702\u20136712. PMLR, 13\u201318 Jul (2020)"},{"issue":"1","key":"2927_CR23","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1007\/s10957-023-02218-z","volume":"202","author":"JG Melo","year":"2024","unstructured":"Melo, J.G., Monteiro, R.D.C., Wang, H.: A proximal augmented lagrangian method for linearly constrained nonconvex composite optimization problems. J. Optim. Theory Appl. 202(1), 388\u2013420 (2024)","journal-title":"J. Optim. Theory Appl."},{"key":"2927_CR24","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/0041-5553(85)90100-4","volume":"2","author":"A Nemirovskii","year":"1985","unstructured":"Nemirovskii, A., Nesterov, Y.: Optimal methods of smooth convex minimization. Comput. Math. Math. Phys. 2, 21\u201330 (1985)","journal-title":"Comput. Math. Math. Phys."},{"issue":"1","key":"2927_CR25","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s10107-012-0629-5","volume":"140","author":"Y Nesterov","year":"2013","unstructured":"Nesterov, Y.: Gradient methods for minimizing composite functions. Math. Program. 140(1), 125\u2013161 (2013)","journal-title":"Math. Program."},{"issue":"1","key":"2927_CR26","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/s10107-014-0790-0","volume":"152","author":"Y Nesterov","year":"2015","unstructured":"Nesterov, Y.: Universal gradient methods for convex optimization problems. Math. Program. 152(1), 381\u2013404 (2015)","journal-title":"Math. Program."},{"key":"2927_CR27","doi-asserted-by":"crossref","unstructured":"Nesterov, Y.: Lectures on Convex Optimization, vol. 137. Springer (2018)","DOI":"10.1007\/978-3-319-91578-4_2"},{"key":"2927_CR28","doi-asserted-by":"publisher","first-page":"715","DOI":"10.1007\/s10208-013-9150-3","volume":"15","author":"B O\u2019donoghue","year":"2015","unstructured":"O\u2019donoghue, B., Candes, E.: Adaptive restart for accelerated gradient schemes. Found. Comput. Math. 15, 715\u2013732 (2015)","journal-title":"Found. Comput. Math."},{"issue":"1","key":"2927_CR29","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/s10208-021-09502-2","volume":"22","author":"J Renegar","year":"2022","unstructured":"Renegar, J., Grimmer, B.: A simple nearly optimal restart scheme for speeding up first-order methods. Found. Comput. Math. 22(1), 211\u2013256 (2022)","journal-title":"Found. Comput. Math."},{"issue":"1","key":"2927_CR30","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1137\/18M1224568","volume":"30","author":"V Roulet","year":"2020","unstructured":"Roulet, V., d\u2019Aspremont, A.: Sharpness, restart and acceleration. SIAM J. Optim. 30(1), 262\u2013289 (2020)","journal-title":"SIAM J. Optim."},{"key":"2927_CR31","doi-asserted-by":"crossref","unstructured":"Zhou, D., Ma, S., Yang, J.: AdaBB: Adaptive Barzilai-Borwein method for convex optimization. Math. Oper. Res. (2025)","DOI":"10.1287\/moor.2024.0510"}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-025-02927-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10957-025-02927-7","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-025-02927-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T06:48:14Z","timestamp":1780987694000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10957-025-02927-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,2,18]]},"references-count":31,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2026,3]]}},"alternative-id":["2927"],"URL":"https:\/\/doi.org\/10.1007\/s10957-025-02927-7","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"value":"0022-3239","type":"print"},{"value":"1573-2878","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,2,18]]},"assertion":[{"value":"25 June 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 December 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 February 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"112"}}