Distributed online bandit optimization under random quantization
From MaRDI portal
Publication:2097746
DOI10.1016/j.automatica.2022.110590zbMath1504.93129OpenAlexW4294732282MaRDI QIDQ2097746
Daniel W. C. Ho, Deming Yuan, Baoyong Zhang, Wei Xing Zheng, Shengyuan Xu
Publication date: 14 November 2022
Published in: Automatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.automatica.2022.110590
Related Items
Distributed delayed dual averaging for distributed optimization over time-varying digraphs, Distributed strategies for mixed equilibrium problems: continuous-time theoretical approaches, Online distributed optimization with strongly pseudoconvex-sum cost functions and coupled inequality constraints
Cites Work
- Unnamed Item
- Initialization-free distributed algorithms for optimal resource allocation with feasibility constraints and application to economic dispatch of power systems
- Optimal distributed stochastic mirror descent for strongly convex optimization
- Convergence rate analysis of distributed optimization with projected subgradient algorithm
- A distributed fixed-time optimization algorithm for multi-agent systems
- Exponential convergence of distributed primal-dual convex optimization algorithm without strong convexity
- Random gradient-free minimization of convex functions
- Fast linear iterations for distributed averaging
- Decentralized online convex optimization based on signs of relative states
- Optimal Rates for Zero-Order Convex Optimization: The Power of Two Function Evaluations
- Approximate Projected Consensus for Convex Intersection Computation: Convergence Analysis and Critical Error Angle
- Distributed Online Optimization in Dynamic Environments Using Mirror Descent
- Constrained Consensus Algorithms With Fixed Step Size for Distributed Convex Optimization Over Multiagent Networks
- Constrained Consensus and Optimization in Multi-Agent Networks
- Distributed Bandit Online Convex Optimization With Time-Varying Coupled Inequality Constraints
- Distributed Online Convex Optimization With Time-Varying Coupled Inequality Constraints
- Randomized Gradient-Free Distributed Optimization Methods for a Multiagent System With Unknown Cost Function
- Distributed Discrete-Time Optimization in Multiagent Networks Using Only Sign of Relative State
- Distributed Subgradient-Free Stochastic Optimization Algorithm for Nonsmooth Convex Functions over Time-Varying Networks
- Dual Averaging for Distributed Optimization: Convergence Analysis and Network Scaling
- An Optimal Algorithm for Bandit and Zero-Order Convex Optimization with Two-Point Feedback
- Distributed Mirror Descent for Online Composite Optimization