Online distributed dual averaging algorithm for multi-agent bandit optimization over time-varying general directed networks
Authors:
- Jueyou LiJLJueyou Li
- Xiaomei ZhuXZXiaomei Zhu
- Zhiyou WuZWZhiyou Wu
- Tingwen HuangTHTingwen Huang
- 1 December 2021
- journal article
- research article
- Published by Elsevier in Information Sciences
- Vol. 581, 678-693
Abstract
No abstract availableKeywords
Funding Information
- Natural Science Foundation Project of Chongqing, Chongqing Science and Technology Commission
- National Natural Science Foundation of China (11971083)
- National Natural Science Foundation of China (cstc2020jcyj-msxmX0287)
- National Natural Science Foundation of China (11871128)
This publication has 31 references indexed in Scilit:
- Distributed networked control systems: A brief overviewInformation Sciences, 2017
- Online Distributed Convex Optimization on Dynamic NetworksIEEE Transactions on Automatic Control, 2016
- Distributed Online Convex Optimization on Time-Varying Directed GraphsIEEE Transactions on Control of Network Systems, 2015
- Optimal Rates for Zero-Order Convex Optimization: The Power of Two Function EvaluationsIEEE Transactions on Information Theory, 2015
- Online Convex Optimization in Dynamic EnvironmentsIEEE Journal of Selected Topics in Signal Processing, 2015
- EXTRA: An Exact First-Order Algorithm for Decentralized Consensus OptimizationSIAM Journal on Optimization, 2015
- Distributed Online Convex Optimization Over Jointly Connected DigraphsIEEE Transactions on Network Science and Engineering, 2014
- Distributed Optimization Over Time-Varying Directed GraphsIEEE Transactions on Automatic Control, 2014
- Dual Averaging for Distributed Optimization: Convergence Analysis and Network ScalingIEEE Transactions on Automatic Control, 2011
- Logarithmic regret algorithms for online convex optimizationMachine Learning, 2007