Zeroth Order Nonconvex Multi-Agent Optimization over Networks
arXiv:1710.09997
Abstract
In this paper, we consider distributed optimization problems over a multi-agent network, where each agent can only partially evaluate the objective function, and it is allowed to exchange messages with its immediate neighbors. Differently from all existing works on distributed optimization, our focus is given to optimizing a class of non-convex problems, and under the challenging setting where each agent can only access the zeroth-order information (i.e., the functional values) of its local functions. For different types of network topologies such as undirected connected networks or star networks, we develop efficient distributed algorithms and rigorously analyze their convergence and rate of convergence (to the set of stationary solutions). Numerical results are provided to demonstrate the efficiency of the proposed algorithms.
References in corpus (3)
- A Comprehensive Linear Speedup Analysis for Asynchronous Stochastic Parallel Optimization from Zeroth-Order to First-Order
- NESTT: A Nonconvex Primal-Dual Splitting Method for Distributed and Stochastic Optimization
- Decomposing Linearly Constrained Nonconvex Problems by a Proximal Primal Dual Approach: Algorithms, Convergence, and Applications
Cited by in corpus (14)
- Distributed Non-Convex First-Order Optimization and Information Processing: Lower Complexity Bounds and Rate Optimal Algorithms
- Distributed and Inexact Proximal Gradient Method for Online Convex Optimization
- Communication-Efficient Distributed Strongly Convex Stochastic Optimization: Non-Asymptotic Rates
- On Nonconvex Decentralized Gradient Descent
- ZO-JADE: Zeroth-order Curvature-Aware Multi-Agent Convex Optimization
- Distributed Zero-Order Algorithms for Nonconvex Multi-Agent Optimization
- A Survey of Distributed Optimization Methods for Multi-Robot Systems
- Nonconvex Zeroth-Order Stochastic ADMM Methods with Lower Function Query Complexity
- Distributed Zero-Order Optimization under Adversarial Noise
- Distributed Zeroth-Order Stochastic Optimization in Time-varying Networks
- A Hybrid-Order Distributed SGD Method for Non-Convex Optimization to Balance Communication Overhead, Computational Complexity, and Convergence Rate
- Subgradient-Free Stochastic Optimization Algorithm for Non-smooth Convex Functions over Time-Varying Networks
- Distributed Interval Optimization with Stochastic Zeroth-order Oracle
- Gradient-Free Multi-Agent Nonconvex Nonsmooth Optimization