Online distributed dual averaging algorithm for multi-agent bandit optimization over time-varying general directed networks
DOI10.1016/J.INS.2021.10.003OpenAlexW3203513905MaRDI QIDQ6180222FDOQ6180222
Authors: Jueyou Li, Xiaomei Zhu, Zhiyou Wu, Tingwen Huang 
Publication date: 19 January 2024
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2021.10.003
Recommendations
- Gradient-free algorithms for distributed online convex optimization
- Distributed online bandit optimization under random quantization
- Distributed online optimization subject to long-term constraints and time-varying topology: an event-triggered and bandit feedback approach
- Event-triggered distributed online convex optimization with delayed bandit feedback
multi-agent networkonline learningdistributed optimizationbandit optimizationdistributed dual averaging
Convex programming (90C25) Online algorithms; streaming algorithms (68W27) Stochastic programming (90C15) Distributed algorithms (68W15)
Cites Work
- Dual Averaging for Distributed Optimization: Convergence Analysis and Network Scaling
- Logarithmic regret algorithms for online convex optimization
- Online convex optimization in the bandit setting: gradient descent without a gradient
- Distributed Subgradient Methods for Multi-Agent Optimization
- EXTRA: an exact first-order algorithm for decentralized consensus optimization
- Distributed Optimization Over Time-Varying Directed Graphs
- Distributed optimization for multi-agent systems with constraints set and communication time-delay over a directed graph
- Asynchronous impulsive containment control in switched multi-agent systems
- Distributed Convex Optimization with Inequality Constraints over Time-Varying Unbalanced Digraphs
- Geometrical convergence rate for distributed optimization with time-varying directed graphs and uncoordinated step-sizes
- Optimal Rates for Zero-Order Convex Optimization: The Power of Two Function Evaluations
- Distributed optimization over directed graphs with row stochasticity and constraint regularity
- Augmented Lagrange algorithms for distributed optimization over multi-agent networks via edge-based method
- Distributed Online Convex Optimization on Time-Varying Directed Graphs
- Dual Averaging Push for Distributed Convex Optimization Over Time-Varying Directed Graph
- Distributed Online Optimization in Dynamic Environments Using Mirror Descent
- Distributed Projection Subgradient Algorithm Over Time-Varying General Unbalanced Directed Graphs
- Online Distributed Convex Optimization on Dynamic Networks
- Distributed optimization for a class of uncertain MIMO nonlinear multi-agent systems with arbitrary relative degree
- Distributed Nash equilibrium computation in aggregative games: an event-triggered algorithm
- Differentially private distributed optimization for multi-agent systems via the augmented Lagrangian algorithm
- Stochastic Dual Averaging for Decentralized Online Optimization on Time-Varying Communication Graphs
- Coordinate Dual Averaging for Decentralized Online Optimization With Nonseparable Global Objectives
Cited In (3)
This page was built for publication: Online distributed dual averaging algorithm for multi-agent bandit optimization over time-varying general directed networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6180222)
