{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,20]],"date-time":"2026-07-20T03:29:56Z","timestamp":1784518196404,"version":"3.55.0"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2022,1,8]],"date-time":"2022-01-08T00:00:00Z","timestamp":1641600000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,8]],"date-time":"2022-01-08T00:00:00Z","timestamp":1641600000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Numer Algor"],"published-print":{"date-parts":[[2022,8]]},"DOI":"10.1007\/s11075-021-01246-y","type":"journal-article","created":{"date-parts":[[2022,1,8]],"date-time":"2022-01-08T03:02:47Z","timestamp":1641610967000},"page":"1669-1690","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":26,"title":["Inertial accelerated primal-dual methods for linear equality constrained convex optimization problems"],"prefix":"10.1007","volume":"90","author":[{"given":"Xin","family":"He","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rong","family":"Hu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1831-8039","authenticated-orcid":false,"given":"Ya-Ping","family":"Fang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,1,8]]},"reference":[{"issue":"1","key":"1246_CR1","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/s10107-018-1350-9","volume":"180","author":"V Apidopoulos","year":"2020","unstructured":"Apidopoulos, V., Aujol, J. F., Dossal, C.: Convergence rate of inertial forward-backward algorithm beyond Nesterov\u2019s rule. Math. Program. 180(1), 137\u2013156 (2020)","journal-title":"Math. Program."},{"issue":"1-2","key":"1246_CR2","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/s10107-016-0992-8","volume":"168","author":"H Attouch","year":"2018","unstructured":"Attouch, H., Chbani, Z., Peypouquet, J., Redont, P.: Fast convergence of inertial dynamics and algorithms with asymptotic vanishing viscosity. Math. Program. 168(1-2), 123\u2013175 (2018)","journal-title":"Math. Program."},{"issue":"3","key":"1246_CR3","doi-asserted-by":"publisher","first-page":"1824","DOI":"10.1137\/15M1046095","volume":"26","author":"H Attouch","year":"2016","unstructured":"Attouch, H., Peypouquet, J.: The rate of convergence of Nesterov\u2019s accelerated forward-backward method is actually faster than 1\/k2. SIAM J. Optim. 26(3), 1824\u20131834 (2016)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"1246_CR4","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1137\/130910294","volume":"24","author":"H Attouch","year":"2014","unstructured":"Attouch, H., Peypouquet, J., Redont, P.: A dynamical approach to an inertial forward-backward algorithm for convex minimization. SIAM J. Optim. 24(1), 232\u2013256 (2014)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"1246_CR5","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."},{"key":"1246_CR6","unstructured":"Bertsekas, D.: Constrained optimization and lagrange multiplier methods. Academic Press (1982)"},{"key":"1246_CR7","doi-asserted-by":"crossref","unstructured":"Bo\u0163, R. I., Csetnek, E. R., Nguyen, D. K.: Fast augmented Lagrangian method in the convex regime with convergence guarantees for the iterates. arXiv:https:\/\/arxiv.org\/abs\/2111.09370 (2021)","DOI":"10.1007\/s10107-022-01879-4"},{"key":"1246_CR8","doi-asserted-by":"publisher","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\u2013122 (2010)","journal-title":"Found. Trends Mach. Learn."},{"issue":"2","key":"1246_CR9","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1109\/MSP.2007.914731","volume":"25","author":"EJ Candes","year":"2008","unstructured":"Candes, E. J., Wakin, M. B.: An introduction to compressive sampling. IEEE Signal. Proc. Mag. 25(2), 21\u201330 (2008)","journal-title":"IEEE Signal. Proc. Mag."},{"issue":"1","key":"1246_CR10","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1137\/S003614450037906X","volume":"43","author":"SS Chen","year":"2001","unstructured":"Chen, S. S., Donoho, D. L., Saunders, M. A.: Atomic decomposition by basis pursuit. SIAM Rev. 43(1), 129\u2013159 (2001)","journal-title":"SIAM Rev."},{"issue":"1-3","key":"1246_CR11","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/BF01582566","volume":"64","author":"G Chen","year":"1994","unstructured":"Chen, G., Teboulle, M.: A proximal-based decomposition method for convex minimization problems. Math. Program. 64(1-3), 81\u2013101 (1994)","journal-title":"Math. Program."},{"issue":"1-2","key":"1246_CR12","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/s10107-012-0530-2","volume":"141","author":"D Goldfarb","year":"2013","unstructured":"Goldfarb, D., Ma, S., Scheinberg, K.: Fast alternating linearization methods for minimizing the sum of two convex functions. Math. Program. 141 (1-2), 349\u2013382 (2013)","journal-title":"Math. Program."},{"issue":"1-2","key":"1246_CR13","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/s10589-013-9616-x","volume":"59","author":"G Gu","year":"2014","unstructured":"Gu, G., He, B., Yuan, X.: Customized proximal point algorithms for linearly constrained convex minimization and saddle-point problems: a unified approach. Comput. Optim. Appl. 59(1-2), 135\u2013161 (2014)","journal-title":"Comput. Optim. Appl."},{"key":"1246_CR14","doi-asserted-by":"crossref","unstructured":"He, X., Hu, R., Fang, Y. P.: Convergence rates of inertial primal-dual dynamical methods for separable convex optimization problems. SIAM J. Control Optim. 59(5), 3278\u20133301 (2021)","DOI":"10.1137\/20M1355379"},{"key":"1246_CR15","unstructured":"He, B., Yuan, X.: On the acceleration of augmented Lagrangian method for linearly constrained optimization. Optimization online http:\/\/www.optimization-online.org\/DB_FILE\/2010\/10\/2760.pdf (2010)"},{"issue":"2","key":"1246_CR16","doi-asserted-by":"publisher","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(2), 428\u2013453 (2013)","journal-title":"J. Sci. Comput."},{"issue":"3","key":"1246_CR17","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/s10915-013-9686-z","volume":"56","author":"M Kang","year":"2013","unstructured":"Kang, M., Yun, S., Woo, H., Kang, M.: Accelerated Bregman method for linearly constrained \u21131 \u2212 \u21132 minimization. J. Sci. Comput. 56(3), 515\u2013534 (2013)","journal-title":"J. Sci. Comput."},{"issue":"2","key":"1246_CR18","doi-asserted-by":"publisher","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":"1246_CR19","doi-asserted-by":"crossref","unstructured":"Lin, Z., Li, H., Fang, C.: Accelerated optimization for machine learning. Springer, Singapore (2019)","DOI":"10.1007\/978-981-15-2910-8"},{"issue":"2","key":"1246_CR20","doi-asserted-by":"publisher","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 $\\mathcal {O}(1\/k)$ nonergodic analysis. J. Sci. Comput. 79(2), 671\u2013699 (2019)","journal-title":"J. Sci. Comput."},{"issue":"2","key":"1246_CR21","doi-asserted-by":"publisher","first-page":"896","DOI":"10.1007\/s40314-016-0371-3","volume":"37","author":"F Ma","year":"2018","unstructured":"Ma, F., Ni, M.: A class of customized proximal point algorithms for linearly constrained convex optimization. Comput. Appl. Math. 37(2), 896\u2013911 (2018)","journal-title":"Comput. Appl. Math."},{"issue":"8","key":"1246_CR22","doi-asserted-by":"publisher","first-page":"2185","DOI":"10.1109\/TWC.2006.1687734","volume":"5","author":"R Madan","year":"2006","unstructured":"Madan, R., Lall, S.: Distributed algorithms for maximum lifetime routing in wireless sensor networks. IEEE Trans Wirel. Commun. 5(8), 2185\u20132193 (2006)","journal-title":"IEEE Trans Wirel. Commun."},{"key":"1246_CR23","doi-asserted-by":"crossref","unstructured":"Nedic, A., Ozdaglar, A.: Cooperative Distributed Multi-agent. Convex Optimization in Signal Processing and Communications. Cambridge University Press (2010)","DOI":"10.1017\/CBO9780511804458.011"},{"issue":"2","key":"1246_CR24","doi-asserted-by":"publisher","first-page":"632","DOI":"10.1287\/moor.2018.0939","volume":"44","author":"YF Liu","year":"2019","unstructured":"Liu, Y. F., Liu, X., Ma, S.: On the nonergodic convergence rate of an inexact augmented Lagrangian framework for composite convex programming. Math. Oper. Res. 44(2), 632\u2013650 (2019)","journal-title":"Math. Oper. Res."},{"key":"1246_CR25","unstructured":"Nesterov, Y.: A method of solving a convex programming problem with convergence rate $\\mathcal {O}(1\/k^{2})$. Insov. Math. Dokl. 27, 372\u2013376 (1983)"},{"issue":"1","key":"1246_CR26","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."},{"key":"1246_CR27","unstructured":"Nocedal, J., Wright, S.: Numerical optimization. Springer Science and Business Media (2006)"},{"issue":"12","key":"1246_CR28","doi-asserted-by":"publisher","first-page":"3018","DOI":"10.1016\/j.automatica.2012.08.018","volume":"48","author":"G Shi","year":"2012","unstructured":"Shi, G., Johansson, K. H.: Randomized optimal consensus of multi-agent systems. Automatica 48(12), 3018\u20133030 (2012)","journal-title":"Automatica"},{"issue":"1","key":"1246_CR29","first-page":"5312","volume":"17","author":"W Su","year":"2016","unstructured":"Su, W., Boyd, S., Candes, E. J.: A differential equation for modeling Nesterov\u2019s accelerated gradient method: theory and insights. J. Mach. Learn. Res. 17(1), 5312\u20135354 (2016)","journal-title":"J. Mach. Learn. Res."},{"issue":"4","key":"1246_CR30","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-Dual algorithms with fast convergence rates. SIAM J. Optim. 30(4), 2866\u20132896 (2020)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"1246_CR31","doi-asserted-by":"publisher","first-page":"890","DOI":"10.1137\/080714488","volume":"31","author":"E Van Den Berg","year":"2009","unstructured":"Van Den Berg, E., Friedlander, M. P.: Probing the Pareto frontier for basis pursuit solutions. SIAM J. Sci. Comput. 31(2), 890\u2013912 (2009)","journal-title":"SIAM J. Sci. Comput."},{"issue":"3","key":"1246_CR32","doi-asserted-by":"publisher","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","key":"1246_CR33","doi-asserted-by":"publisher","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 \u21131-minimization with applications to compressed sensing. SIAM J. Imaging Sci. 1(1), 143\u2013168 (2008)","journal-title":"SIAM J. Imaging Sci."},{"key":"1246_CR34","unstructured":"Zeng, X., Lei, J., Chen, J.: Dynamical primal-dual accelerated method with applications to network optimization. arXiv:https:\/\/arxiv.org\/abs\/1912.03690 (2019)"}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-021-01246-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11075-021-01246-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-021-01246-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,22]],"date-time":"2023-01-22T08:36:00Z","timestamp":1674376560000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11075-021-01246-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,1,8]]},"references-count":34,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2022,8]]}},"alternative-id":["1246"],"URL":"https:\/\/doi.org\/10.1007\/s11075-021-01246-y","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"value":"1017-1398","type":"print"},{"value":"1572-9265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,1,8]]},"assertion":[{"value":"29 June 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 December 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 January 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}