{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,12]],"date-time":"2024-09-12T00:27:23Z","timestamp":1726100843472},"reference-count":43,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2024,12,1]],"date-time":"2024-12-01T00:00:00Z","timestamp":1733011200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2024,12,1]],"date-time":"2024-12-01T00:00:00Z","timestamp":1733011200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2024,12,1]],"date-time":"2024-12-01T00:00:00Z","timestamp":1733011200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2024,12,1]],"date-time":"2024-12-01T00:00:00Z","timestamp":1733011200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2024,12,1]],"date-time":"2024-12-01T00:00:00Z","timestamp":1733011200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2024,12,1]],"date-time":"2024-12-01T00:00:00Z","timestamp":1733011200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,12,1]],"date-time":"2024-12-01T00:00:00Z","timestamp":1733011200000},"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":["62103169"],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100016103","name":"Major Projects of Natural Sciences of University in Jiangsu Province of China","doi-asserted-by":"publisher","award":["ZR2021ZD14","RCTD-JC-2019-05"],"id":[{"id":"10.13039\/100016103","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100010012","name":"National Aerospace Science Foundation of China","doi-asserted-by":"publisher","award":["52371372","62250056","U23A20325"],"id":[{"id":"10.13039\/501100010012","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Automatica"],"published-print":{"date-parts":[[2024,12]]},"DOI":"10.1016\/j.automatica.2024.111863","type":"journal-article","created":{"date-parts":[[2024,8,24]],"date-time":"2024-08-24T13:53:13Z","timestamp":1724507593000},"page":"111863","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Online distributed nonconvex optimization with stochastic objective functions: High probability bound analysis of dynamic regrets"],"prefix":"10.1016","volume":"170","author":[{"given":"Hang","family":"Xu","sequence":"first","affiliation":[]},{"given":"Kaihong","family":"Lu","sequence":"additional","affiliation":[]},{"given":"Yu-Long","family":"Wang","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/j.automatica.2024.111863_b1","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1109\/TCNS.2015.2505149","article-title":"Distributed online convex optimization on time-varying directed graphs","volume":"4","author":"Akbari","year":"2017","journal-title":"IEEE Transactions on Control of Network Systems"},{"issue":"3","key":"10.1016\/j.automatica.2024.111863_b2","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1109\/TSIPN.2019.2902493","article-title":"Asynchronous online learning in multi-agent systems with proximity constraints","volume":"5","author":"Bedi","year":"2019","journal-title":"IEEE Transactions on Signal and Information Processing over Networks"},{"issue":"5","key":"10.1016\/j.automatica.2024.111863_b3","doi-asserted-by":"crossref","first-page":"1227","DOI":"10.1287\/opre.2015.1408","article-title":"Non-stationary stochastic optimization","volume":"63","author":"Besbes","year":"2015","journal-title":"Operations Research"},{"doi-asserted-by":"crossref","unstructured":"Blondel,\u00a0V. D., Hendrickx,\u00a0J. M., Olshevsky,\u00a0A., & Tsitsiklis,\u00a0J. N. (2005). Convergence in multiagent coordination, consensus, and flocking. In 44th IEEE conference on decision control and European control conference (pp. 12\u201315).","key":"10.1016\/j.automatica.2024.111863_b4","DOI":"10.1109\/CDC.2005.1582620"},{"issue":"8","key":"10.1016\/j.automatica.2024.111863_b5","doi-asserted-by":"crossref","first-page":"4289","DOI":"10.1109\/TSP.2012.2198470","article-title":"Diffusion adaptation strategies for distributed optimization and learning over networks","volume":"60","author":"Chen","year":"2012","journal-title":"IEEE Transactions on Signal Processing"},{"key":"10.1016\/j.automatica.2024.111863_b6","doi-asserted-by":"crossref","DOI":"10.1016\/j.automatica.2022.110492","article-title":"Distributed algorithm design for constrained resource allocation problems with high-order multi-agent systems","volume":"144","author":"Deng","year":"2022","journal-title":"Automatica"},{"key":"10.1016\/j.automatica.2024.111863_b7","doi-asserted-by":"crossref","DOI":"10.1016\/j.automatica.2021.109938","article-title":"Distributed decision-coupled constrained optimization via proximal-tracking","volume":"135","author":"Falsone","year":"2022","journal-title":"Automatica"},{"issue":"6","key":"10.1016\/j.automatica.2024.111863_b8","doi-asserted-by":"crossref","first-page":"539","DOI":"10.3166\/EJC.18.539-557","article-title":"Distributed strategies for generating weight-balanced and doubly stochastic digraphs","volume":"18","author":"Gharesifard","year":"2012","journal-title":"European Journal of Control"},{"issue":"23","key":"10.1016\/j.automatica.2024.111863_b9","doi-asserted-by":"crossref","first-page":"7649","DOI":"10.1109\/JSEN.2017.2725638","article-title":"Large-scale distributed dedicated-and non-dedicated smart city sensing systems","volume":"17","author":"Habibzadeh","year":"2017","journal-title":"IEEE Sensors Journal"},{"unstructured":"Harvey,\u00a0N. J., Liaw,\u00a0C., Plan,\u00a0Y., & Randhawa,\u00a0S. (2019). Tight analyses for nonsmooth stochastic gradient descent. In Conference on learning theory (pp. 1579\u20131613).","key":"10.1016\/j.automatica.2024.111863_b10"},{"issue":"11","key":"10.1016\/j.automatica.2024.111863_b11","doi-asserted-by":"crossref","first-page":"3545","DOI":"10.1109\/TAC.2016.2525928","article-title":"Online distributed convex optimization on dynamic networks","volume":"61","author":"Hosseini","year":"2016","journal-title":"IEEE Transactions on Automatic Control"},{"key":"10.1016\/j.automatica.2024.111863_b12","doi-asserted-by":"crossref","first-page":"932","DOI":"10.1109\/TSP.2021.3051871","article-title":"Dynamic online learning via frank-wolfe algorithm","volume":"69","author":"Kalhan","year":"2021","journal-title":"IEEE Transactions on Signal Processing"},{"unstructured":"Kasiviswanathan,\u00a0S. P., & Jin,\u00a0H. (2016). Efficient private empirical risk minimization for high-dimensional learning. In International conference on machine learning (pp. 488\u2013497).","key":"10.1016\/j.automatica.2024.111863_b13"},{"key":"10.1016\/j.automatica.2024.111863_b14","first-page":"1","article-title":"Adaptive gradient-based meta-learning methods","volume":"32","author":"Khodak","year":"2019","journal-title":"Advances in Neural Information Processing Systems"},{"issue":"19","key":"10.1016\/j.automatica.2024.111863_b15","doi-asserted-by":"crossref","first-page":"5149","DOI":"10.1109\/TSP.2015.2449255","article-title":"A saddle point algorithm for networked online convex optimization","volume":"63","author":"Koppel","year":"2015","journal-title":"IEEE Transactions on Signal Processing"},{"key":"10.1016\/j.automatica.2024.111863_b16","article-title":"Accelerated zeroth-order method for non-smooth stochastic convex optimization problem with infinite variance","volume":"36","author":"Kornilov","year":"2024","journal-title":"Advances in Neural Information Processing Systems"},{"issue":"10","key":"10.1016\/j.automatica.2024.111863_b17","doi-asserted-by":"crossref","first-page":"5630","DOI":"10.1109\/TAC.2022.3179216","article-title":"Distributed variable sample-size stochastic optimization with fixed step-sizes","volume":"67","author":"Lei","year":"2022","journal-title":"IEEE Transactions on Automatic Control"},{"issue":"8","key":"10.1016\/j.automatica.2024.111863_b18","doi-asserted-by":"crossref","first-page":"2044","DOI":"10.1109\/TCYB.2017.2681119","article-title":"Distributed consensus optimization in multiagent networks with time-varying directed topologies and quantized communication","volume":"47","author":"Li","year":"2017","journal-title":"IEEE Transactions on Cybernetics"},{"unstructured":"Li,\u00a0X., & Orabona,\u00a0F. (2019). On the convergence of stochastic gradient descent with adaptive stepsizes. In The 22nd international conference on artificial intelligence and statistics (pp. 983\u2013992).","key":"10.1016\/j.automatica.2024.111863_b19"},{"key":"10.1016\/j.automatica.2024.111863_b20","doi-asserted-by":"crossref","DOI":"10.1016\/j.arcontrol.2023.100904","article-title":"A survey on distributed online optimization and online games","volume":"56","author":"Li","year":"2023","journal-title":"Annual Reviews in Control"},{"issue":"8","key":"10.1016\/j.automatica.2024.111863_b21","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 Transactions on Automatic Control"},{"issue":"2","key":"10.1016\/j.automatica.2024.111863_b22","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1006\/jath.1994.1045","article-title":"Comparing two versions of Markov\u2019s inequality on compact sets","volume":"77","author":"Lithner","year":"1994","journal-title":"Journal of Approximation Theory"},{"issue":"1","key":"10.1016\/j.automatica.2024.111863_b23","doi-asserted-by":"crossref","first-page":"426","DOI":"10.1109\/TAC.2019.2915745","article-title":"Online distributed optimization with strongly pseudoconvex-sum cost functions","volume":"65","author":"Lu","year":"2020","journal-title":"IEEE Transactions on Automatic Control"},{"issue":"6","key":"10.1016\/j.automatica.2024.111863_b24","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 Transactions on Automatic Control"},{"issue":"11","key":"10.1016\/j.automatica.2024.111863_b25","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 Transactions on Automatic Control"},{"issue":"4","key":"10.1016\/j.automatica.2024.111863_b26","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 Transactions on Automatic Control"},{"key":"10.1016\/j.automatica.2024.111863_b27","doi-asserted-by":"crossref","DOI":"10.1016\/j.automatica.2023.111501","article-title":"Distributed strategies for mixed equilibrium problems: Continuous-time theoretical approaches","volume":"161","author":"Lu","year":"2024","journal-title":"Automatica"},{"key":"10.1016\/j.automatica.2024.111863_b28","doi-asserted-by":"crossref","DOI":"10.1016\/j.automatica.2023.111203","article-title":"Online distributed optimization with strongly pseudoconvex-sum cost functions and coupled inequality constraints","volume":"156","author":"Lu","year":"2023","journal-title":"Automatica"},{"issue":"4","key":"10.1016\/j.automatica.2024.111863_b29","doi-asserted-by":"crossref","first-page":"1962","DOI":"10.1109\/TCNS.2017.2776084","article-title":"Local prediction for enhanced convergence of distributed optimization algorithms","volume":"5","author":"Mai","year":"2018","journal-title":"IEEE Transactions on Control of Network Systems"},{"issue":"1","key":"10.1016\/j.automatica.2024.111863_b30","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1109\/TNSE.2014.2363554","article-title":"Distributed online convex optimization over jointly connected digraphs","volume":"1","author":"Mateos-N\u00fa\u00f1ez","year":"2014","journal-title":"IEEE Transactions on Network Science and Engineering"},{"key":"10.1016\/j.automatica.2024.111863_b31","doi-asserted-by":"crossref","first-page":"6065","DOI":"10.1109\/TSP.2022.3223214","article-title":"DAdam: A consensus-based distributed adaptive gradient method for online optimization","volume":"70","author":"Nazari","year":"2022","journal-title":"IEEE Transactions on Signal Processing"},{"issue":"1","key":"10.1016\/j.automatica.2024.111863_b32","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1109\/TAC.2008.2009515","article-title":"Distributed subgradient methods for multi-agent optimization","volume":"54","author":"Nedi\u0107","year":"2009","journal-title":"IEEE Transactions on Automatic Control"},{"issue":"4","key":"10.1016\/j.automatica.2024.111863_b33","doi-asserted-by":"crossref","first-page":"1574","DOI":"10.1137\/070704277","article-title":"Robust stochastic approximation approach to stochastic programming","volume":"19","author":"Nemirovski","year":"2009","journal-title":"SIAM Journal on optimization"},{"issue":"3","key":"10.1016\/j.automatica.2024.111863_b34","doi-asserted-by":"crossref","first-page":"714","DOI":"10.1109\/TAC.2017.2743462","article-title":"Distributed online optimization in dynamic environments using mirror descent","volume":"63","author":"Shahrampour","year":"2017","journal-title":"IEEE Transactions on Automatic Control"},{"doi-asserted-by":"crossref","unstructured":"Sharma,\u00a0P., Khanduri,\u00a0P., Shen,\u00a0L., Bucci,\u00a0D. J., & Varshney,\u00a0P. K. (2021). On Distributed Online Convex Optimization with Sublinear Dynamic Regret and Fit. In 2021 55th asilomar conference on signals, systems, and computers (pp. 1013\u20131017).","key":"10.1016\/j.automatica.2024.111863_b35","DOI":"10.1109\/IEEECONF53345.2021.9723285"},{"key":"10.1016\/j.automatica.2024.111863_b36","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 Transactions on Signal Processing"},{"key":"10.1016\/j.automatica.2024.111863_b37","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/j.automatica.2018.01.026","article-title":"Network-based modelling and dynamic output feedback control for unmanned marine vehicles in network environments","volume":"91","author":"Wang","year":"2018","journal-title":"Automatica"},{"issue":"2","key":"10.1016\/j.automatica.2024.111863_b38","doi-asserted-by":"crossref","first-page":"1069","DOI":"10.1109\/TCNS.2022.3219765","article-title":"Privacy-preserving distributed online stochastic optimization with time-varying distributions","volume":"10","author":"Wang","year":"2023","journal-title":"IEEE Transactions on Control of Network Systems"},{"issue":"1","key":"10.1016\/j.automatica.2024.111863_b39","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/j.jpdc.2006.08.010","article-title":"Distributed average consensus with least-mean-square deviation","volume":"67","author":"Xiao","year":"2007","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"10.1016\/j.automatica.2024.111863_b40","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1016\/j.automatica.2016.08.007","article-title":"Initialization-free distributed algorithms for optimal resource allocation with feasibility constraints and application to economic dispatch of power systems","volume":"74","author":"Yi","year":"2016","journal-title":"Automatica"},{"key":"10.1016\/j.automatica.2024.111863_b41","doi-asserted-by":"crossref","DOI":"10.1016\/j.automatica.2022.110590","article-title":"Distributed online bandit optimization under random quantization","volume":"146","author":"Yuan","year":"2022","journal-title":"Automatica"},{"issue":"11","key":"10.1016\/j.automatica.2024.111863_b42","doi-asserted-by":"crossref","first-page":"6899","DOI":"10.1109\/TAC.2023.3241771","article-title":"Innovation compression for communication-efficient distributed optimization with linear convergence","volume":"68","author":"Zhang","year":"2023","journal-title":"IEEE Transactions on Automatic Control"},{"issue":"4","key":"10.1016\/j.automatica.2024.111863_b43","doi-asserted-by":"crossref","first-page":"1776","DOI":"10.1109\/TCYB.2018.2883095","article-title":"Projected primal\u2013dual dynamics for distributed constrained nonsmooth convex optimization","volume":"50","author":"Zhu","year":"2020","journal-title":"IEEE Transactions on Cybernetics"}],"container-title":["Automatica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0005109824003571?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0005109824003571?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T02:17:58Z","timestamp":1726021078000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0005109824003571"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12]]},"references-count":43,"alternative-id":["S0005109824003571"],"URL":"https:\/\/doi.org\/10.1016\/j.automatica.2024.111863","relation":{},"ISSN":["0005-1098"],"issn-type":[{"type":"print","value":"0005-1098"}],"subject":[],"published":{"date-parts":[[2024,12]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Online distributed nonconvex optimization with stochastic objective functions: High probability bound analysis of dynamic regrets","name":"articletitle","label":"Article Title"},{"value":"Automatica","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.automatica.2024.111863","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2024 Elsevier Ltd. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"111863"}}