{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,3]],"date-time":"2026-07-03T07:17:55Z","timestamp":1783063075402,"version":"3.54.6"},"reference-count":48,"publisher":"Elsevier BV","issue":"8","license":[{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["U24B20177"],"award-info":[{"award-number":["U24B20177"]}],"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":["42471441"],"award-info":[{"award-number":["42471441"]}],"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":["U22B2038"],"award-info":[{"award-number":["U22B2038"]}],"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":["62376015"],"award-info":[{"award-number":["62376015"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of the Franklin Institute"],"published-print":{"date-parts":[[2026,5]]},"DOI":"10.1016\/j.jfranklin.2026.108688","type":"journal-article","created":{"date-parts":[[2026,4,24]],"date-time":"2026-04-24T15:40:49Z","timestamp":1777045249000},"page":"108688","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"title":["Resilient distributed online nonconvex optimization algorithm against randomly corrupted attacks"],"prefix":"10.1016","volume":"363","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4896-0006","authenticated-orcid":false,"given":"Wei","family":"Suo","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9130-5736","authenticated-orcid":false,"given":"Wenling","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jia","family":"Song","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xiaoming","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.jfranklin.2026.108688_bib0001","doi-asserted-by":"crossref","DOI":"10.1016\/j.jfranklin.2024.107405","article-title":"Linear convergence for distributed stochastic optimization with coupled inequality constraints","volume":"362","author":"Du","year":"2025","journal-title":"J. Frankl. Inst."},{"issue":"4","key":"10.1016\/j.jfranklin.2026.108688_bib0002","doi-asserted-by":"crossref","first-page":"2738","DOI":"10.1109\/TAC.2024.3492329","article-title":"An improved distributed nesterov gradient tracking algorithm for smooth convex optimization over directed networks","volume":"70","author":"Lin","year":"2025","journal-title":"IEEE Trans. Autom. Control"},{"key":"10.1016\/j.jfranklin.2026.108688_bib0003","doi-asserted-by":"crossref","first-page":"7254","DOI":"10.1016\/j.jfranklin.2021.07.015","article-title":"Cooperative convex optimization with subgradient delays using push-sum distributed dual averaging","volume":"358","author":"Wang","year":"2021","journal-title":"J. Frankl. Inst."},{"key":"10.1016\/j.jfranklin.2026.108688_bib0004","unstructured":"M. Meng, X. Li, Y. Hong, J. Chen, L. Wang, Online game with time-varying coupled inequality constraints, (2023), 10.48550\/arXiv.2306.15954."},{"key":"10.1016\/j.jfranklin.2026.108688_bib0005","doi-asserted-by":"crossref","first-page":"11736","DOI":"10.1016\/j.jfranklin.2023.09.001","article-title":"Distributed online bandit linear regressions with differential privacy","volume":"360","author":"Dai","year":"2023","journal-title":"J. Frankl. Inst."},{"key":"10.1016\/j.jfranklin.2026.108688_bib0006","doi-asserted-by":"crossref","first-page":"731","DOI":"10.1109\/TSP.2020.2964200","article-title":"Distributed online convex optimization with time-varying coupled inequality constraints","volume":"68","author":"Yi","year":"2020","journal-title":"IEEE Trans. Signal Process."},{"key":"10.1016\/j.jfranklin.2026.108688_bib0007","article-title":"Distributed algorithm over time-varying unbalanced graphs for optimization problem subject to multiple local constraints","author":"Liu","year":"2024","journal-title":"IEEE Trans. Control Netw. Syst."},{"key":"10.1016\/j.jfranklin.2026.108688_bib0008","doi-asserted-by":"crossref","first-page":"4047","DOI":"10.1109\/TSP.2022.3194369","article-title":"Distributed online optimization in time-varying unbalanced networks without explicit subgradients","volume":"70","author":"Xiong","year":"2022","journal-title":"IEEE Trans. Signal Process."},{"issue":"10","key":"10.1016\/j.jfranklin.2026.108688_bib0009","doi-asserted-by":"crossref","first-page":"4620","DOI":"10.1109\/TAC.2020.3030883","article-title":"Distributed bandit online convex optimization with time-varying coupled inequality constraints","volume":"66","author":"Yi","year":"2021","journal-title":"IEEE Trans. Autom. Control"},{"key":"10.1016\/j.jfranklin.2026.108688_bib0010","unstructured":"M. Meng, X. Li, Y. Hong, J. Chen, L. Wang, Decentralized online learning for noncooperative games in dynamic environments (2021). 10.48550\/arXiv.2105.06200."},{"key":"10.1016\/j.jfranklin.2026.108688_bib0011","doi-asserted-by":"crossref","first-page":"1379","DOI":"10.1109\/TSP.2025.3549591","article-title":"Online federated reproduced gradient descent with time-varying global optima","volume":"73","author":"Lin","year":"2025","journal-title":"IEEE Trans. Signal Process."},{"issue":"8","key":"10.1016\/j.jfranklin.2026.108688_bib0012","doi-asserted-by":"crossref","first-page":"4322","DOI":"10.1109\/TAC.2021.3115430","article-title":"Distributed global optimization for a class of nonconvex optimization with coupled constraints","volume":"67","author":"Ren","year":"2022","journal-title":"IEEE Trans. Autom. Control"},{"key":"10.1016\/j.jfranklin.2026.108688_bib0013","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1109\/TSP.2023.3239799","article-title":"A decentralized primal-dual framework for non-convex smooth consensus optimization","volume":"71","author":"Mancino","year":"2023","journal-title":"IEEE Trans. Signal Process."},{"key":"10.1016\/j.jfranklin.2026.108688_bib0014","unstructured":"J. Zhang, W. Pu, Z. Luo, On the iteration complexity of smoothed proximal alm for nonconvex optimization problem with convex constraints, (2022), 10.48550\/arXiv.2207.06304."},{"key":"10.1016\/j.jfranklin.2026.108688_bib0015","doi-asserted-by":"crossref","unstructured":"Z. Jiang, A. Balu, X.Y. Lee, Y.M. Lee, C. Hegde, S. Sarkar, Distributed online non-convex optimization with composite regret, (2022), 10.48550\/arXiv.2209.10105.","DOI":"10.1109\/Allerton49937.2022.9929356"},{"issue":"6","key":"10.1016\/j.jfranklin.2026.108688_bib0016","doi-asserted-by":"crossref","first-page":"3029","DOI":"10.1109\/TAC.2021.3091096","article-title":"Online distributed optimization with nonconvex objective functions: sublinearity of first-order optimality condition-based regret","volume":"67","author":"Lu","year":"2022","journal-title":"IEEE Trans. Autom. Control"},{"issue":"11","key":"10.1016\/j.jfranklin.2026.108688_bib0017","doi-asserted-by":"crossref","first-page":"6509","DOI":"10.1109\/TAC.2023.3239432","article-title":"Online distributed optimization with nonconvex objective functions via dynamic regrets","volume":"68","author":"Lu","year":"2023","journal-title":"IEEE Trans. Autom. Control"},{"issue":"9","key":"10.1016\/j.jfranklin.2026.108688_bib0018","doi-asserted-by":"crossref","first-page":"5477","DOI":"10.1109\/TAC.2022.3225515","article-title":"Communication compression for distributed nonconvex optimization","volume":"68","author":"Yi","year":"2023","journal-title":"IEEE Trans. Autom. Control"},{"issue":"4","key":"10.1016\/j.jfranklin.2026.108688_bib0019","doi-asserted-by":"crossref","first-page":"2189","DOI":"10.1109\/TAC.2023.3327319","article-title":"Convergence in high probability of distributed stochastic gradient descent algorithms","volume":"69","author":"Lu","year":"2024","journal-title":"IEEE Trans. Autom. Control"},{"issue":"5","key":"10.1016\/j.jfranklin.2026.108688_bib0020","doi-asserted-by":"crossref","first-page":"4241","DOI":"10.1109\/TNSE.2024.3409061","article-title":"Online distributed optimization with nonconvex objective functions under unbalanced digraphs: dynamic regret analysis","volume":"11","author":"Qin","year":"2024","journal-title":"IEEE Trans. Netw. Sci. Eng."},{"key":"10.1016\/j.jfranklin.2026.108688_bib0021","unstructured":"C. Liu, N. Bastianello, W. Huo, Y. Shi, K.H. Johansson, A survey on secure decentralized optimization and learning, (2024), 10.48550\/arXiv.2408.08628."},{"key":"10.1016\/j.jfranklin.2026.108688_bib0022","doi-asserted-by":"crossref","first-page":"1802","DOI":"10.1109\/TSP.2023.3277211","article-title":"Secure distributed optimization under gradient attacks","volume":"71","author":"Yu","year":"2023","journal-title":"IEEE Trans. Signal Process."},{"key":"10.1016\/j.jfranklin.2026.108688_bib0023","doi-asserted-by":"crossref","first-page":"9096","DOI":"10.1016\/j.jfranklin.2022.08.031","article-title":"A resilient distributed optimization algorithm based on consensus of multi-agent system against two attack scenarios","volume":"360","author":"Xu","year":"2023","journal-title":"J. Frankl. Inst."},{"key":"10.1016\/j.jfranklin.2026.108688_bib0024","doi-asserted-by":"crossref","first-page":"4997","DOI":"10.1016\/j.jfranklin.2022.04.039","article-title":"Multi-armed bandit based distributed resilient consensus and its applications in social networks","volume":"359","author":"Hou","year":"2022","journal-title":"J. Frankl. Inst."},{"key":"10.1016\/j.jfranklin.2026.108688_bib0025","doi-asserted-by":"crossref","first-page":"4711","DOI":"10.1109\/TSP.2022.3209010","article-title":"Byzantine-resilient resource allocation over decentralized networks","volume":"70","author":"Wang","year":"2022","journal-title":"IEEE Trans. Signal Process."},{"key":"10.1016\/j.jfranklin.2026.108688_bib0026","doi-asserted-by":"crossref","DOI":"10.1016\/j.sigpro.2022.108501","article-title":"Stochastic alternating direction method of multipliers for Byzantine-robust distributed learning","volume":"195","author":"Lin","year":"2022","journal-title":"Signal Process."},{"key":"10.1016\/j.jfranklin.2026.108688_bib0027","doi-asserted-by":"crossref","DOI":"10.1016\/j.sigpro.2021.108020","article-title":"Byzantine-robust decentralized stochastic optimization over static and time-varying networks","volume":"183","author":"Peng","year":"2021","journal-title":"Signal Process."},{"key":"10.1016\/j.jfranklin.2026.108688_bib0028","doi-asserted-by":"crossref","DOI":"10.1016\/j.sigpro.2024.109419","article-title":"Byzantine-robust decentralized stochastic optimization with stochastic gradient noise-independent learning error","volume":"219","author":"Peng","year":"2024","journal-title":"Signal Process."},{"key":"10.1016\/j.jfranklin.2026.108688_bib0029","doi-asserted-by":"crossref","first-page":"3484","DOI":"10.1109\/TSP.2022.3185885","article-title":"Robust distributed optimization with randomly corrupted gradients","volume":"70","author":"Turan","year":"2022","journal-title":"IEEE Trans. Signal Process."},{"key":"10.1016\/j.jfranklin.2026.108688_bib0030","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1109\/TSP.2023.3340028","article-title":"Byzantine-robust distributed online learning: taming adversarial participants in an adversarial environment","volume":"72","author":"Dong","year":"2024","journal-title":"IEEE Trans. Signal Process."},{"key":"10.1016\/j.jfranklin.2026.108688_bib0031","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1109\/TICPS.2024.3410846","article-title":"Byzantine-resilient distributed bandit online optimization in dynamic environments","volume":"2","author":"Wei","year":"2024","journal-title":"IEEE Trans. Ind. Cyber Phys. Syst."},{"key":"10.1016\/j.jfranklin.2026.108688_bib0032","doi-asserted-by":"crossref","first-page":"2160","DOI":"10.1109\/TSP.2024.3392361","article-title":"Online optimization under randomly corrupted attacks","volume":"72","author":"Qu","year":"2024","journal-title":"IEEE Trans. Signal Process."},{"issue":"121","key":"10.1016\/j.jfranklin.2026.108688_bib0033","first-page":"1","article-title":"Online mirror descent and dual averaging: keeping pace in the dynamic case","volume":"23","author":"Huang","year":"2022","journal-title":"J. Mach. Learn. Res."},{"issue":"3","key":"10.1016\/j.jfranklin.2026.108688_bib0034","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"},{"issue":"8","key":"10.1016\/j.jfranklin.2026.108688_bib0035","doi-asserted-by":"crossref","first-page":"4650","DOI":"10.1109\/TAC.2022.3209951","article-title":"Decentralized composite optimization in stochastic networks: a dual averaging approach with linear convergence","volume":"68","author":"Liu","year":"2023","journal-title":"IEEE Trans. Autom. Control"},{"key":"10.1016\/j.jfranklin.2026.108688_bib0036","article-title":"Zeroth-order decentralized dual averaging for online optimization with privacy consideration","author":"Zhang","year":"2024","journal-title":"IEEE Trans. Emerg. Top. Comput. Intell."},{"issue":"5","key":"10.1016\/j.jfranklin.2026.108688_bib0037","doi-asserted-by":"crossref","first-page":"2485","DOI":"10.1002\/rnc.5635","article-title":"Differentially private distributed online learning over time-varying digraphs via dual averaging","volume":"32","author":"Han","year":"2022","journal-title":"Int. J. Robust Nonlinear Control"},{"issue":"4","key":"10.1016\/j.jfranklin.2026.108688_bib0038","doi-asserted-by":"crossref","first-page":"2125","DOI":"10.1109\/TAC.2022.3173062","article-title":"Accelerated dual averaging methods for decentralized constrained optimization","volume":"68","author":"Liu","year":"2023","journal-title":"IEEE Trans. Autom. Control"},{"key":"10.1016\/j.jfranklin.2026.108688_bib0039","series-title":"22nd IFAC World Congress","first-page":"5209","article-title":"Rate analysis of dual averaging for nonconvex distributed optimization","volume":"56","author":"Liu","year":"2023"},{"key":"10.1016\/j.jfranklin.2026.108688_bib0040","doi-asserted-by":"crossref","DOI":"10.1016\/j.sigpro.2024.109827","article-title":"Distributed online constrained nonconvex optimization in dynamic environments over directed graphs","volume":"230","author":"Suo","year":"2025","journal-title":"Signal Process."},{"issue":"2","key":"10.1016\/j.jfranklin.2026.108688_bib0041","first-page":"394","article-title":"Penalty function-based distributed primal-dual algorithm for nonconvex optimization problem","volume":"12","author":"Shi","year":"2025","journal-title":"IEEE Trans. Autom. Control"},{"key":"10.1016\/j.jfranklin.2026.108688_bib0042","doi-asserted-by":"crossref","DOI":"10.1109\/TSMC.2024.3458972","article-title":"An event-based delayed projection row-stochastic method for distributed constrained optimization over time-varying graphs","author":"Xing","year":"2024","journal-title":"IEEE Trans. Syst. Man Cybern.: Syst."},{"issue":"11","key":"10.1016\/j.jfranklin.2026.108688_bib0043","doi-asserted-by":"crossref","first-page":"4554","DOI":"10.1109\/TAC.2019.2960265","article-title":"A proximal diffusion strategy for multiagent optimization with sparse affine constraints","volume":"65","author":"Alghunaim","year":"2020","journal-title":"IEEE Trans. Autom. Control"},{"issue":"13","key":"10.1016\/j.jfranklin.2026.108688_bib0044","doi-asserted-by":"crossref","first-page":"7548","DOI":"10.1016\/j.jfranklin.2019.06.026","article-title":"An adaptive online learning algorithm for distributed convex optimization with coupled constraints over unbalanced directed graphs","volume":"356","author":"Gu","year":"2019","journal-title":"J. Frankl. Inst."},{"issue":"8","key":"10.1016\/j.jfranklin.2026.108688_bib0045","doi-asserted-by":"crossref","first-page":"3575","DOI":"10.1109\/TAC.2020.3021011","article-title":"Distributed online optimization for multi-agent networks with coupled inequality constraints","volume":"66","author":"Li","year":"2021","journal-title":"IEEE Trans. Autom. Control"},{"issue":"12","key":"10.1016\/j.jfranklin.2026.108688_bib0046","doi-asserted-by":"crossref","first-page":"8835","DOI":"10.1109\/TSMC.2025.3613348","article-title":"Distributed online convex optimization over time-varying unbalanced digraphs with multiple coupled constraints","volume":"50","author":"Suo","year":"2025","journal-title":"IEEE Trans. Syst. Man Cybern.: Syst."},{"issue":"3","key":"10.1016\/j.jfranklin.2026.108688_bib0047","doi-asserted-by":"crossref","first-page":"1420","DOI":"10.1109\/TSMC.2022.3200680","article-title":"Push-sum distributed dual averaging for convex optimization in multiagent systems with communication delays","volume":"53","author":"Wang","year":"2023","journal-title":"IEEE Trans. Syst. Man Cybern.: Syst."},{"issue":"10","key":"10.1016\/j.jfranklin.2026.108688_bib0048","doi-asserted-by":"crossref","first-page":"6258","DOI":"10.1109\/TSMC.2019.2960770","article-title":"A Nesterov-like gradient tracking algorithm for distributed optimization over directed networks","volume":"51","author":"Lv","year":"2021","journal-title":"IEEE Trans. Syst. Man Cybern.: Syst."}],"container-title":["Journal of the Franklin Institute"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0016003226002887?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0016003226002887?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,7,3]],"date-time":"2026-07-03T06:44:13Z","timestamp":1783061053000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0016003226002887"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5]]},"references-count":48,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2026,5]]}},"alternative-id":["S0016003226002887"],"URL":"https:\/\/doi.org\/10.1016\/j.jfranklin.2026.108688","relation":{},"ISSN":["0016-0032"],"issn-type":[{"value":"0016-0032","type":"print"}],"subject":[],"published":{"date-parts":[[2026,5]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Resilient distributed online nonconvex optimization algorithm against randomly corrupted attacks","name":"articletitle","label":"Article Title"},{"value":"Journal of the Franklin Institute","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.jfranklin.2026.108688","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 The Franklin Institute. Published by Elsevier Inc. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"108688"}}