{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,12]],"date-time":"2026-08-12T23:29:47Z","timestamp":1786577387515,"version":"build-2736575974"},"reference-count":24,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100005230","name":"Chongqing Natural Science Foundation","doi-asserted-by":"publisher","award":["CSTB2025NSCQ-GPX0814"],"award-info":[{"award-number":["CSTB2025NSCQ-GPX0814"]}],"id":[{"id":"10.13039\/501100005230","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004500","name":"Chongqing Technology and Business University","doi-asserted-by":"publisher","award":["2656003"],"award-info":[{"award-number":["2656003"]}],"id":[{"id":"10.13039\/501100004500","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,11]]},"DOI":"10.1016\/j.cnsns.2026.110573","type":"journal-article","created":{"date-parts":[[2026,7,18]],"date-time":"2026-07-18T06:32:02Z","timestamp":1784356322000},"page":"110573","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"P2","title":["Dual averaging algorithm with memory mechanism for nonsmooth optimization problems"],"prefix":"10.1016","volume":"163","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4086-0040","authenticated-orcid":false,"given":"Yan","family":"Tang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-3850-9945","authenticated-orcid":false,"given":"Jinming","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.cnsns.2026.110573_bib0001","series-title":"Proceedings of the sixteenth annual ACM symposium on theory of computing","first-page":"302","article-title":"A new polynomial-time algorithm for linear programming","author":"Karmarkar","year":"1984"},{"issue":"1","key":"10.1016\/j.cnsns.2026.110573_bib0002","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/s10107-004-0552-5","article-title":"Smooth minimization of non-smooth functions","volume":"103","author":"Nesterov","year":"2005","journal-title":"Math Program"},{"key":"10.1016\/j.cnsns.2026.110573_bib0003","first-page":"154","article-title":"R\u00e9gularisation d\u2019in\u00e9quations variationnelles par approximations successives","volume":"4","author":"Martinet","year":"1970","journal-title":"Rev Fr Inform Rech Op\u00e9r"},{"issue":"4","key":"10.1016\/j.cnsns.2026.110573_bib0004","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01071403","article-title":"Methods of solution of nonlinear extremal problems","volume":"2","author":"Ermol\u2019ev","year":"1966","journal-title":"Cybern Syst Anal"},{"key":"10.1016\/j.cnsns.2026.110573_bib0005","first-page":"593","article-title":"A general method of solving extremum problems","volume":"8","author":"Polyak","year":"1967","journal-title":"Sov Math Dokl"},{"issue":"1","key":"10.1016\/j.cnsns.2026.110573_bib0006","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/s10107-007-0149-x","article-title":"Primal-dual subgradient methods for convex problems","volume":"120","author":"Nesterov","year":"2009","journal-title":"Math Program"},{"key":"10.1016\/j.cnsns.2026.110573_bib0007","series-title":"Proceedings of the 40th international conference on machine learning","first-page":"7449","article-title":"Learning-rate-free learning by D-adaptation","author":"Defazio","year":"2023"},{"key":"10.1016\/j.cnsns.2026.110573_bib0008","series-title":"Proceedings of the 41st international conference on machine learning","first-page":"35779","article-title":"Prodigy: an expeditiously adaptive parameter-free learner","author":"Mishchenko","year":"2024"},{"key":"10.1016\/j.cnsns.2026.110573_bib0009","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/s10994-007-5016-8","article-title":"Logarithmic regret algorithms for online convex optimization","volume":"69","author":"Hazan","year":"2007","journal-title":"Mach Learn"},{"key":"10.1016\/j.cnsns.2026.110573_bib0010","doi-asserted-by":"crossref","first-page":"793","DOI":"10.1007\/s10107-022-01850-3","article-title":"Unifying mirror descent and dual averaging","volume":"199","author":"Juditsky","year":"2023","journal-title":"Math Program"},{"issue":"3","key":"10.1016\/j.cnsns.2026.110573_bib0011","doi-asserted-by":"crossref","first-page":"592","DOI":"10.1109\/TAC.2011.2161027","article-title":"Dual averaging for distributed optimization: convergence analysis and network scaling","volume":"57","author":"Duchi","year":"2012","journal-title":"IEEE Trans Autom Control"},{"key":"10.1016\/j.cnsns.2026.110573_bib0012","first-page":"2543","article-title":"Dual averaging methods for regularized stochastic learning and online optimization","volume":"11","author":"Xiao","year":"2010","journal-title":"J Mach Learn Res"},{"issue":"144","key":"10.1016\/j.cnsns.2026.110573_bib0013","first-page":"1","article-title":"A momentumized, adaptive, dual averaged gradient method","volume":"23","author":"Defazio","year":"2022","journal-title":"J Mach Learn Res"},{"key":"10.1016\/j.cnsns.2026.110573_bib0014","doi-asserted-by":"crossref","DOI":"10.1016\/j.knosys.2024.112886","article-title":"DMAdam: dual averaging enhanced adaptive gradient method for deep neural networks","volume":"309","author":"Jiang","year":"2025","journal-title":"Knowl-Based Syst"},{"issue":"343","key":"10.1016\/j.cnsns.2026.110573_bib0015","first-page":"1","article-title":"Accelerated primal-dual mirror dynamics for centralized and distributed constrained convex optimization problems","volume":"24","author":"Zhao","year":"2023","journal-title":"J Mach Learn Res"},{"issue":"6","key":"10.1016\/j.cnsns.2026.110573_bib0016","doi-asserted-by":"crossref","first-page":"1485","DOI":"10.1109\/JAS.2024.124380","article-title":"Accelerated primal-dual projection neurodynamic approach with time scaling for linear and set constrained convex optimization problems","volume":"11","author":"Zhao","year":"2024","journal-title":"IEEE\/CAA J Autom Sin"},{"key":"10.1016\/j.cnsns.2026.110573_bib0017","series-title":"Proceedings of the 40th international conference on machine learning","first-page":"14465","article-title":"DoG Is SGD\u2019s best friend: a parameter-free dynamic step size schedule","author":"Ivgi","year":"2023"},{"key":"10.1016\/j.cnsns.2026.110573_bib0018","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1090\/mcom\/3851","article-title":"Convergence analysis of the Halpern iteration with adaptive anchoring parameters","volume":"93","author":"He","year":"2024","journal-title":"Math Comp"},{"key":"10.1016\/j.cnsns.2026.110573_bib0019","first-page":"2121","article-title":"Adaptive subgradient methods for online learning and stochastic optimization","volume":"12","author":"Duchi","year":"2011","journal-title":"J Mach Learn Res"},{"issue":"2","key":"10.1016\/j.cnsns.2026.110573_bib0020","doi-asserted-by":"crossref","first-page":"1473","DOI":"10.1137\/19M1256919","article-title":"On the adaptivity of stochastic gradient-based optimization","volume":"30","author":"Lei","year":"2020","journal-title":"SIAM J Optim"},{"issue":"3","key":"10.1016\/j.cnsns.2026.110573_bib0021","doi-asserted-by":"crossref","first-page":"2428","DOI":"10.1137\/21M1391699","article-title":"Scaled, inexact, and adaptive generalized FISTA for strongly convex optimization","volume":"32","author":"Rebegoldi","year":"2022","journal-title":"SIAM J Optim"},{"key":"10.1016\/j.cnsns.2026.110573_bib0022","unstructured":"Moshtaghifar M., Rodomanov A., Vankov D., Stich S.. DADA: dual averaging with distance adaptation. 2025. arXiv: 2501.10258."},{"issue":"1\u20132","key":"10.1016\/j.cnsns.2026.110573_bib0023","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1007\/s10107-014-0790-0","article-title":"Universal gradient methods for convex optimization problems","volume":"152","author":"Nesterov","year":"2015","journal-title":"Math Program"},{"issue":"2","key":"10.1016\/j.cnsns.2026.110573_bib0024","first-page":"372","article-title":"A method for solving the convex programming problem with convergence rate O(1\/k2)","volume":"27","author":"Nesterov","year":"1983","journal-title":"Sov Math Dokl"}],"container-title":["Communications in Nonlinear Science and Numerical Simulation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1007570426009275?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1007570426009275?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,8,12]],"date-time":"2026-08-12T23:24:13Z","timestamp":1786577053000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1007570426009275"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,11]]},"references-count":24,"alternative-id":["S1007570426009275"],"URL":"https:\/\/doi.org\/10.1016\/j.cnsns.2026.110573","relation":{},"ISSN":["1007-5704"],"issn-type":[{"value":"1007-5704","type":"print"}],"subject":[],"published":{"date-parts":[[2026,11]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Dual averaging algorithm with memory mechanism for nonsmooth optimization problems","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.110573","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":"110573"}}