{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,3]],"date-time":"2025-12-03T17:57:31Z","timestamp":1764784651635,"version":"3.37.3"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2021,7,1]],"date-time":"2021-07-01T00:00:00Z","timestamp":1625097600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,7,1]],"date-time":"2021-07-01T00:00:00Z","timestamp":1625097600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000006","name":"Office of Naval Research","doi-asserted-by":"crossref","award":["ONR-N00014-20-1-2088"],"award-info":[{"award-number":["ONR-N00014-20-1-2088"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/100007224","name":"National Foundation for Science and Technology Development","doi-asserted-by":"publisher","award":["101.01-2020.06"],"award-info":[{"award-number":["101.01-2020.06"]}],"id":[{"id":"10.13039\/100007224","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2022,5]]},"DOI":"10.1007\/s11590-021-01775-4","type":"journal-article","created":{"date-parts":[[2021,7,1]],"date-time":"2021-07-01T12:03:29Z","timestamp":1625141009000},"page":"1235-1257","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["A unified convergence rate analysis of the accelerated smoothed gap reduction algorithm"],"prefix":"10.1007","volume":"16","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1077-2579","authenticated-orcid":false,"given":"Quoc","family":"Tran-Dinh","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,7,1]]},"reference":[{"key":"1775_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-48311-5","volume-title":"Convex Analysis and Monotone Operators Theory in Hilbert Spaces","author":"HH Bauschke","year":"2017","unstructured":"Bauschke, H.H., Combettes, P.: Convex Analysis and Monotone Operators Theory in Hilbert Spaces, 2nd edn. Springer, Berlin (2017)","edition":"2"},{"issue":"1","key":"1775_CR2","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":"4","key":"1775_CR3","doi-asserted-by":"publisher","first-page":"791","DOI":"10.1093\/biomet\/asr043","volume":"94","author":"A Belloni","year":"2011","unstructured":"Belloni, A., Chernozhukov, V., Wang, L.: Square-root LASSO: Pivotal recovery of sparse signals via conic programming. Biometrika 94(4), 791\u2013806 (2011)","journal-title":"Biometrika"},{"key":"1775_CR4","doi-asserted-by":"crossref","unstructured":"Bo\u0163, R.I., B\u00f6hm, A.: Variable smoothing for convex optimization problems using stochastic gradients. J. Sci. Comput. 85(2), 1\u201329 (2020)","DOI":"10.1007\/s10915-020-01332-8"},{"issue":"1","key":"1775_CR5","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1007\/s10851-010-0251-1","volume":"40","author":"A Chambolle","year":"2011","unstructured":"Chambolle, A., Pock, T.: A first-order primal\u2013dual algorithm for convex problems with applications to imaging. J. Math. Imaging Vis. 40(1), 120\u2013145 (2011)","journal-title":"J. Math. Imaging Vis."},{"issue":"1\u20132","key":"1775_CR6","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/s10107-015-0957-3","volume":"159","author":"A Chambolle","year":"2016","unstructured":"Chambolle, A., Pock, T.: On the ergodic convergence rates of a first-order primal\u2013dual algorithm. Math. Program. 159(1\u20132), 253\u2013287 (2016)","journal-title":"Math. Program."},{"issue":"4","key":"1775_CR7","doi-asserted-by":"publisher","first-page":"1779","DOI":"10.1137\/130919362","volume":"24","author":"Y Chen","year":"2014","unstructured":"Chen, Y., Lan, G., Ouyang, Y.: Optimal primal\u2013dual methods for a class of saddle-point problems. SIAM J. Optim. 24(4), 1779\u20131814 (2014)","journal-title":"SIAM J. Optim."},{"key":"1775_CR8","doi-asserted-by":"publisher","first-page":"460","DOI":"10.1007\/s10957-012-0245-9","volume":"158","author":"L Condat","year":"2013","unstructured":"Condat, L.: A primal\u2013dual splitting method for convex optimization involving Lipschitzian, proximable and linear composite terms. J. Optim. Theory Appl. 158, 460\u2013479 (2013)","journal-title":"J. Optim. Theory Appl."},{"issue":"3","key":"1775_CR9","doi-asserted-by":"publisher","first-page":"1912","DOI":"10.1137\/151003076","volume":"25","author":"D Davis","year":"2015","unstructured":"Davis, D.: Convergence rate analysis of primal\u2013dual splitting schemes. SIAM J. Optim. 25(3), 1912\u20131943 (2015)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"1775_CR10","doi-asserted-by":"publisher","first-page":"829","DOI":"10.1007\/s11228-017-0421-z","volume":"25","author":"D Davis","year":"2017","unstructured":"Davis, D., Yin, W.: A three-operator splitting scheme and its optimization applications. Set-Valued Var. Anal. 25(4), 829\u2013858 (2017)","journal-title":"Set-Valued Var. Anal."},{"issue":"4","key":"1775_CR11","doi-asserted-by":"publisher","first-page":"1015","DOI":"10.1137\/09076934X","volume":"3","author":"E Esser","year":"2010","unstructured":"Esser, E., Zhang, X., Chan, T.: A general framework for a class of first order primal\u2013dual algorithms for TV-minimization. SIAM J. Imaging Sci. 3(4), 1015\u20131046 (2010)","journal-title":"SIAM J. Imaging Sci."},{"key":"1775_CR12","unstructured":"Goldstein, T., Esser, E., Baraniuk, R.: Adaptive primal-dual hybrid gradient methods for saddle point problems. Technical Report, pp. 1\u201326 (2013). arxiv: 1305.0546v1.pdf"},{"key":"1775_CR13","unstructured":"Grant, M.: Disciplined Convex Programming. Ph.D. thesis, Stanford University (2004)"},{"key":"1775_CR14","doi-asserted-by":"publisher","first-page":"700","DOI":"10.1137\/110836936","volume":"50","author":"BS He","year":"2012","unstructured":"He, B.S., Yuan, X.M.: On the $${O}(1\/n)$$ convergence rate of the Douglas\u2013Rachford alternating direction method. SIAM J. Numer. Anal. 50, 700\u2013709 (2012)","journal-title":"SIAM J. Numer. Anal."},{"key":"1775_CR15","volume-title":"Problem Complexity and Method Efficiency in Optimization","author":"A Nemirovskii","year":"1983","unstructured":"Nemirovskii, A., Yudin, D.: Problem Complexity and Method Efficiency in Optimization. Wiley Interscience, London (1983)"},{"key":"1775_CR16","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-8853-9","volume-title":"Introductory Lectures on Convex Optimization: A Basic Course, Volume\u00a087 of Applied Optimization","author":"Y Nesterov","year":"2004","unstructured":"Nesterov, Y.: Introductory Lectures on Convex Optimization: A Basic Course, Volume\u00a087 of Applied Optimization. Kluwer Academic Publishers, London (2004)"},{"issue":"1","key":"1775_CR17","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/s10107-004-0552-5","volume":"103","author":"Y Nesterov","year":"2005","unstructured":"Nesterov, Y.: Smooth minimization of non-smooth functions. Math. Program. 103(1), 127\u2013152 (2005)","journal-title":"Math. Program."},{"issue":"1","key":"1775_CR18","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 objective function. Math. Program. 140(1), 125\u2013161 (2013)","journal-title":"Math. Program."},{"key":"1775_CR19","doi-asserted-by":"crossref","unstructured":"O\u2019Connor, D., Vandenberghe, L.: Primal-dual decomposition by operator splitting and applications to image deblurring. SIAM J. Imaging Sci. 7(3), 1724\u20131754 (2014)","DOI":"10.1137\/13094671X"},{"key":"1775_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10107-019-01420-0","volume":"185","author":"Y Ouyang","year":"2019","unstructured":"Ouyang, Y., Xu, Y.: Lower complexity bounds of first-order methods for convex-concave bilinear saddle-point problems. Math. Program. 185, 1\u201335 (2019)","journal-title":"Math. Program."},{"key":"1775_CR21","doi-asserted-by":"crossref","unstructured":"Sabach, S., Teboulle, M.: Faster Lagrangian-based methods in convex optimization (2020). arXiv preprint arXiv:2010.14314","DOI":"10.1016\/bs.hna.2019.04.002"},{"key":"1775_CR22","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/s12532-019-00173-3","volume":"12","author":"Q Tran-Dinh","year":"2020","unstructured":"Tran-Dinh, Q., Alacaoglu, A., Fercoq, O., Cevher, V.: An adaptive primal\u2013dual framework for nonsmooth convex minimization. Math. Program. Compt. 12, 451\u2013491 (2020)","journal-title":"Math. Program. Compt."},{"issue":"1","key":"1775_CR23","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1137\/16M1093094","volume":"28","author":"Q Tran-Dinh","year":"2018","unstructured":"Tran-Dinh, Q., Fercoq, O., Cevher, V.: A smooth primal\u2013dual optimization framework for nonsmooth composite convex minimization. SIAM J. Optim. 28(1), 96\u2013134 (2018)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"1775_CR24","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/s10589-012-9515-6","volume":"55","author":"Q Tran-Dinh","year":"2013","unstructured":"Tran-Dinh, Q., Savorgnan, C., Diehl, M.: Combining Lagrangian decomposition and excessive gap smoothing technique for solving large-scale separable convex optimization problems. Comput. Optim. Appl. 55(1), 75\u2013111 (2013)","journal-title":"Comput. Optim. Appl."},{"issue":"4","key":"1775_CR25","doi-asserted-by":"publisher","first-page":"2866","DOI":"10.1137\/19M1293855","volume":"30","author":"Q Tran-Dinh","year":"2020","unstructured":"Tran-Dinh, Q., Zhu, Y.: Non-stationary first-order primal\u2013dual algorithms with faster convergence rates. SIAM J. Optim. 30(4), 2866\u20132896 (2020)","journal-title":"SIAM J. Optim."},{"key":"1775_CR26","unstructured":"Tseng, P.: On accelerated proximal gradient methods for convex\u2013concave optimization. SIAM J. Optim. (2008)"},{"issue":"2","key":"1775_CR27","doi-asserted-by":"publisher","first-page":"1391","DOI":"10.1137\/18M1182851","volume":"30","author":"T Valkonen","year":"2020","unstructured":"Valkonen, T.: Inertial, corrected, primal\u2013dual proximal splitting. SIAM J. Optim. 30(2), 1391\u20131420 (2020)","journal-title":"SIAM J. Optim."},{"issue":"9","key":"1775_CR28","doi-asserted-by":"publisher","first-page":"1050","DOI":"10.1080\/01630563.2013.763825","volume":"34","author":"BC Vu","year":"2013","unstructured":"Vu, B.C.: A variable metric extension of the forward\u2013backward\u2013forward algorithm for monotone operators. Numer. Funct. Anal. Optim. 34(9), 1050\u20131065 (2013)","journal-title":"Numer. Funct. Anal. Optim."},{"key":"1775_CR29","unstructured":"Zhu, Y., Liu, D., Tran-Dinh, Q.: Primal\u2013dual algorithms for a class of nonlinear compositional convex optimization problems, pp. 1\u201326 (2020). arXiv preprint arXiv:2006.09263"},{"issue":"2","key":"1775_CR30","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1111\/j.1467-9868.2005.00503.x","volume":"67","author":"H Zou","year":"2005","unstructured":"Zou, H., Hastie, T.: Regularization and variable selection via the elastic net. J. Roy. Stat. Soc. B 67(2), 301\u2013320 (2005)","journal-title":"J. Roy. Stat. Soc. B"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-021-01775-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11590-021-01775-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-021-01775-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,16]],"date-time":"2022-04-16T12:43:59Z","timestamp":1650113039000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11590-021-01775-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,1]]},"references-count":30,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2022,5]]}},"alternative-id":["1775"],"URL":"https:\/\/doi.org\/10.1007\/s11590-021-01775-4","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"type":"print","value":"1862-4472"},{"type":"electronic","value":"1862-4480"}],"subject":[],"published":{"date-parts":[[2021,7,1]]},"assertion":[{"value":"27 November 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 June 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 July 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}