{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T10:19:09Z","timestamp":1778581149618,"version":"3.51.4"},"reference-count":47,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/100012542","name":"Sichuan Province Science and Technology Support Program","doi-asserted-by":"publisher","award":["2025ZNSFSC0813"],"award-info":[{"award-number":["2025ZNSFSC0813"]}],"id":[{"id":"10.13039\/100012542","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100008083","name":"Xihua University","doi-asserted-by":"publisher","award":["Z241102"],"award-info":[{"award-number":["Z241102"]}],"id":[{"id":"10.13039\/501100008083","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12171339"],"award-info":[{"award-number":["12171339"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12471296"],"award-info":[{"award-number":["12471296"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12471296,12171339"],"award-info":[{"award-number":["12471296,12171339"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Communications in Nonlinear Science and Numerical Simulation"],"published-print":{"date-parts":[[2026,7]]},"DOI":"10.1016\/j.cnsns.2026.109818","type":"journal-article","created":{"date-parts":[[2026,2,7]],"date-time":"2026-02-07T07:42:25Z","timestamp":1770450145000},"page":"109818","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Accelerated linearized alternating direction method of multipliers with Nesterov extrapolation"],"prefix":"10.1016","volume":"158","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4896-2482","authenticated-orcid":false,"given":"Xin","family":"He","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0248-9316","authenticated-orcid":false,"given":"Nan-Jing","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1831-8039","authenticated-orcid":false,"given":"Ya-Ping","family":"Fang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.cnsns.2026.109818_bib0001","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1561\/2200000016","article-title":"Distributed optimization and statistical learning via the alternating direction method of multipliers","volume":"2","author":"Boyd","year":"2011","journal-title":"Found Trends Mach Learn"},{"key":"10.1016\/j.cnsns.2026.109818_bib0002","doi-asserted-by":"crossref","first-page":"1588","DOI":"10.1137\/120896219","article-title":"Fast alternating direction optimization methods","volume":"7","author":"Goldstein","year":"2014","journal-title":"SIAM J Imaging Sci"},{"key":"10.1016\/j.cnsns.2026.109818_bib0003","series-title":"Accelerated optimization for machine learning","author":"Lin","year":"2020"},{"key":"10.1016\/j.cnsns.2026.109818_bib0004","series-title":"Alternating direction method of multipliers for machine learning","author":"Lin","year":"2022"},{"key":"10.1016\/j.cnsns.2026.109818_bib0005","first-page":"372","article-title":"A method of solving a convex programming problem with convergence rate o(1\/k2)","volume":"27","author":"Nesterov","year":"1983","journal-title":"Sov Math Dokl"},{"key":"10.1016\/j.cnsns.2026.109818_bib0006","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1137\/080716542","article-title":"A fast iterative shrinkage-thresholding algorithm for linear inverse problems","volume":"2","author":"Beck","year":"2009","journal-title":"SIAM J Imaging Sci"},{"key":"10.1016\/j.cnsns.2026.109818_bib0007","series-title":"Tech. Rep.","article-title":"On accelerated proximal gradient methods for convex-concave optimization","author":"Tseng","year":"2008"},{"key":"10.1016\/j.cnsns.2026.109818_bib0008","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/s10107-016-0992-8","article-title":"Fast convergence of inertial dynamics and algorithms with asymptotic vanishing viscosity","volume":"168","author":"Attouch","year":"2018","journal-title":"Math Program"},{"key":"10.1016\/j.cnsns.2026.109818_bib0009","doi-asserted-by":"crossref","first-page":"735","DOI":"10.1007\/s10107-021-01713-3","article-title":"From differential equation solvers to accelerated first-order methods for convex optimization","volume":"195","author":"Luo","year":"2022","journal-title":"Math Program"},{"key":"10.1016\/j.cnsns.2026.109818_bib0010","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/s10107-012-0629-5","article-title":"Gradient methods for minimizing composite functions","volume":"140","author":"Nesterov","year":"2013","journal-title":"Math Program"},{"key":"10.1016\/j.cnsns.2026.109818_bib0011","first-page":"5312","article-title":"A differential equation for modeling nesterov\u2019s accelerated gradient method: theory and insights","volume":"17","author":"Su","year":"2016","journal-title":"J Mach Learn Res"},{"key":"10.1016\/j.cnsns.2026.109818_bib0012","doi-asserted-by":"crossref","first-page":"7351","DOI":"10.1073\/pnas.1614734113","article-title":"A variational perspective on accelerated methods in optimization","volume":"113","author":"Wibisono","year":"2016","journal-title":"Proc Natl Acad Sci"},{"key":"10.1016\/j.cnsns.2026.109818_bib0013","series-title":"Accelerated forward-backward algorithms with subgradient corrections","first-page":"121","volume":"93","author":"He","year":"2026"},{"key":"10.1016\/j.cnsns.2026.109818_bib0014","doi-asserted-by":"crossref","first-page":"428","DOI":"10.1007\/s10915-012-9592-9","article-title":"Accelerated linearized bregman method","volume":"54","author":"Huang","year":"2014","journal-title":"J Sci Comput"},{"key":"10.1016\/j.cnsns.2026.109818_bib0015","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/s10589-015-9742-8","article-title":"Inexact accelerated augmented lagrangian methods","volume":"62","author":"Kang","year":"2015","journal-title":"Comput Optim Appl"},{"key":"10.1016\/j.cnsns.2026.109818_bib0016","doi-asserted-by":"crossref","first-page":"1821","DOI":"10.1090\/mcom\/3145","article-title":"Accelerated uzawa methods for convex optimization","volume":"86","author":"Tao","year":"2017","journal-title":"Math Comput"},{"key":"10.1016\/j.cnsns.2026.109818_bib0017","doi-asserted-by":"crossref","first-page":"1459","DOI":"10.1137\/16M1082305","article-title":"Accelerated first-order primal-dual proximal methods for linearly constrained composite convex programming","volume":"27","author":"Xu","year":"2017","journal-title":"SIAM J Optim"},{"key":"10.1016\/j.cnsns.2026.109818_bib0018","doi-asserted-by":"crossref","first-page":"1669","DOI":"10.1007\/s11075-021-01246-y","article-title":"Inertial accelerated primal-dual methods for linear equality constrained convex optimization problems","volume":"90","author":"He","year":"2022","journal-title":"Numer Algorithms"},{"key":"10.1016\/j.cnsns.2026.109818_bib0019","doi-asserted-by":"crossref","first-page":"3278","DOI":"10.1137\/20M1355379","article-title":"Convergence rates of inertial primal-dual dynamical methods for separable convex optimization problems","volume":"59","author":"He","year":"2021","journal-title":"SIAM J Contr Optim"},{"key":"10.1016\/j.cnsns.2026.109818_bib0020","doi-asserted-by":"crossref","DOI":"10.1016\/j.automatica.2022.110547","article-title":"Fast primal-dual algorithm via dynamical system for a linearly constrained convex optimization problem","volume":"146","author":"He","year":"2022","journal-title":"Automatica"},{"key":"10.1016\/j.cnsns.2026.109818_bib0021","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1080\/02331934.2023.2253813","article-title":"Convergence rates of mixed primal-dual dynamical systems with Hessian driven damping","volume":"74","author":"He","year":"2025","journal-title":"Optimizaiton"},{"key":"10.1016\/j.cnsns.2026.109818_bib0022","unstructured":"Luo H.. Accelerated primal-dual methods for linearly constrained convex optimization problems. ed.; 2021. arxiv: 2109.12604."},{"key":"10.1016\/j.cnsns.2026.109818_bib0023","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1051\/cocv\/2022032","article-title":"A primal-dual flow for affine constrained convex optimization","volume":"28","author":"Luo","year":"2022","journal-title":"ESAIM Contr Optim Calc Var"},{"key":"10.1016\/j.cnsns.2026.109818_bib0024","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/s10107-022-01879-4","article-title":"Fast augmented lagrangian method in the convex regime with convergence guarantees for the iterates","volume":"200","author":"Bo\u0163","year":"2023","journal-title":"Math Program"},{"key":"10.1016\/j.cnsns.2026.109818_bib0025","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/j.apnum.2024.05.021","article-title":"Accelerated primal-dual methods with adaptive parameters for composite convex optimization with linear constraints","volume":"203","author":"He","year":"2024","journal-title":"Appl Numer Math"},{"key":"10.1016\/j.cnsns.2026.109818_bib0026","doi-asserted-by":"crossref","DOI":"10.1016\/j.cnsns.2024.108289","article-title":"Non-ergodic convergence rate of an inertial accelerated primal-dual algorithm for saddle point problems","volume":"140","author":"He","year":"2025","journal-title":"Commun Nonlinear Sci Numer Simul"},{"key":"10.1016\/j.cnsns.2026.109818_bib0027","doi-asserted-by":"crossref","first-page":"204","DOI":"10.1137\/20M1375358","article-title":"Faster lagrangian-based methods in convex optimization","volume":"32","author":"Sabach","year":"2022","journal-title":"SIAM J Optim"},{"key":"10.1016\/j.cnsns.2026.109818_bib0028","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/s10107-019-01425-9","article-title":"Iteration complexity of inexact augmented lagrangian methods for constrained convex programming","volume":"185","author":"Xu","year":"2021","journal-title":"Math Program"},{"key":"10.1016\/j.cnsns.2026.109818_bib0029","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1016\/j.cam.2017.09.021","article-title":"A novel method for a class of structured low-rank minimizations with equality constraint","volume":"330","author":"Bai","year":"2018","journal-title":"J Comput Appl Math"},{"issue":"2","key":"10.1016\/j.cnsns.2026.109818_bib0030","doi-asserted-by":"crossref","first-page":"632","DOI":"10.1287\/moor.2018.0939","article-title":"On the nonergodic convergence rate of an inexact augmented lagrangian framework for composite convex programming","volume":"44","author":"Liu","year":"2019","journal-title":"Math Oper Res"},{"key":"10.1016\/j.cnsns.2026.109818_bib0031","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/0898-1221(76)90003-1","article-title":"A dual algorithm for the solution of nonlinear variational problems via finite element approximations","volume":"2","author":"Gabay","year":"1976","journal-title":"Comput Math Appl"},{"key":"10.1016\/j.cnsns.2026.109818_bib0032","doi-asserted-by":"crossref","first-page":"2239","DOI":"10.1137\/15100463X","article-title":"Inertial proximal admm for linearly constrained separable convex optimization","volume":"8","author":"Chen","year":"2015","journal-title":"SIAM J Imaging Sci"},{"key":"10.1016\/j.cnsns.2026.109818_bib0033","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1007\/s10107-012-0530-2","article-title":"Fast alternating linearization methods for minimizing the sum of two convex functions","volume":"141","author":"Goldfarb","year":"2013","journal-title":"Math Program"},{"key":"10.1016\/j.cnsns.2026.109818_bib0034","doi-asserted-by":"crossref","first-page":"644","DOI":"10.1137\/14095697X","article-title":"An accelerated linearized alternating direction method of multipliers","volume":"8","author":"Ouyang","year":"2015","journal-title":"SIAM J Imaging Sci"},{"key":"10.1016\/j.cnsns.2026.109818_bib0035","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1007\/s10589-021-00338-8","article-title":"An inexact accelerated stochastic admm for separable convex optimization","volume":"81","author":"Bai","year":"2022","journal-title":"Comput Optim Appl"},{"key":"10.1016\/j.cnsns.2026.109818_bib0036","doi-asserted-by":"crossref","first-page":"2355","DOI":"10.1109\/TAC.2019.2953209","article-title":"I-ADMM: a stochastic inexact admm framework for stochastic convex programs","volume":"65","author":"Xie","year":"2020","journal-title":"IEEE Trans Autom Contr"},{"issue":"1","key":"10.1016\/j.cnsns.2026.109818_bib0037","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/s10589-017-9971-0","article-title":"Generalized symmetric admm for separable convex optimization","volume":"70","author":"Bai","year":"2018","journal-title":"Comput Optim Appl"},{"key":"10.1016\/j.cnsns.2026.109818_bib0038","doi-asserted-by":"crossref","first-page":"783","DOI":"10.1287\/moor.2016.0827","article-title":"Faster convergence rates of relaxed peaceman-rachford and admm under regularity assumptions","volume":"42","author":"Davis","year":"2017","journal-title":"Math Oper Res"},{"key":"10.1016\/j.cnsns.2026.109818_bib0039","doi-asserted-by":"crossref","first-page":"700","DOI":"10.1137\/110836936","article-title":"On the o(1\/n) convergence rate of the douglas-rachford alternating direction method","volume":"50","author":"He","year":"2012","journal-title":"SIAM J Numer Anal"},{"key":"10.1016\/j.cnsns.2026.109818_bib0040","doi-asserted-by":"crossref","first-page":"567","DOI":"10.1007\/s00211-014-0673-6","article-title":"On non-ergodic convergence rate of douglas-rachford alternating direction method of multipliers","volume":"130","author":"He","year":"2015","journal-title":"Numer Math"},{"key":"10.1016\/j.cnsns.2026.109818_bib0041","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1007\/s10915-018-0893-5","article-title":"Accelerated alternating direction method of multipliers: an optimal o(1\/k) nonergodic analysis","volume":"79","author":"Li","year":"2019","journal-title":"J Sci Comput"},{"key":"10.1016\/j.cnsns.2026.109818_bib0042","doi-asserted-by":"crossref","first-page":"1685","DOI":"10.1090\/mcom\/3388","article-title":"An alternating direction method of multipliers with a worst-case o(1\/n2) convergence rate","volume":"88","author":"Tian","year":"2019","journal-title":"Math Comput"},{"key":"10.1016\/j.cnsns.2026.109818_bib0043","doi-asserted-by":"crossref","first-page":"2866","DOI":"10.1137\/19M1293855","article-title":"Non-stationary first-order primal-dual algorithms with fast convergence rates","volume":"30","author":"Tran-Dinh","year":"2020","journal-title":"SIAM J Optim"},{"key":"10.1016\/j.cnsns.2026.109818_bib0044","unstructured":"Zhang T., Xia Y., Li S.. Lagrangian-based methods in convex optimization: Prediction-correction frameworks with non-ergodic convergence rates. arxiv: 2304.02459 ed.; 2023."},{"key":"10.1016\/j.cnsns.2026.109818_bib0045","doi-asserted-by":"crossref","first-page":"3009","DOI":"10.1090\/mcom\/4063","article-title":"A unified differential equation solver approach for separable convex optimization: splitting, acceleration and nonergodic rate","volume":"94","author":"Luo","year":"2025","journal-title":"Math Comput"},{"key":"10.1016\/j.cnsns.2026.109818_bib0046","doi-asserted-by":"crossref","first-page":"968","DOI":"10.1007\/s10957-015-0746-4","article-title":"On the convergence of the iterates of the fast iterative shrinkage\/thresholding algorithm","volume":"166","author":"Chambolle","year":"2016","journal-title":"J Optim Theory Appl"},{"key":"10.1016\/j.cnsns.2026.109818_bib0047","doi-asserted-by":"crossref","first-page":"849","DOI":"10.1137\/17M1114739","article-title":"Convergence rates of inertial forward-backward algorithms","volume":"28","author":"Attouch","year":"2018","journal-title":"SIAM J Optim"}],"container-title":["Communications in Nonlinear Science and Numerical Simulation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1007570426001796?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1007570426001796?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T10:05:28Z","timestamp":1778580328000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1007570426001796"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7]]},"references-count":47,"alternative-id":["S1007570426001796"],"URL":"https:\/\/doi.org\/10.1016\/j.cnsns.2026.109818","relation":{},"ISSN":["1007-5704"],"issn-type":[{"value":"1007-5704","type":"print"}],"subject":[],"published":{"date-parts":[[2026,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Accelerated linearized alternating direction method of multipliers with Nesterov extrapolation","name":"articletitle","label":"Article Title"},{"value":"Communications in Nonlinear Science and Numerical Simulation","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.cnsns.2026.109818","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"109818"}}