{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,31]],"date-time":"2026-01-31T07:52:31Z","timestamp":1769845951963,"version":"3.49.0"},"reference-count":69,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,3,1]],"date-time":"2024-03-01T00:00:00Z","timestamp":1709251200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,3,1]],"date-time":"2024-03-01T00:00:00Z","timestamp":1709251200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100012494","name":"Chongqing Municipal Education Commission Foundation","doi-asserted-by":"publisher","award":["KJZD-K202300505"],"award-info":[{"award-number":["KJZD-K202300505"]}],"id":[{"id":"10.13039\/100012494","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":[[2024,4]]},"DOI":"10.1007\/s10957-024-02394-6","type":"journal-article","created":{"date-parts":[[2024,3,1]],"date-time":"2024-03-01T20:03:09Z","timestamp":1709323389000},"page":"280-312","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["A Universal Accelerated Primal\u2013Dual Method for Convex Optimization Problems"],"prefix":"10.1007","volume":"201","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9846-5399","authenticated-orcid":false,"given":"Hao","family":"Luo","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,3,1]]},"reference":[{"key":"2394_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-9467-7","volume-title":"Convex Analysis and Monotone Operator Theory in Hilbert Spaces","author":"H Bauschke","year":"2011","unstructured":"Bauschke, H., Combettes, P.: Convex Analysis and Monotone Operator Theory in Hilbert Spaces. CMS Books in Mathematics. Springer Science+Business Media, New York (2011)"},{"issue":"1","key":"2394_CR2","doi-asserted-by":"crossref","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":"2394_CR3","doi-asserted-by":"crossref","first-page":"2311","DOI":"10.1093\/imanum\/draa038","volume":"41","author":"P Blanchard","year":"2021","unstructured":"Blanchard, P., Higham, D.J., Higham, N.J.: Accurately computing the log-sum-exp and softmax functions. IMA J. Numer. Anal. 41(4), 2311\u20132330 (2021)","journal-title":"IMA J. Numer. Anal."},{"issue":"1","key":"2394_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1561\/2200000016","volume":"3","author":"S Boyd","year":"2010","unstructured":"Boyd, S., Parikh, N., Chu, E., Peleato, B., Eckstein, J.: Distributed optimization and statistical learning via the alternating direction method of multipliers. Found. Trends Mach. Learn. 3(1), 1\u2013122 (2010)","journal-title":"Found. Trends Mach. Learn."},{"issue":"267","key":"2394_CR5","doi-asserted-by":"crossref","first-page":"1515","DOI":"10.1090\/S0025-5718-08-02189-3","volume":"78","author":"J-F Cai","year":"2009","unstructured":"Cai, J.-F., Osher, S., Shen, Z.: Linearized Bregman iterations for compressed sensing. Math. Comput. 78(267), 1515\u20131536 (2009)","journal-title":"Math. Comput."},{"issue":"2","key":"2394_CR6","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1109\/TIT.2005.862083","volume":"52","author":"E Cand\u00e8s","year":"2006","unstructured":"Cand\u00e8s, E., Romberg, J., Tao, T.: Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information. IEEE Trans. Inf. Theory 52(2), 489\u2013509 (2006)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"2394_CR7","doi-asserted-by":"crossref","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."},{"key":"2394_CR8","doi-asserted-by":"crossref","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 Numer. 25, 161\u2013319 (2016)","journal-title":"Acta Numer."},{"issue":"3","key":"2394_CR9","doi-asserted-by":"crossref","first-page":"538","DOI":"10.1137\/0803026","volume":"3","author":"G Chen","year":"1993","unstructured":"Chen, G., Teboulle, M.: Convergence analysis of a proximal-like minimization algorithm using Bregman functions. SIAM J. Optim. 3(3), 538\u2013543 (1993)","journal-title":"SIAM J. Optim."},{"key":"2394_CR10","unstructured":"Chen, L., Luo, H.: First order optimization methods based on Hessian-driven Nesterov accelerated gradient flow. arXiv:1912.09276 (2019)"},{"key":"2394_CR11","unstructured":"Chen, L., Luo, H.: A unified convergence analysis of first order convex optimization methods via strong Lyapunov functions. arXiv: 2108.00132 (2021)"},{"issue":"4","key":"2394_CR12","doi-asserted-by":"crossref","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":"2394_CR13","doi-asserted-by":"crossref","unstructured":"Davis, D., Yin, W.: Convergence rate analysis of several splitting schemes. Splitting Methods in Communication, Imaging, Science, and Engineering, pages 115\u2013163 (2016)","DOI":"10.1007\/978-3-319-41589-5_4"},{"key":"2394_CR14","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4471-2807-6","volume-title":"Functional Spaces for the Theory of Elliptic Partial Differential Equations","author":"F Demengel","year":"2012","unstructured":"Demengel, F., Demengel, G., Ern\u00e9, R.: Functional Spaces for the Theory of Elliptic Partial Differential Equations. Universitext. Springer, London (2012)"},{"issue":"1\u20132","key":"2394_CR15","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/s10107-013-0677-5","volume":"146","author":"O Devolder","year":"2014","unstructured":"Devolder, O., Glineur, F., Nesterov, Y.: First-order methods of smooth convex optimization with inexact oracle. Math. Program. 146(1\u20132), 37\u201375 (2014)","journal-title":"Math. Program."},{"key":"2394_CR16","unstructured":"Dvurechensky, P, Gasnikov, A., Kroshnin, A.: Computational optimal transport: complexity by accelerated gradient descent is better than by Sinkhorn\u2019s algorithm. In: Proceedings of the 35 th International Conference on Machine Learning, volume\u00a080, Stockholm, Sweden (2018). PMLR"},{"key":"2394_CR17","doi-asserted-by":"crossref","unstructured":"Dvurechensky, P., Staudigl, M., Shtern, S.: First-order methods for convex optimization. arXiv:2101.00935 (2021)","DOI":"10.1016\/j.ejco.2021.100015"},{"key":"2394_CR18","unstructured":"Eckstein, J.: Splitting Methods for Monotone Operators with Applications to Parallel Optimization. PhD Thesis, Massachusetts Institute of Technology (1989)"},{"issue":"1","key":"2394_CR19","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1007\/BF01581204","volume":"55","author":"J Eckstein","year":"1992","unstructured":"Eckstein, J., Bertsekas, D.P.: On the Douglas\u2013Rachford splitting method and the proximal point algorithm for maximal monotone operators. Math. Program. 55(1), 293\u2013318 (1992)","journal-title":"Math. Program."},{"issue":"4","key":"2394_CR20","doi-asserted-by":"crossref","first-page":"1015","DOI":"10.1137\/09076934X","volume":"3","author":"E Esser","year":"2010","unstructured":"Esser, E., Zhang, X., Chan, T.F.: A general framework for a class of first order primal-dual algorithms for convex optimization in imaging science. SIAM J. Imaging Sci. 3(4), 1015\u20131046 (2010)","journal-title":"SIAM J. Imaging Sci."},{"issue":"12","key":"2394_CR21","doi-asserted-by":"crossref","first-page":"1974","DOI":"10.1016\/j.automatica.2010.08.011","volume":"46","author":"D Feijer","year":"2010","unstructured":"Feijer, D., Paganini, F.: Stability of primal\u2013dual gradient dynamics and applications to network optimization. Automatica 46(12), 1974\u20131981 (2010)","journal-title":"Automatica"},{"issue":"3","key":"2394_CR22","doi-asserted-by":"crossref","first-page":"1588","DOI":"10.1137\/120896219","volume":"7","author":"T Goldstein","year":"2014","unstructured":"Goldstein, T., O\u2019Donoghue, B., Setzer, S., Baraniuk, R.: Fast alternating direction optimization methods. SIAM J. Imaging Sci. 7(3), 1588\u20131623 (2014)","journal-title":"SIAM J. Imaging Sci."},{"issue":"3","key":"2394_CR23","doi-asserted-by":"crossref","first-page":"560","DOI":"10.1080\/10556788.2018.1517158","volume":"34","author":"S Guminov","year":"2019","unstructured":"Guminov, S., Gasnikov, A., Anikin, A., Gornov, A.: A universal modification of the linear coupling method. Optim. Methods Softw. 34(3), 560\u2013577 (2019)","journal-title":"Optim. Methods Softw."},{"key":"2394_CR24","doi-asserted-by":"crossref","unstructured":"Guminov, S.V., Nesterov, Y.E., Dvurechensky, P.E., Gasnikov, A.V.: Primal\u2013dual accelerated gradient descent with line search for convex and nonconvex optimization problems. arXiv:1809.05895 (2018)","DOI":"10.31857\/S0869-5652485115-18"},{"issue":"4","key":"2394_CR25","doi-asserted-by":"crossref","first-page":"2526","DOI":"10.1137\/140963467","volume":"7","author":"B He","year":"2014","unstructured":"He, B., You, Y., Yuan, X.: On the convergence of primal-dual hybrid gradient algorithm. SIAM J. Imaging Sci. 7(4), 2526\u20132537 (2014)","journal-title":"SIAM J. Imaging Sci."},{"key":"2394_CR26","unstructured":"He, B., Yuan, X.: On the acceleration of augmented Lagrangian method for linearly constrained optimization. https:\/\/optimization-online.org\/2010\/10\/2760\/ (2010)"},{"key":"2394_CR27","volume":"146","author":"X He","year":"2022","unstructured":"He, X., Hu, R., Fang, Y.-P.: Fast primal\u2013dual algorithm via dynamical system for a linearly constrained convex optimization problem. Automatica 146, 110547 (2022)","journal-title":"Automatica"},{"issue":"4","key":"2394_CR28","doi-asserted-by":"crossref","first-page":"1669","DOI":"10.1007\/s11075-021-01246-y","volume":"90","author":"X He","year":"2022","unstructured":"He, X., Hu, R., Fang, Y.-P.: Inertial accelerated primal\u2013dual methods for linear equality constrained convex optimization problems. Numer. Algorithms 90(4), 1669\u20131690 (2022)","journal-title":"Numer. Algorithms"},{"key":"2394_CR29","doi-asserted-by":"crossref","first-page":"428","DOI":"10.1007\/s10915-012-9592-9","volume":"54","author":"B Huang","year":"2013","unstructured":"Huang, B., Ma, S., Goldfarb, D.: Accelerated linearized Bregman method. J. Sci. Comput. 54, 428\u2013453 (2013)","journal-title":"J. Sci. Comput."},{"key":"2394_CR30","unstructured":"Heinonen, J.: Lectures on Lipschitz analysis. Technical Report vol. 100, Rep. Univ. Jyv\u00e4skyl\u00e4 Dept. Math. Stat., University of Jyv\u00e4skyl\u00e4 (2005)"},{"issue":"329","key":"2394_CR31","doi-asserted-by":"crossref","first-page":"1227","DOI":"10.1090\/mcom\/3610","volume":"90","author":"F Jiang","year":"2021","unstructured":"Jiang, F., Cai, X., Wu, Z., Han, D.: Approximate first-order primal-dual algorithms for saddle point problems. Math. Comput. 90(329), 1227\u20131262 (2021)","journal-title":"Math. Comput."},{"key":"2394_CR32","doi-asserted-by":"crossref","unstructured":"Kamzolov, D., Dvurechensky, P., Gasnikov, A.: Universal intermediate gradient method for convex problems with inexact oracle. arXiv:1712.06036 (2019)","DOI":"10.1080\/10556788.2019.1711079"},{"issue":"2","key":"2394_CR33","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/s10589-015-9742-8","volume":"62","author":"M Kang","year":"2015","unstructured":"Kang, M., Kang, M., Jung, M.: Inexact accelerated augmented Lagrangian methods. Comput. Optim. Appl. 62(2), 373\u2013404 (2015)","journal-title":"Comput. Optim. Appl."},{"key":"2394_CR34","first-page":"2845","volume":"28","author":"W Krichene","year":"2015","unstructured":"Krichene, W., Bayen, A., Bartlett, P.: Accelerated mirror descent in continuous and discrete time. Adv. Neural Inf. Process. Syst. (NIPS) 28, 2845\u20132853 (2015)","journal-title":"Adv. Neural Inf. Process. Syst. (NIPS)"},{"key":"2394_CR35","unstructured":"Li, H., Fang, C., Lin, Z.: Convergence rates analysis of the quadratic penalty method and its applications to decentralized distributed optimization. arXiv:1711.10802 (2017)"},{"issue":"2","key":"2394_CR36","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1007\/s10915-018-0893-5","volume":"79","author":"H Li","year":"2019","unstructured":"Li, H., Lin, Z.: Accelerated alternating direction method of multipliers: an optimal $${O}(1\/{K})$$ nonergodic analysis. J. Sci. Comput. 79(2), 671\u2013699 (2019)","journal-title":"J. Sci. Comput."},{"key":"2394_CR37","unstructured":"Lin, T., Ho, N., Jordan, M.I.: On efficient optimal transport: An analysis of greedy and accelerated mirror descent algorithms. In International Conference on Machine Learning, pp. 3982\u20133991. PMLR (2019)"},{"key":"2394_CR38","doi-asserted-by":"publisher","DOI":"10.1080\/02331934.2021.2002327","author":"H Luo","year":"2021","unstructured":"Luo, H.: Accelerated differential inclusion for convex optimization. Optimization (2021). https:\/\/doi.org\/10.1080\/02331934.2021.2002327","journal-title":"Optimization"},{"key":"2394_CR39","unstructured":"Luo, H.: Accelerated primal-dual methods for linearly constrained convex optimization problems. arXiv:2109.12604 (2021)"},{"key":"2394_CR40","unstructured":"Luo, H., Zhang, Z.-H.: A unified differential equation solver approach for separable convex optimization: splitting, acceleration and nonergodic rate. arXiv:2109.13467 (2023)"},{"key":"2394_CR41","doi-asserted-by":"crossref","unstructured":"Luo, H.: A primal\u2013dual flow for affine constrained convex optimization. ESAIM: Control Optim. Calc. Var. 28, 33 (2022)","DOI":"10.1051\/cocv\/2022032"},{"key":"2394_CR42","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-021-01713-3","author":"H Luo","year":"2021","unstructured":"Luo, H., Chen, L.: From differential equation solvers to accelerated first-order methods for convex optimization. Math. Program. (2021). https:\/\/doi.org\/10.1007\/s10107-021-01713-3","journal-title":"Math. Program."},{"issue":"2","key":"2394_CR43","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/0041-5553(85)90100-4","volume":"25","author":"AS Nbmirovskii","year":"1985","unstructured":"Nbmirovskii, A.S., Nrsterov, Y.E.: Optimal methods of smooth convex minimization. USSR Comput. Math. Math. Phys. 25(2), 21\u201330 (1985)","journal-title":"USSR Comput. Math. Math. Phys."},{"key":"2394_CR44","volume-title":"Problem Complexity and Method Efficiency in Optimization","author":"A Nemirovsky","year":"1983","unstructured":"Nemirovsky, A., Yudin, D.: Problem Complexity and Method Efficiency in Optimization. John Wiley & Sons, New York (1983)"},{"key":"2394_CR45","doi-asserted-by":"crossref","unstructured":"Nesterov, Y.: Introductory Lectures on Convex Optimization. Applied Optimization, vol. 87. Springer, US, Boston, MA (2004)","DOI":"10.1007\/978-1-4419-8853-9"},{"issue":"1","key":"2394_CR46","doi-asserted-by":"crossref","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":"2394_CR47","doi-asserted-by":"crossref","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. Ser. B 140(1), 125\u2013161 (2013)","journal-title":"Math. Program. Ser. B"},{"key":"2394_CR48","doi-asserted-by":"crossref","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, 381\u2013404 (2015)","journal-title":"Math. Program."},{"key":"2394_CR49","doi-asserted-by":"crossref","unstructured":"Nesterov, Y.: Lectures on Convex Optimization. Springer Optimization and Its Applications, vol. 137. Springer International Publishing, Cham (2018)","DOI":"10.1007\/978-3-319-91578-4_2"},{"issue":"1","key":"2394_CR50","doi-asserted-by":"crossref","first-page":"644","DOI":"10.1137\/14095697X","volume":"8","author":"Y Ouyang","year":"2015","unstructured":"Ouyang, Y., Chen, Y., Lan, G., Pasiliao, E.: An accelerated linearized alternating direction method of multipliers. SIAM J. Imaging Sci. 8(1), 644\u2013681 (2015)","journal-title":"SIAM J. Imaging Sci."},{"issue":"1\u20132","key":"2394_CR51","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10107-019-01420-0","volume":"185","author":"Y Ouyang","year":"2021","unstructured":"Ouyang, Y., Xu, Y.: Lower complexity bounds of first-order methods for convex\u2013concave bilinear Saddle-point problems. Math. Program. 185(1\u20132), 1\u201335 (2021)","journal-title":"Math. Program."},{"key":"2394_CR52","unstructured":"Roulet, V., d\u2019Aspremont, A.: Sharpness, restart, and acceleration. In: 31st Conference on Neural Information Processing Systems, Long Beach, CA, USA (2017)"},{"issue":"1","key":"2394_CR53","doi-asserted-by":"crossref","first-page":"204","DOI":"10.1137\/20M1375358","volume":"32","author":"S Sabach","year":"2022","unstructured":"Sabach, S., Teboulle, M.: Faster Lagrangian-based methods in convex optimization. SIAM J. Optim. 32(1), 204\u2013227 (2022)","journal-title":"SIAM J. Optim."},{"key":"2394_CR54","doi-asserted-by":"crossref","unstructured":"Stonyakin, F., Dvinskikh, D., Dvurechensky, P., Kroshnin, A., Kuznetsova, O., Agafonov, A., Gasnikov, A., Tyurin, A., Uribe, C.A., Pasechnyuk, D., Artamonov, S.: Gradient methods for problems with inexact model of the objective. arXiv:1902.09001 (2019)","DOI":"10.1007\/978-3-030-22629-9_8"},{"key":"2394_CR55","doi-asserted-by":"crossref","unstructured":"Stonyakin, F., Gasnikov, A., Dvurechensky, P., Alkousa, M., Titov, A.: Generalized mirror prox for monotone variational inequalities: Universality and inexact oracle. arXiv:1806.05140 (2022)","DOI":"10.1007\/s10957-022-02062-7"},{"issue":"306","key":"2394_CR56","doi-asserted-by":"crossref","first-page":"1821","DOI":"10.1090\/mcom\/3145","volume":"86","author":"M Tao","year":"2016","unstructured":"Tao, M., Yuan, X.: Accelerated Uzawa methods for convex optimization. Math. Comput. 86(306), 1821\u20131845 (2016)","journal-title":"Math. Comput."},{"issue":"318","key":"2394_CR57","doi-asserted-by":"crossref","first-page":"1685","DOI":"10.1090\/mcom\/3388","volume":"88","author":"W Tian","year":"2018","unstructured":"Tian, W., Yuan, X.: An alternating direction method of multipliers with a worst-case $${O}(1\/n^2)$$ convergence rate. Math. Comput. 88(318), 1685\u20131713 (2018)","journal-title":"Math. Comput."},{"key":"2394_CR58","doi-asserted-by":"publisher","DOI":"10.1007\/s11590-021-01775-4","author":"Q Tran-Dinh","year":"2021","unstructured":"Tran-Dinh, Q.: A unified convergence rate analysis of the accelerated smoothed gap reduction algorithm. Optim. Lett. (2021). https:\/\/doi.org\/10.1007\/s11590-021-01775-4","journal-title":"Optim. Lett."},{"issue":"1","key":"2394_CR59","doi-asserted-by":"crossref","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-dual optimization framework for nonsmooth composite convex minimization. SIAM J. Optim. 28(1), 96\u2013134 (2018)","journal-title":"SIAM J. Optim."},{"key":"2394_CR60","unstructured":"Tran-Dinh, Q., Zhu, Y.: Augmented Lagrangian-based decomposition methods with non-ergodic optimal rates. arXiv:1806.05280 (2018)"},{"issue":"4","key":"2394_CR61","doi-asserted-by":"crossref","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."},{"issue":"2","key":"2394_CR62","doi-asserted-by":"crossref","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":"47","key":"2394_CR63","doi-asserted-by":"crossref","first-page":"E7351","DOI":"10.1073\/pnas.1614734113","volume":"113","author":"A Wibisono","year":"2016","unstructured":"Wibisono, A., Wilson, A.C., Jordan, M.I.: A variational perspective on accelerated methods in optimization. Proc. Natl. Acad. Sci. 113(47), E7351\u2013E7358 (2016)","journal-title":"Proc. Natl. Acad. Sci."},{"key":"2394_CR64","unstructured":"Wilson, A., Recht, B., Jordan, M.: A Lyapunov analysis of momentum methods in optimization. arXiv:1611.02635 (2016)"},{"issue":"3","key":"2394_CR65","doi-asserted-by":"crossref","first-page":"1459","DOI":"10.1137\/16M1082305","volume":"27","author":"Y Xu","year":"2017","unstructured":"Xu, Y.: Accelerated first-order primal-dual proximal methods for linearly constrained composite convex programming. SIAM J. Optim. 27(3), 1459\u20131484 (2017)","journal-title":"SIAM J. Optim."},{"issue":"1\u20132","key":"2394_CR66","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/s10107-019-01425-9","volume":"185","author":"Y Xu","year":"2021","unstructured":"Xu, Y.: Iteration complexity of inexact augmented Lagrangian methods for constrained convex programming. Math. Program. 185(1\u20132), 199\u2013244 (2021)","journal-title":"Math. Program."},{"issue":"1","key":"2394_CR67","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1137\/070703983","volume":"1","author":"W Yin","year":"2008","unstructured":"Yin, W., Osher, S., Goldfarb, D., Darbon, J.: Bregman iterative algorithms for $$\\ell _1$$-minimization with applications to compressed sensing. SIAM J. Imaging Sci. 1(1), 143\u2013168 (2008)","journal-title":"SIAM J. Imaging Sci."},{"key":"2394_CR68","unstructured":"Yurtsever, A., Tran-Dinh, Q., Cevher, V.: A universal primal-dual convex optimization framework. arXiv: 1502.03123 (2015)"},{"key":"2394_CR69","unstructured":"Zhao, Y., Liao, X., He, X., Li, C.: Accelerated primal-dual mirror dynamical approaches for constrained convex optimization. arXiv:2205.15983 (2022)"}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-024-02394-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10957-024-02394-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-024-02394-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,17]],"date-time":"2024-04-17T13:24:20Z","timestamp":1713360260000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10957-024-02394-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,3,1]]},"references-count":69,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,4]]}},"alternative-id":["2394"],"URL":"https:\/\/doi.org\/10.1007\/s10957-024-02394-6","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"value":"0022-3239","type":"print"},{"value":"1573-2878","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,3,1]]},"assertion":[{"value":"8 December 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 January 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 March 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}