Distributed online bandit optimization under random quantization
type: Item
instance of: scholarly article
title: Distributed online bandit optimization under random quantization
zbMATH Open document ID: 1504.93129
author: Deming Yuan
author: Baoyong Zhang
author: Daniel W. C. Ho
author: Wei Xing Zheng
author: Shengyuan Xu
published in: Automatica
publication date: 2022-11-14T00:00:00Z
Mathematics Subject Classification ID: 93B52
Mathematics Subject Classification ID: 93B70
Mathematics Subject Classification ID: 90C20
zbMATH DE Number: 7616396
zbMATH Keywords: online distributed optimization
zbMATH Keywords: bandit feedback
zbMATH Keywords: random quantization
zbMATH Keywords: regret bound
MaRDI profile type: Publication
full work available at URL: j.automatica.2022.110590
OpenAlex ID: W4294732282
cites work: Decentralized online convex optimization based on signs of relative states
cites work: Dual Averaging for Distributed Optimization: Convergence Analysis and Network Scaling
cites work: Optimal Rates for Zero-Order Convex Optimization: The Power of Two Function Evaluations
cites work: Online convex optimization in the bandit setting: gradient descent without a gradient
cites work: Exponential convergence of distributed primal-dual convex optimization algorithm without strong convexity
cites work: Convergence rate analysis of distributed optimization with projected subgradient algorithm
cites work: Constrained Consensus Algorithms With Fixed Step Size for Distributed Convex Optimization Over Multiagent Networks
cites work: Approximate Projected Consensus for Convex Intersection Computation: Convergence Analysis and Critical Error Angle
cites work: Constrained Consensus and Optimization in Multi-Agent Networks
cites work: Random gradient-free minimization of convex functions
cites work: Randomized Gradient-Free Distributed Optimization Methods for a Multiagent System With Unknown Cost Function
cites work: Distributed Online Optimization in Dynamic Environments Using Mirror Descent
cites work: An Optimal Algorithm for Bandit and Zero-Order Convex Optimization with Two-Point Feedback
cites work: A distributed fixed-time optimization algorithm for multi-agent systems
cites work: Distributed Subgradient-Free Stochastic Optimization Algorithm for Nonsmooth Convex Functions over Time-Varying Networks
cites work: Fast linear iterations for distributed averaging
cites work: Initialization-free distributed algorithms for optimal resource allocation with feasibility constraints and application to economic dispatch of power systems
cites work: Distributed Online Convex Optimization With Time-Varying Coupled Inequality Constraints
cites work: Distributed Bandit Online Convex Optimization With Time-Varying Coupled Inequality Constraints
cites work: Optimal distributed stochastic mirror descent for strongly convex optimization
cites work: Distributed Mirror Descent for Online Composite Optimization
cites work: Distributed Discrete-Time Optimization in Multiagent Networks Using Only Sign of Relative State
DOI: 10.1016/J.AUTOMATICA.2022.110590
description: scientific article; zbMATH DE number 7616396