{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,24]],"date-time":"2025-06-24T04:01:37Z","timestamp":1750737697486,"version":"3.41.0"},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2025,6,9]],"date-time":"2025-06-09T00:00:00Z","timestamp":1749427200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,6,9]],"date-time":"2025-06-09T00:00:00Z","timestamp":1749427200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100000181","name":"Air Force Office of Scientific Research","doi-asserted-by":"publisher","award":["FA9550-22-1-0088"],"award-info":[{"award-number":["FA9550-22-1-0088"]}],"id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Optim Theory Appl"],"published-print":{"date-parts":[[2025,8]]},"DOI":"10.1007\/s10957-025-02713-5","type":"journal-article","created":{"date-parts":[[2025,6,9]],"date-time":"2025-06-09T20:17:09Z","timestamp":1749500229000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Efficient Parameter-Free Restarted Accelerated Gradient Methods for Convex and Strongly Convex Optimization"],"prefix":"10.1007","volume":"206","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3879-9332","authenticated-orcid":false,"given":"Arnesh","family":"Sujanani","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Renato D. C.","family":"Monteiro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,6,9]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Alamo, Teodoro., Krupa, Pablo., Limon, Daniel.|: Gradient based restart fista. In 2019 IEEE 58th Conference on Decision and Control (CDC), pages 3936\u20133941, 2019","key":"2713_CR1","DOI":"10.1109\/CDC40024.2019.9029983"},{"issue":"1","key":"2713_CR2","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1109\/TAC.2022.3146054","volume":"68","author":"Teodoro Alamo","year":"2023","unstructured":"Alamo, Teodoro, Krupa, Pablo, Limon, Daniel: Restart of accelerated first-order methods with linear convergence under a quadratic functional growth condition. IEEE Transactions on Automatic Control 68(1), 612\u2013619 (2023)","journal-title":"IEEE Transactions on Automatic Control"},{"doi-asserted-by":"crossref","unstructured":"Alamo, Teodoro., Limon, Daniel., Krupa, Pablo.: Restart fista with global linear convergence. In 2019 18th European Control Conference (ECC), pages 1969\u20131974, 2019","key":"2713_CR3","DOI":"10.23919\/ECC.2019.8795831"},{"unstructured":"Aujol, J., Dossal, C., Labarri\u00c3\u0161re, H., Rondepierre, A.: Fista restart using an automatic estimation of the growth parameter. hal-03153525v4, 2022","key":"2713_CR4"},{"issue":"4","key":"2713_CR5","doi-asserted-by":"publisher","first-page":"3259","DOI":"10.1137\/23M158961X","volume":"34","author":"Jean-Francois Aujol","year":"2024","unstructured":"Aujol, Jean-Francois., Calatroni, Luca, Dossal, Charles, Labarri\u00e8re, Hippolyte, Rondepierre, Aude: Parameter-free fista by adaptive restart and backtracking. SIAM Journal on Optimization 34(4), 3259\u20133285 (2024)","journal-title":"SIAM Journal on Optimization"},{"issue":"1","key":"2713_CR6","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1137\/080716542","volume":"2","author":"A Beck","year":"2009","unstructured":"Beck, A., Teboulle, M.: A fast iterative shrinkage-thresholding algorithm for linear inverse problems. SIAM J. Imaging Sci. 2(1), 183\u2013202 (2009)","journal-title":"SIAM J. Imaging Sci."},{"issue":"227","key":"2713_CR7","first-page":"357","volume":"39","author":"Joseph Berkson","year":"1944","unstructured":"Berkson, Joseph: Application of the logistic function to bio-assay. Journal of the American Statistical Association 39(227), 357\u2013365 (1944)","journal-title":"Journal of the American Statistical Association"},{"issue":"3","key":"2713_CR8","doi-asserted-by":"publisher","first-page":"1772","DOI":"10.1137\/17M1149390","volume":"29","author":"L Calatroni","year":"2019","unstructured":"Calatroni, L., Chambolle, A.: Backtracking strategies for accelerated descent methods with smooth composite objectives. SIAM J. Optim. 29(3), 1772\u20131798 (2019)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"2713_CR9","doi-asserted-by":"publisher","first-page":"1751","DOI":"10.1137\/17M1114296","volume":"28","author":"Y Carmon","year":"2018","unstructured":"Carmon, Y., Duchi, J.C., Hinder, O., Sidford, A.: Accelerated methods for nonconvex optimization. SIAM J. Optim. 28(2), 1751\u20131772 (2018)","journal-title":"SIAM J. Optim."},{"key":"2713_CR10","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1017\/S096249291600009X","volume":"25","author":"A Chambolle","year":"2016","unstructured":"Chambolle, A., Pock, T.: An introduction to continuous optimization for imaging. Acta Numerica 25, 161\u2013319 (2016)","journal-title":"Acta Numerica"},{"doi-asserted-by":"crossref","unstructured":"Davis, Timothy\u00a0A., Hu, Yifan.: The University of Florida sparse matrix collection. ACM Trans. Math. Softw., 38(1), December 2011","key":"2713_CR11","DOI":"10.1145\/2049662.2049663"},{"key":"2713_CR12","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 Journal of Numerical Analysis 39, 2069\u20132095 (2019)","journal-title":"IMA Journal of Numerical Analysis"},{"issue":"2","key":"2713_CR13","doi-asserted-by":"publisher","first-page":"444","DOI":"10.1109\/TSP.2018.2866409","volume":"67","author":"MI Florea","year":"2018","unstructured":"Florea, M.I., Vorobyov, S.A.: An accelerated composite gradient method for large-scale composite objective problems. IEEE Transactions on Signal Processing 67(2), 444\u2013459 (2018)","journal-title":"IEEE Transactions on Signal Processing"},{"issue":"4","key":"2713_CR14","doi-asserted-by":"publisher","first-page":"2182","DOI":"10.1137\/130943649","volume":"25","author":"Y He","year":"2015","unstructured":"He, Y., Monteiro, R.D.C.: Accelerating block-decomposition first-order methods for solving composite saddle-point and two-player Nash equilibrium problems. SIAM J. Optim. 25(4), 2182\u20132211 (2015)","journal-title":"SIAM J. Optim."},{"doi-asserted-by":"crossref","unstructured":"Kong, W.: Accelerated inexact first-order methods for solving nonconvex composite optimization problems. arXiv:2104.09685, April 2021","key":"2713_CR15","DOI":"10.1137\/20M1313222"},{"issue":"4","key":"2713_CR16","doi-asserted-by":"publisher","first-page":"2566","DOI":"10.1137\/18M1171011","volume":"29","author":"W Kong","year":"2019","unstructured":"Kong, W., Melo, J.G., Monteiro, R.D.C.: Complexity of a quadratic penalty accelerated inexact proximal point method for solving linearly constrained nonconvex composite programs. SIAM J. Optim. 29(4), 2566\u20132593 (2019)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"2713_CR17","doi-asserted-by":"publisher","first-page":"3005","DOI":"10.1137\/22M1498826","volume":"34","author":"Weiwei Kong","year":"2024","unstructured":"Kong, Weiwei: Complexity-optimal and parameter-free first-order methods for finding stationary points of composite optimization problems. SIAM Journal on Optimization 34(3), 3005\u20133032 (2024)","journal-title":"SIAM Journal on Optimization"},{"unstructured":"Lan, G., Monteiro, R.D.C.: Iteration-complexity of first-order penalty methods for convex programming. Technical Report. Optimization Online, 2008","key":"2713_CR18"},{"issue":"1","key":"2713_CR19","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."},{"unstructured":"Lan, G., Ouyang, Y., Zhang, Z.: Optimal and parameter-free gradient minimization methods for convex and nonconvex optimization. Available on arXiv:2310.12139, 2023","key":"2713_CR20"},{"doi-asserted-by":"crossref","unstructured":"Latafat, P., Themelis, A., Stella, L., Patrinos, P.: Adaptive proximal algorithms for convex optimization under local lipschitz continuity of the gradient. Available on arXiv:2301.04431, 2023","key":"2713_CR21","DOI":"10.1007\/s10107-024-02143-7"},{"unstructured":"Li, T., Lan, G.: A simple uniformly optimal method without line search for convex optimization. Available on arXiv:2310.10082, 2023","key":"2713_CR22"},{"unstructured":"Liang, J., Monteiro, R.D.C.; A Doubly Accelerated Inexact Proximal Point Method for Nonconvex Composite Optimization Problems. Available on arXiv:1811.11378v2, 2018","key":"2713_CR23"},{"key":"2713_CR24","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, 275\u2013302 (2023)","journal-title":"Comput. Optim. Appl."},{"doi-asserted-by":"crossref","unstructured":"Liang, Jiaming., Monteiro, Renato D.\u00a0C.: An average curvature accelerated composite gradient method for nonconvex smooth composite optimization problems. SIAM J. Optim. 31(1), 217\u2013243 (2021)","key":"2713_CR25","DOI":"10.1137\/19M1294277"},{"doi-asserted-by":"crossref","unstructured":"Liang, Jingwei, Luo, Tao, Schonlieb, Carola-Bibiane.: Improving \u201cfast iterative shrinkage-thresholding algorithm\u201d: Faster, smarter, and greedier. SIAM Journal on Scientific Computing 44(3), A1069\u2013A1091 (2022)","key":"2713_CR26","DOI":"10.1137\/21M1395685"},{"unstructured":"Lin, Hongzhou., Mairal, Julien., Harchaoui, Zaid.: A universal catalyst for first-order optimization. In C.\u00a0Cortes, N.\u00a0Lawrence, D.\u00a0Lee, M.\u00a0Sugiyama, and R.\u00a0Garnett, editors, Advances in Neural Information Processing Systems, volume\u00a028. Curran Associates, Inc., 2015","key":"2713_CR27"},{"key":"2713_CR28","doi-asserted-by":"publisher","first-page":"633","DOI":"10.1007\/s10589-014-9694-4","volume":"60","author":"Q Lin","year":"2015","unstructured":"Lin, Q., Xiao, L.: An adaptive accelerated proximal gradient method and its homotopy continuation for sparse optimization. Comput. Optim. Appl. 60, 633\u2013674 (2015)","journal-title":"Comput. Optim. Appl."},{"unstructured":"Malitsky, Y., Mishchenko, K.: Adaptive proximal gradient method for convex optimization. Available on arXiv:2308.02261, 2023","key":"2713_CR29"},{"key":"2713_CR30","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/s10589-015-9802-0","volume":"64","author":"RDC Monteiro","year":"2016","unstructured":"Monteiro, R.D.C., Ortiz, C., Svaiter, B.F.: An adaptive accelerated first-order method for convex optimization. Comput. Optim. Appl. 64, 31\u201373 (2016)","journal-title":"Comput. Optim. Appl."},{"unstructured":"Moursi, W., Pavlovic, V., Vavasis, S.: Accelerated gradient descent: A guaranteed bound for a heuristic restart strategy. Available on arXiv:2310.07674, 2023","key":"2713_CR31"},{"issue":"1","key":"2713_CR32","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/s10107-018-1232-1","volume":"175","author":"I Necoara","year":"2019","unstructured":"Necoara, I., Nesterov, Y., Gilneur, F.: Linear convergence of first order methods for non-strongly convex optimization. Mathematical programming 175(1), 69\u2013107 (2019)","journal-title":"Mathematical programming"},{"key":"2713_CR33","first-page":"10","volume":"88","author":"Y Nesterov","year":"2012","unstructured":"Nesterov, Y.: How to make the gradients small. OPTIMA, MPS Newsletter 88, 10\u201311 (2012)","journal-title":"OPTIMA, MPS Newsletter"},{"doi-asserted-by":"crossref","unstructured":"Nesterov, Y.\u00a0E.: Introductory Lectures on Convex Optimization: a Basic Course. Kluwer Academic Publ., 2004","key":"2713_CR34","DOI":"10.1007\/978-1-4419-8853-9"},{"doi-asserted-by":"crossref","unstructured":"Nesterov, Y.E.: Gradient methods for minimizing composite functions. Math. Program., pages 1\u201337, 2012","key":"2713_CR35","DOI":"10.1007\/s10107-012-0629-5"},{"key":"2713_CR36","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. Foundations of computational mathematics 15, 715\u2013732 (2015)","journal-title":"Foundations of computational mathematics"},{"unstructured":"Paquette, C., Lin, H., Drusvyatskiy, D., Mairal, J., Harchaoui, Z.: Catalyst for gradient-based nonconvex optimization. In AISTATS 2018-21st International Conference on Artificial Intelligence and Statistics, pages 1\u201310, 2018","key":"2713_CR37"},{"issue":"1","key":"2713_CR38","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. Foundations of computational mathematics 22(1), 211\u2013256 (2022)","journal-title":"Foundations of computational mathematics"},{"issue":"1","key":"2713_CR39","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1137\/18M1224568","volume":"30","author":"Vincent Roulet","year":"2020","unstructured":"Roulet, Vincent, d\u2019Aspremont, Alexandre: Sharpness, restart, and acceleration. SIAM Journal on Optimization 30(1), 262\u2013289 (2020)","journal-title":"SIAM Journal on Optimization"},{"key":"2713_CR40","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/s10208-014-9189-9","volume":"14","author":"K Scheinberg","year":"2014","unstructured":"Scheinberg, K., Goldfarb, D., Bai, X.: Fast first-order methods for composite convex optimization with backtracking. Foundations of computational mathematics 14, 389\u2013417 (2014)","journal-title":"Foundations of computational mathematics"},{"doi-asserted-by":"crossref","unstructured":"Sujanani, A., Monteiro, R.D.C.: An adaptive superfast inexact proximal augmented Lagrangian method for smooth nonconvex composite optimization problems. J. Sci. Comput. 97(2) (2023)","key":"2713_CR41","DOI":"10.1007\/s10915-023-02350-y"},{"doi-asserted-by":"crossref","unstructured":"Tibshirani, Robert: Regression shrinkage and selection via the lasso. J. R. Stat. Soc. Ser. B (Methodological) 58(1), 267\u2013288 (1996)","key":"2713_CR42","DOI":"10.1111\/j.2517-6161.1996.tb02080.x"}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-025-02713-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10957-025-02713-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-025-02713-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,23]],"date-time":"2025-06-23T08:46:43Z","timestamp":1750668403000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10957-025-02713-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,9]]},"references-count":42,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2025,8]]}},"alternative-id":["2713"],"URL":"https:\/\/doi.org\/10.1007\/s10957-025-02713-5","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"type":"print","value":"0022-3239"},{"type":"electronic","value":"1573-2878"}],"subject":[],"published":{"date-parts":[[2025,6,9]]},"assertion":[{"value":"11 October 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 April 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 June 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"52"}}