{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T01:04:43Z","timestamp":1780016683264,"version":"3.53.1"},"reference-count":35,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12071055"],"award-info":[{"award-number":["12071055"]}],"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":["12201097"],"award-info":[{"award-number":["12201097"]}],"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":["12371298"],"award-info":[{"award-number":["12371298"]}],"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":["12201097,12071055"],"award-info":[{"award-number":["12201097,12071055"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program of China","doi-asserted-by":"publisher","award":["2022YFA1004000"],"award-info":[{"award-number":["2022YFA1004000"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100015789","name":"Dalian High-Level Talent Innovation Program","doi-asserted-by":"publisher","award":["2020RD09"],"award-info":[{"award-number":["2020RD09"]}],"id":[{"id":"10.13039\/100015789","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012131","name":"Department of Science and Technology of Liaoning Province","doi-asserted-by":"publisher","award":["2025-BS-0775"],"award-info":[{"award-number":["2025-BS-0775"]}],"id":[{"id":"10.13039\/501100012131","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Computational and Applied Mathematics"],"published-print":{"date-parts":[[2026,10]]},"DOI":"10.1016\/j.cam.2026.117525","type":"journal-article","created":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T00:18:08Z","timestamp":1772842688000},"page":"117525","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Online alternating direction method of multipliers for online composite optimization"],"prefix":"10.1016","volume":"485","author":[{"ORCID":"https:\/\/orcid.org\/0009-0005-3046-3414","authenticated-orcid":false,"given":"Yule","family":"Zhang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-3113-9657","authenticated-orcid":false,"given":"Zehao","family":"Xiao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1310-3709","authenticated-orcid":false,"given":"Jia","family":"Wu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9207-5290","authenticated-orcid":false,"given":"Liwei","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/j.cam.2026.117525_bib0001","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1016\/j.jcss.2004.10.016","article-title":"Efficient algorithms for online decision problems","volume":"71","author":"Kalai","year":"2005","journal-title":"J. Comput. Syst. Sci."},{"key":"10.1016\/j.cam.2026.117525_bib0002","series-title":"Technical Report","article-title":"Online Learning: Theory, Algorithms, and Applications","author":"Shalev-Shwartz","year":"2007"},{"issue":"2-3","key":"10.1016\/j.cam.2026.117525_bib0003","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/s10994-007-5014-x","article-title":"A primal-dual perspective of online learning algorithms","volume":"69","author":"Shalev-Shwartz","year":"2007","journal-title":"Mach. Learn. J."},{"issue":"1","key":"10.1016\/j.cam.2026.117525_bib0004","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1006\/inco.1996.2612","article-title":"Exponentiated gradient versus gradient descent for linear predictors","volume":"132","author":"Kivinen","year":"1997","journal-title":"Inf. Comput."},{"key":"10.1016\/j.cam.2026.117525_bib0005","series-title":"The Perceptron, a Probabilistic Model for Information Storage Andorganizationinthebrain","volume":"65","author":"Rosenblatt","year":"1958"},{"key":"10.1016\/j.cam.2026.117525_bib0006","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1023\/A:1022869011914","article-title":"Learning quickly when irrelevant attributes abound: a new linear-threshold algorithm","volume":"2","author":"Littlestone","year":"1988","journal-title":"Mach. Learn."},{"key":"10.1016\/j.cam.2026.117525_bib0007","article-title":"Foundations of Machine Learning, The press","author":"Mohri","year":"2012"},{"key":"10.1016\/j.cam.2026.117525_bib0008","series-title":"Understanding Machine Learning,From Theory to Algorithms","author":"Shalev-Shwartz","year":"2014"},{"key":"10.1016\/j.cam.2026.117525_bib0009","series-title":"Online Learning and Online Convex Optimization, Foundations and Trends in Machine Learning","volume":"4","author":"Shalev-Shwartz","year":"2011"},{"issue":"3\u20134","key":"10.1016\/j.cam.2026.117525_bib0010","first-page":"157","article-title":"Introduction to online convex optimization","volume":"2","author":"Hazan","year":"2015","journal-title":"Found. Trends Optim."},{"key":"10.1016\/j.cam.2026.117525_bib0011","first-page":"2899","article-title":"Efficient online and batch learning using forward backward splitting","volume":"10","author":"Duchi","year":"2009","journal-title":"J. Mach. Learn. Res."},{"key":"10.1016\/j.cam.2026.117525_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."},{"key":"10.1016\/j.cam.2026.117525_bib0013","first-page":"2503","article-title":"Trading regret for efficiency: online convex optimization with long term constraints","volume":"13","author":"Mahdavi","year":"2012","journal-title":"J. Mach. Learn. Res."},{"key":"10.1016\/j.cam.2026.117525_bib0014","series-title":"International Conference on Machine Learning","first-page":"402","article-title":"Adaptive algorithms for online convex optimization with long-term constraints","author":"Jenatton","year":"2016"},{"issue":"5","key":"10.1016\/j.cam.2026.117525_bib0015","first-page":"1","article-title":"A low complexity algorithm with O(T) regret and finite constraint violations for online convex optimization with long term constraints","volume":"8","author":"Yu","year":"2020","journal-title":"J. Mach. Learn. Res."},{"key":"10.1016\/j.cam.2026.117525_bib0016","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":"3","author":"Boyd","year":"2011","journal-title":"Found. Trends Mach. Learn."},{"key":"10.1016\/j.cam.2026.117525_bib0017","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1051\/m2an\/197509R200411","article-title":"Sur l\u2019approximation, par \u00e9l\u00e9ments finis d\u2019ordre un, et la r\u00e9solution, par p\u00e9nalisation-dualit\u00e9 d\u2019une classe de probl\u00e8mes de Dirichlet non lin\u00e9aires","volume":"9","author":"Glowinski","year":"1975","journal-title":"Revue fran\u00e7aise d\u2019atomatique Informatique Recherche Op\u00e9rationelle. Analyse Num\u00e9rique"},{"key":"10.1016\/j.cam.2026.117525_bib0018","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 approximation","volume":"2","author":"Gabay","year":"1976","journal-title":"Comput. Math. Appl."},{"key":"10.1016\/j.cam.2026.117525_bib0019","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1287\/moor.1.2.97","article-title":"Augmented Lagrangians and applications of the proximal point algorithm in convex programming","volume":"1","author":"Rockafellar","year":"1976","journal-title":"Math. Oper. Res."},{"key":"10.1016\/j.cam.2026.117525_bib0020","doi-asserted-by":"crossref","first-page":"877","DOI":"10.1137\/0314056","article-title":"Monotone operators and the proximal point algorithm","volume":"14","author":"Rockafellar","year":"1976","journal-title":"SIAM J. Control Optim."},{"key":"10.1016\/j.cam.2026.117525_bib0021","doi-asserted-by":"crossref","first-page":"946","DOI":"10.1137\/110853996","article-title":"Hankel matrix rank minimization with applications to system identification and realization","volume":"34","author":"Fazel","year":"2013","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"1\u20132","key":"10.1016\/j.cam.2026.117525_bib0022","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1007\/s10107-016-1007-5","article-title":"An effcient inexact symmetric Gauss-Seidel based majorized ADMM for high-dimensional convex composite conic programming","volume":"161","author":"Chen","year":"2017","journal-title":"Math. Program"},{"key":"10.1016\/j.cam.2026.117525_bib0023","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1007\/s10107-014-0850-5","article-title":"A Schur complement based semi-proximal ADMM for convex quadratic conic programming and extensions","volume":"155","author":"Li","year":"2016","journal-title":"Math. Program"},{"key":"10.1016\/j.cam.2026.117525_bib0024","doi-asserted-by":"crossref","first-page":"882","DOI":"10.1137\/140964357","article-title":"A convergent 3-block semi-proximal alternating direction method of multipliers for conic programming with 4-type constraints","volume":"25","author":"Sun","year":"2015","journal-title":"SIAM J. Optim."},{"issue":"2","key":"10.1016\/j.cam.2026.117525_bib0025","doi-asserted-by":"crossref","first-page":"622","DOI":"10.1287\/moor.2017.0875","article-title":"Linear rate convergence of the alternating direction method of multipliers for convex composite programming","volume":"43","author":"Han","year":"2018","journal-title":"Math. Oper. Res."},{"key":"10.1016\/j.cam.2026.117525_bib0026","series-title":"Online Alternating Direction Method (Longer Version), the 29th International Conference on Machine Learning","author":"Wang","year":"2012"},{"issue":"3\u20134","key":"10.1016\/j.cam.2026.117525_bib0027","first-page":"157","article-title":"Introduction to online convex optimization","volume":"2","author":"Hosseini","year":"2015","journal-title":"Foundations and Trends in Optimization"},{"key":"10.1016\/j.cam.2026.117525_bib0028","series-title":"Zeroth-Order Online Alternating Direction Method of Multipliers: Convergence Analysis and Applications, International Conference on Artificial Intelligence and Statistics","first-page":"288","author":"Liu","year":"2018"},{"key":"10.1016\/j.cam.2026.117525_bib0029","series-title":"Wets, Variational analysis","author":"Rockafellar","year":"1998"},{"key":"10.1016\/j.cam.2026.117525_bib0030","first-page":"6175","article-title":"Safe online convex optimization with unknown linear safety constraints","volume":"36","author":"Chaudhary","year":"2022","journal-title":"Proc. AAAI Conf. Artif. Intell."},{"key":"10.1016\/j.cam.2026.117525_bib0031","unstructured":"B.B. Liu, J.D. Li, Y.Q. Liu, X.J. Liang, L. Jian, H. Huan, Online newton step algorithm with estimated gradient, Technical Report, 2018. arXiv: 1811.09955."},{"issue":"1","key":"10.1016\/j.cam.2026.117525_bib0032","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1111\/j.2517-6161.1996.tb02080.x","article-title":"Regression shrinkage and selection via the lasso","volume":"58","author":"Tibshirani","year":"1996","journal-title":"J. R. Stat. Soc. Series B"},{"issue":"1\u20134","key":"10.1016\/j.cam.2026.117525_bib0033","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1016\/0167-2789(92)90242-F","article-title":"Nonlinear total variation based noise removal algorithms","volume":"60","author":"Rudin","year":"1992","journal-title":"Phys. D Nonlinear Phen."},{"issue":"4","key":"10.1016\/j.cam.2026.117525_bib0034","doi-asserted-by":"crossref","first-page":"876","DOI":"10.1287\/opre.2014.1289","article-title":"A dynamic near-optimal algorithm for online linear programming","volume":"62","author":"Agrawal","year":"2014","journal-title":"Oper. Res."},{"key":"10.1016\/j.cam.2026.117525_bib0035","series-title":"Advances in Neural Information Processing Systems","first-page":"1427","article-title":"Online convex optimization with stochastic constraints","author":"Yu","year":"2017"}],"container-title":["Journal of Computational and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377042726001858?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377042726001858?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T00:38:48Z","timestamp":1780015128000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377042726001858"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,10]]},"references-count":35,"alternative-id":["S0377042726001858"],"URL":"https:\/\/doi.org\/10.1016\/j.cam.2026.117525","relation":{},"ISSN":["0377-0427"],"issn-type":[{"value":"0377-0427","type":"print"}],"subject":[],"published":{"date-parts":[[2026,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Online alternating direction method of multipliers for online composite optimization","name":"articletitle","label":"Article Title"},{"value":"Journal of Computational and Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.cam.2026.117525","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":"117525"}}