{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,7]],"date-time":"2026-04-07T16:13:42Z","timestamp":1775578422421,"version":"3.50.1"},"reference-count":113,"publisher":"Emerald","issue":"2-3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024,12,16]]},"abstract":"<jats:p>This monograph provides an overview of distributed online optimization in multi-agent systems. Online optimization approaches planning and decision problems from a robust learning perspective, where one learns through feedback from sequentially arriving costs, resembling a game between a learner (agent) and the environment. Recently, multi-agent systems have become important in diverse areas including smart power grids, communication networks, machine learning, and robotics, where agents work with decentralized data, costs, and decisions to collectively minimize a system-wide cost. In such settings, agents make distributed decisions and collaborate with neighboring agents through a communication network, leading to scalable solutions that often perform as well as centralized methods. The monograph offers a unified introduction, starting with fundamental algorithms for basic problems, and gradually covering state-of-the-art techniques for more complex settings. The interplay between individual agent learning rates, network structure, and communication complexity is highlighted in the overall system performance.<\/jats:p>","DOI":"10.1561\/2400000037","type":"journal-article","created":{"date-parts":[[2024,12,16]],"date-time":"2024-12-16T03:55:49Z","timestamp":1734321349000},"page":"81-263","source":"Crossref","is-referenced-by-count":5,"title":["Multi-agent Online Optimization"],"prefix":"10.1561","volume":"7","author":[{"given":"Deming","family":"Yuan","sequence":"first","affiliation":[{"name":"Nanjing University of Science and Technology ,","place":["China"]}]},{"given":"Alexandre","family":"Proutiere","sequence":"additional","affiliation":[{"name":"KTH Royal Institute of Technology ,","place":["Sweden"]}]},{"given":"Guodong","family":"Shi","sequence":"additional","affiliation":[{"name":"The University of Sydney ,","place":["Australia"]}]}],"member":"140","published-online":{"date-parts":[[2024,12,16]]},"reference":[{"key":"2026033014425697900_ref001","first-page":"28","volume-title":"Colt","author":"Agarwal","year":"2010"},{"key":"2026033014425697900_ref002","first-page":"440","article-title":"Sparse communication for distributed gradient descent","author":"Aji"},{"issue":"3","key":"2026033014425697900_ref003","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":"2015","journal-title":"IEEE Transactions on Control of Network Systems"},{"key":"2026033014425697900_ref004","doi-asserted-by":"publisher","first-page":"3149","DOI":"10.1109\/CDC45484.2021.9683412","article-title":"Distributed convex optimization with state-dependent interactions over random networks","author":"Alaviani"},{"key":"2026033014425697900_ref005","volume-title":"Advances in Neural Information Processing Systems","author":"Alistarh","year":"2017"},{"key":"2026033014425697900_ref006","first-page":"226","article-title":"Minimax fixed-design linear regression","author":"Bartlett"},{"key":"2026033014425697900_ref007","article-title":"Qsparse-local-sgd: Distributed sgd with quantization, sparsification and local computations","volume":"32","author":"Basu","year":"2019","journal-title":"Advances in Neural Information Processing Systems"},{"issue":"2","key":"2026033014425697900_ref008","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1007\/s10208-021-09513-z","article-title":"A theoretical and empirical comparison of gradient approximations in derivative-free optimization","volume":"22","author":"Berahas","year":"2022","journal-title":"Foundations of Computational Mathematics"},{"issue":"8","key":"2026033014425697900_ref009","doi-asserted-by":"publisher","first-page":"1978","DOI":"10.1109\/TSP.2019.2896112","article-title":"Online primal-dual methods with measurement feedback for time-varying convex optimization","volume":"67","author":"Bernstein","year":"2019","journal-title":"IEEE Transactions on Signal Processing"},{"key":"2026033014425697900_ref010","first-page":"560","article-title":"Signsgd: Compressed optimization for non-convex problems","author":"Bernstein"},{"issue":"6","key":"2026033014425697900_ref011","doi-asserted-by":"publisher","first-page":"2508","DOI":"10.1109\/TIT.2006.874516","article-title":"Randomized gossip algorithms","volume":"52","author":"Boyd","year":"2006","journal-title":"IEEE Transactions on Information Theory"},{"issue":"1","key":"2026033014425697900_ref012","doi-asserted-by":"publisher","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."},{"issue":"1","key":"2026033014425697900_ref013","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":"Foundations and Trends\u00ae in Machine learning"},{"key":"2026033014425697900_ref014","first-page":"1","article-title":"Introduction to online optimization","volume":"2","author":"Bubeck","year":"2011","journal-title":"Lecture notes"},{"key":"2026033014425697900_ref015","doi-asserted-by":"crossref","first-page":"33 589","DOI":"10.52202\/068431-2434","article-title":"A unifying framework for online optimization with long-term constraints","volume":"35","author":"Castiglioni","year":"2022","journal-title":"Advances in Neural Information Processing Systems"},{"issue":"3","key":"2026033014425697900_ref016","doi-asserted-by":"publisher","first-page":"604","DOI":"10.1109\/72.501719","article-title":"Worst-case quadratic loss bounds for prediction using linear functions and gradient descent","volume":"7","author":"Cesa-Bianchi","year":"1996","journal-title":"IEEE Transactions on Neural Networks"},{"key":"2026033014425697900_ref017","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511546921","volume-title":"Prediction, learning, and games","author":"Cesa-Bianchi","year":"2006"},{"key":"2026033014425697900_ref018","first-page":"234","volume-title":"Algorithmic learning theory","author":"Cesa-Bianchi","year":"2020"},{"issue":"1","key":"2026033014425697900_ref019","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1146\/annurev-statistics-040620-035329","article-title":"Online learning algorithms","volume":"8","author":"Cesa-Bianchi","year":"2021","journal-title":"Annual Review of Statistics and Its Application"},{"issue":"2","key":"2026033014425697900_ref020","doi-asserted-by":"crossref","first-page":"482","DOI":"10.1109\/TSP.2014.2367458","article-title":"Multi-agent distributed optimization via inexact consensus admm","volume":"63","author":"Chang","year":"2014","journal-title":"IEEE Transactions on Signal Processing"},{"issue":"1","key":"2026033014425697900_ref021","doi-asserted-by":"crossref","first-page":"1276","DOI":"10.1109\/JIOT.2018.2839563","article-title":"Bandit convex optimization for scalable and dynamic iot management","volume":"6","author":"Chen","year":"2018","journal-title":"IEEE Internet of Things Journal"},{"key":"2026033014425697900_ref022","volume-title":"Probability theory: independence, interchangeability, martingales","author":"Chow","year":"2003"},{"key":"2026033014425697900_ref023","volume-title":"Spectral graph theory","author":"Chung","year":"1997"},{"issue":"3","key":"2026033014425697900_ref024","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":"2011","journal-title":"IEEE Transactions on Automatic control"},{"issue":"5","key":"2026033014425697900_ref025","doi-asserted-by":"crossref","first-page":"2788","DOI":"10.1109\/TIT.2015.2409256","article-title":"Optimal rates for zero-order convex optimization: The power of two function evaluations","volume":"61","author":"Duchi","year":"2015","journal-title":"IEEE Transactions on Information Theory"},{"issue":"3","key":"2026033014425697900_ref026","doi-asserted-by":"publisher","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 Transactions on Automatic Control"},{"key":"2026033014425697900_ref027","article-title":"Composite objective mirror descent","author":"Duchi"},{"key":"2026033014425697900_ref028","first-page":"38173824","article-title":"On the discrepancy between the theoretical analysis and practical implementations of compressed communication for distributed deep learning","author":"Dutta"},{"key":"2026033014425697900_ref029","article-title":"Collaborative learning as an agreement problem","volume":"abs\/2008.00742","author":"El-Mhamdi","year":"2020","journal-title":"CoRR"},{"issue":"5","key":"2026033014425697900_ref030","doi-asserted-by":"publisher","first-page":"23702380","DOI":"10.1109\/TPWRS.2014.2306495","article-title":"Distributed optimal power flow using admm","volume":"29","author":"Erseghe","year":"2014","journal-title":"IEEE Transactions on Power Systems"},{"key":"2026033014425697900_ref031","first-page":"385","article-title":"Online convex optimization in the bandit setting: Gradient descent without a gradient","author":"Flaxman"},{"issue":"2","key":"2026033014425697900_ref032","doi-asserted-by":"crossref","first-page":"1084","DOI":"10.1214\/aos\/1176348140","article-title":"Prediction in the worst case","volume":"19","author":"Foster","year":"1991","journal-title":"The Annals of Statistics"},{"issue":"5","key":"2026033014425697900_ref033","first-page":"23262331","article-title":"Stability of open multiagent systems and applications to dynamic consensus","volume":"66","author":"Franceschelli","year":"2020","journal-title":"IEEE Transactions on Automatic Control"},{"key":"2026033014425697900_ref034","article-title":"Open multiagent systems with variable size: The case of gossiping","volume-title":"arXiv preprint","author":"de Galland","year":"2020"},{"key":"2026033014425697900_ref035","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-0163-9","volume-title":"Algebraic Graph Theory","author":"Godsil","year":"2001"},{"issue":"3","key":"2026033014425697900_ref036","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1561\/0100000006","article-title":"Toeplitz and circulant matrices: A review","volume":"2","author":"Gray","year":"2006","journal-title":"Foundations and Trends\u00ae in Communications and Information Theory"},{"issue":"6","key":"2026033014425697900_ref037","doi-asserted-by":"crossref","first-page":"3172","DOI":"10.1109\/TAC.2021.3097295","article-title":"Privacy-preserving dual averaging with arbitrary initial conditions for distributed optimization","volume":"67","author":"Han","year":"2021","journal-title":"IEEE Transactions on Automatic Control"},{"issue":"3-4","key":"2026033014425697900_ref038","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1561\/2400000013","article-title":"Introduction to online convex optimization","volume":"2","author":"Hazan","year":"2016","journal-title":"Foundations and Trends\u00ae in Optimization"},{"issue":"2","key":"2026033014425697900_ref039","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":"Machine Learning"},{"issue":"3","key":"2026033014425697900_ref040","article-title":"Opinion dynamics and bounded confidence: Models, analysis and simulation","volume":"5","author":"Hegselmann","year":"2002","journal-title":"Journal of Artificial Societies and Social Simulation"},{"key":"2026033014425697900_ref041","first-page":"763","article-title":"Open multi-agent systems: Gossiping with random arrivals and departures","author":"Hendrickx"},{"key":"2026033014425697900_ref042","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511810817","volume-title":"Matrix Analysis","author":"Horn","year":"1985"},{"key":"2026033014425697900_ref043","first-page":"1484","article-title":"Online distributed optimization via dual averaging","author":"Hosseini"},{"issue":"11","key":"2026033014425697900_ref044","doi-asserted-by":"publisher","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":"2026033014425697900_ref045","first-page":"514","article-title":"Optimization in open networks via dual averaging","author":"Hsieh"},{"issue":"78","key":"2026033014425697900_ref046","first-page":"1","article-title":"Multiagent online optimization with delays: Asynchronicity, adaptivity, and optimism","volume":"23","author":"Hsieh","year":"2022","journal-title":"Journal of Machine Learning Research"},{"key":"2026033014425697900_ref047","first-page":"402","article-title":"Adaptive algorithms for online convex optimization with long-term constraints","author":"Jenatton"},{"key":"2026033014425697900_ref048","first-page":"1269","article-title":"Sketchml: Accelerating distributed machine learning with data sketches","author":"Jiang"},{"key":"2026033014425697900_ref049","first-page":"1453","article-title":"Online learning under delayed feedback","author":"Joulani"},{"key":"2026033014425697900_ref050","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":"2026033014425697900_ref051","first-page":"34783487","article-title":"Decentralized stochastic optimization and gossip algorithms with compressed communication","author":"Koloskova"},{"key":"2026033014425697900_ref052","first-page":"7171","article-title":"Distributed primal-dual methods for online constrained optimization","author":"Lee"},{"key":"2026033014425697900_ref053","first-page":"15 591","volume-title":"Advances in Neural Information Processing Systems","author":"Lei","year":"2020"},{"key":"2026033014425697900_ref054","doi-asserted-by":"crossref","first-page":"100 904","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":"2026033014425697900_ref055","doi-asserted-by":"publisher","first-page":"35753591","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"},{"key":"2026033014425697900_ref056","first-page":"3944","article-title":"Cautious regret minimization: Online optimization with long-term budget constraints","author":"Liakopoulos"},{"key":"2026033014425697900_ref057","article-title":"Compressed gradient tracking methods for decentralized optimization with linear convergence","volume-title":"arXiv preprint","author":"Liao","year":"2021"},{"key":"2026033014425697900_ref058","first-page":"53","article-title":"3lc: Lightweight and effective traffic compression for distributed machine learning","author":"Lim"},{"issue":"5","key":"2026033014425697900_ref059","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1109\/MSP.2020.3003837","article-title":"A primer on zeroth-order optimization in signal processing and machine learning: Principals, recent advances, and applications","volume":"37","author":"Liu","year":"2020","journal-title":"IEEE Signal Processing Magazine"},{"issue":"2","key":"2026033014425697900_ref060","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/s10107-011-0467-x","article-title":"Distributed multi-agent optimization with state-dependent communication","volume":"129","author":"Lobel","year":"2011","journal-title":"Mathematical Programming"},{"issue":"1","key":"2026033014425697900_ref061","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1109\/TCNS.2016.2594487","article-title":"A distributed algorithm for solving positive definite linear equations over networks with membership dynamics","volume":"5","author":"Lu","year":"2018","journal-title":"IEEE Transactions on Control of Network Systems"},{"issue":"11","key":"2026033014425697900_ref062","doi-asserted-by":"crossref","first-page":"65096524","DOI":"10.1109\/TAC.2023.3239432","article-title":"Online distributed optimization with non-convex objective functions via dynamic regrets","volume":"68","author":"Lu","year":"2023","journal-title":"IEEE Transactions on Automatic Control"},{"issue":"1","key":"2026033014425697900_ref063","first-page":"2503","article-title":"Trading regret for efficiency: Online convex optimization with long term constraints","volume":"13","author":"Mahdavi","year":"2012","journal-title":"The Journal of Machine Learning Research"},{"key":"2026033014425697900_ref064","volume-title":"Advances in Neural Information Processing Systems","author":"Malek","year":"2018"},{"issue":"1","key":"2026033014425697900_ref065","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-Nunez","year":"2014","journal-title":"IEEE Transactions on Network Science and Engineering"},{"key":"2026033014425697900_ref066","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1109\/Allerton.2013.6736534","article-title":"A distributed algorithm for solving a linear algebraic equation","author":"Mou"},{"issue":"1","key":"2026033014425697900_ref067","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1146\/annurev-control-060117-105131","article-title":"Distributed optimization for control","volume":"1","author":"Nedi\u0107","year":"2018","journal-title":"Annual Review of Control, Robotics, and Autonomous Systems"},{"issue":"3","key":"2026033014425697900_ref068","doi-asserted-by":"crossref","first-page":"601","DOI":"10.1109\/TAC.2014.2364096","article-title":"Distributed optimization over time-varying directed graphs","volume":"60","author":"Nedi\u0107","year":"2015","journal-title":"IEEE Transactions on Automatic Control"},{"key":"2026033014425697900_ref069","first-page":"41774184","article-title":"Distributed subgradient methods and quantization effects","author":"Nedi\u0107"},{"key":"2026033014425697900_ref070","first-page":"953","article-title":"Network topology and communication-computation tradeoffs in decentralized optimization","author":"Nedi\u0107"},{"issue":"1","key":"2026033014425697900_ref071","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":"2026033014425697900_ref072","doi-asserted-by":"crossref","first-page":"922","DOI":"10.1109\/TAC.2010.2041686","article-title":"Constrained consensus and optimization in multi-agent networks","volume":"55","author":"Nedi\u0107","year":"2010","journal-title":"IEEE Transactions on Automatic Control"},{"issue":"4","key":"2026033014425697900_ref073","doi-asserted-by":"crossref","first-page":"922","DOI":"10.1109\/TAC.2010.2041686","article-title":"Constrained consensus and optimization in multi-agent networks","volume":"55","author":"Nedi\u0107","year":"2010","journal-title":"IEEE Transactions on Automatic Control"},{"issue":"1","key":"2026033014425697900_ref074","doi-asserted-by":"crossref","first-page":"221259","DOI":"10.1007\/s10107-007-0149-x","article-title":"Primal-dual subgradient methods for convex problems","volume":"120","author":"Nesterov","year":"2009","journal-title":"Mathematical programming"},{"key":"2026033014425697900_ref075","volume-title":"Introductory Lectures on Convex Optimization: A Basic Course","author":"Nesterov","year":"2014","edition":"1st"},{"issue":"2","key":"2026033014425697900_ref076","doi-asserted-by":"crossref","first-page":"527","DOI":"10.1007\/s10208-015-9296-2","article-title":"Random gradient-free minimization of convex functions","volume":"17","author":"Nesterov","year":"2017","journal-title":"Foundations of Computational Mathematics"},{"key":"2026033014425697900_ref077","article-title":"A modern introduction to online learning","volume":"abs\/1912.13213","author":"Orabona","year":"2019","journal-title":"CoRR"},{"issue":"5","key":"2026033014425697900_ref078","doi-asserted-by":"publisher","first-page":"3286","DOI":"10.1109\/TIT.2017.2776217","article-title":"Linear regression with shuffled data: Statistical and computational limits of permutation recovery","volume":"64","author":"Pananjady","year":"2018","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026033014425697900_ref079","doi-asserted-by":"publisher","first-page":"5486","DOI":"10.1109\/CDC40024.2019.9030193","article-title":"Constrained online learning in networks with sublinear regret and fit","author":"Paternain"},{"key":"2026033014425697900_ref080","article-title":"Online learning with adversarial delays","volume":"28","author":"Quanrud","year":"2015","journal-title":"Advances in neural information processing systems"},{"issue":"3","key":"2026033014425697900_ref081","doi-asserted-by":"publisher","first-page":"516","DOI":"10.1007\/s10957-010-9737-7","article-title":"Distributed Stochastic Subgradient Projection Algorithms for Convex Optimization","volume":"147","author":"Ram","year":"2010","journal-title":"Journal of Optimization Theory and Applications"},{"issue":"10","key":"2026033014425697900_ref082","doi-asserted-by":"publisher","first-page":"6976","DOI":"10.1109\/TIT.2011.2165799","article-title":"Minimax rates of estimation for high-dimensional linear regression over \u2113q -balls","volume":"57","author":"Raskutti","year":"2011","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026033014425697900_ref083","doi-asserted-by":"crossref","article-title":"1-bit stochastic gradient descent and its application to data-parallel distributed training of speech dnns","author":"Seide","DOI":"10.21437\/Interspeech.2014-274"},{"issue":"3","key":"2026033014425697900_ref084","doi-asserted-by":"publisher","first-page":"714725","DOI":"10.1109\/TAC.2017.2743462","article-title":"Distributed online optimization in dynamic environments using mirror descent","volume":"63","author":"Shahrampour","year":"2018","journal-title":"IEEE Transactions on Automatic Control"},{"issue":"2","key":"2026033014425697900_ref085","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1561\/2200000018","article-title":"Online learning and online convex optimization","volume":"4","author":"Shalev-Shwartz","year":"2012","journal-title":"Foundations and Trends\u00ae in Machine Learning"},{"issue":"52","key":"2026033014425697900_ref086","first-page":"1","article-title":"An optimal algorithm for bandit and zero-order convex optimization with two-point feedback","volume":"18","author":"Shamir","year":"2017","journal-title":"Journal of Machine Learning Research"},{"issue":"6","key":"2026033014425697900_ref087","doi-asserted-by":"publisher","first-page":"2659","DOI":"10.1109\/TAC.2016.2612819","article-title":"Network flows that solve linear equations","volume":"62","author":"Shi","year":"2017","journal-title":"IEEE Transactions on Automatic Control"},{"issue":"2","key":"2026033014425697900_ref088","doi-asserted-by":"crossref","first-page":"944","DOI":"10.1137\/14096668X","article-title":"Extra: An exact firstorder algorithm for decentralized consensus optimization","volume":"25","author":"Shi","year":"2015","journal-title":"SIAM Journal on Optimization"},{"key":"2026033014425697900_ref089","unstructured":"O.\n              Shorinwa\n            , T.Halsted, J.Yu, and M.Schwager, Distributed optimization methods for multi-robot systems: Part i - a tutorial, 2023. URL: https:\/\/arxiv.org\/abs\/2301.11313."},{"key":"2026033014425697900_ref090","article-title":"Sparq-sgd: Event-triggered and compressed communication in decentralized optimization","volume-title":"IEEE Transactions on Automatic Control","author":"Singh","year":"2022"},{"key":"2026033014425697900_ref091","first-page":"44524463","article-title":"Sparsified sgd with memory","author":"Stich"},{"key":"2026033014425697900_ref092","article-title":"Communication compression for decentralized training","volume":"31","author":"Tang","year":"2018","journal-title":"Advances in Neural Information Processing Systems"},{"key":"2026033014425697900_ref093","first-page":"54535458","article-title":"Push-sum distributed dual averaging for convex optimization","author":"Tsianos"},{"issue":"9","key":"2026033014425697900_ref094","doi-asserted-by":"crossref","first-page":"803","DOI":"10.1109\/TAC.1986.1104412","article-title":"Distributed asynchronous deterministic and stochastic gradient optimization algorithms","volume":"31","author":"Tsitsiklis","year":"1986","journal-title":"IEEE Transactions on Automatic Control"},{"key":"2026033014425697900_ref095","first-page":"34 492","volume-title":"Advances in Neural Information Processing Systems","author":"Tu","year":"2022"},{"key":"2026033014425697900_ref096","volume-title":"Advances in Neural Information Processing Systems","author":"Vovk","year":"1997"},{"key":"2026033014425697900_ref097","article-title":"Dual averaging method for regularized stochastic learning and online optimization","volume":"22","author":"Xiao","year":"2009","journal-title":"Advances in Neural Information Processing Systems"},{"issue":"11","key":"2026033014425697900_ref098","doi-asserted-by":"crossref","first-page":"2483","DOI":"10.1109\/TKDE.2012.191","article-title":"Distributed autonomous online learning: Regrets and intrinsic privacy-preserving properties","volume":"25","author":"Yan","year":"2012","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"2026033014425697900_ref099","doi-asserted-by":"crossref","first-page":"278305","DOI":"10.1016\/j.arcontrol.2019.05.006","article-title":"A survey of distributed optimization","volume":"47","author":"Yang","year":"2019","journal-title":"Annual Reviews in Control"},{"key":"2026033014425697900_ref100","doi-asserted-by":"crossref","first-page":"110639","DOI":"10.1016\/j.automatica.2022.110639","article-title":"Globally convergent visualfeature range estimation with biased inertial measurements","volume":"146","author":"Yi","year":"2022","journal-title":"Automatica"},{"key":"2026033014425697900_ref101","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 Transactions on Signal Processing"},{"issue":"10","key":"2026033014425697900_ref102","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":"2020","journal-title":"IEEE Transactions on Automatic Control"},{"issue":"3","key":"2026033014425697900_ref103","doi-asserted-by":"publisher","first-page":"1430","DOI":"10.1109\/TIT.2018.2864276","article-title":"Learning mixtures of sparse linear regressions using sparse graph codes","volume":"65","author":"Yin","year":"2019","journal-title":"IEEE Transactions on Information Theory"},{"issue":"2","key":"2026033014425697900_ref104","doi-asserted-by":"publisher","first-page":"714","DOI":"10.1109\/TAC.2020.2987379","article-title":"Distributed mirror descent for online composite optimization","volume":"66","author":"Yuan","year":"2021","journal-title":"IEEE Transactions on Automatic Control"},{"key":"2026033014425697900_ref105","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1016\/j.automatica.2017.12.053","article-title":"Optimal distributed stochastic mirror descent for strongly convex optimization","volume":"90","author":"Yuan","year":"2018","journal-title":"Automatica"},{"issue":"1","key":"2026033014425697900_ref106","doi-asserted-by":"publisher","first-page":"616","DOI":"10.1109\/TIT.2020.3029304","article-title":"Distributed online linear regressions","volume":"67","author":"Yuan","year":"2021","journal-title":"IEEE Transactions on Information Theory"},{"issue":"3","key":"2026033014425697900_ref107","doi-asserted-by":"crossref","first-page":"1089","DOI":"10.1109\/TAC.2021.3057601","article-title":"Distributed online optimization with long-term constraints","volume":"67","author":"Yuan","year":"2021","journal-title":"IEEE Transactions on Automatic Control"},{"key":"2026033014425697900_ref108","doi-asserted-by":"crossref","first-page":"111328","DOI":"10.1016\/j.automatica.2023.111328","article-title":"Distributed zeroth-order optimization: Convergence rates that match centralized counterpart","volume":"159","author":"Yuan","year":"2024","journal-title":"Automatica"},{"key":"2026033014425697900_ref109","article-title":"Online convex optimization for cumulative constraints","volume":"31","author":"Yuan","year":"2018","journal-title":"Advances in Neural Information Processing Systems"},{"key":"2026033014425697900_ref110","article-title":"Innovation compression for communication-efficient distributed optimization with linear convergence","volume-title":"arXiv preprint","author":"Zhang","year":"2021"},{"key":"2026033014425697900_ref111","first-page":"4054","article-title":"Projection-free distributed online learning in networks","author":"Zhang"},{"issue":"1","key":"2026033014425697900_ref112","first-page":"151","article-title":"On distributed convex optimization under inequality and equality constraints","volume":"57","author":"Zhu","year":"2011","journal-title":"IEEE Transactions on Automatic Control"},{"key":"2026033014425697900_ref113","first-page":"928","article-title":"Online convex programming and generalized infinitesimal gradient ascent","author":"Zinkevich"}],"container-title":["Foundations and Trends\u00ae in Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.emerald.com\/ftopt\/article-pdf\/7\/2-3\/81\/10970748\/2400000037en.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/www.emerald.com\/ftopt\/article-pdf\/7\/2-3\/81\/10970748\/2400000037en.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,30]],"date-time":"2026-03-30T18:43:17Z","timestamp":1774896197000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.emerald.com\/ftopt\/article\/7\/2-3\/81\/1324326\/Multi-agent-Online-Optimization"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,16]]},"references-count":113,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2024,12,16]]}},"URL":"https:\/\/doi.org\/10.1561\/2400000037","relation":{},"ISSN":["2167-3888","2167-3918"],"issn-type":[{"value":"2167-3888","type":"print"},{"value":"2167-3918","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,12,16]]}}}