Distributed zeroth-order optimization: convergence rates that match centralized counterpart
From MaRDI portal
Publication:6537281
DOI10.1016/J.AUTOMATICA.2023.111328zbMATH Open1537.9001MaRDI QIDQ6537281FDOQ6537281
Authors: Deming Yuan, Lei Wang, Alexandre Proutiere, Guodong Shi 
Publication date: 14 May 2024
Published in: Automatica (Search for Journal in Brave)
Recommendations
- Zeroth-order algorithms for stochastic distributed nonconvex optimization
- Optimal convergence rates for convex distributed optimization in networks
- Convergence of distributed gradient-tracking-based optimization algorithms with random graphs
- Distributed consensus-based multi-agent convex optimization via gradient tracking technique
- Towards accelerated rates for distributed optimization over time-varying networks
optimal convergence ratedistributed optimizationzeroth-order optimizationmulti-stage optimization algorithm
Cites Work
- Constrained Consensus and Optimization in Multi-Agent Networks
- Dual Averaging for Distributed Optimization: Convergence Analysis and Network Scaling
- Random gradient-free minimization of convex functions
- Online convex optimization in the bandit setting: gradient descent without a gradient
- Distributed Subgradient Methods for Multi-Agent Optimization
- Initialization-free distributed algorithms for optimal resource allocation with feasibility constraints and application to economic dispatch of power systems
- Optimal Rates for Zero-Order Convex Optimization: The Power of Two Function Evaluations
- Distributed subgradient-free stochastic optimization algorithm for nonsmooth convex functions over time-varying networks
- Harnessing Smoothness to Accelerate Distributed Optimization
- Kernel-based methods for bandit convex optimization
- A distributed fixed-time optimization algorithm for multi-agent systems
- An Optimal Algorithm for Bandit and Zero-Order Convex Optimization with Two-Point Feedback
- Improved regret for zeroth-order adversarial bandit convex optimisation
- Randomized Gradient-Free Distributed Optimization Methods for a Multiagent System With Unknown Cost Function
- Exponential convergence of distributed primal-dual convex optimization algorithm without strong convexity
- Distributed Bandit Online Convex Optimization With Time-Varying Coupled Inequality Constraints
- ZONE: Zeroth-Order Nonconvex Multiagent Optimization Over Networks
This page was built for publication: Distributed zeroth-order optimization: convergence rates that match centralized counterpart
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6537281)
