Abstract
This paper considers distributed stochastic optimization, in which a number of agents cooperate to optimize a global objective function through local computations and information exchanges with neighbors over a network. Stochastic optimization problems are usually tackled by variants of projected stochastic gradient descent. However, projecting a point onto a feasible set is often expensive. The Frank-Wolfe (FW) method has well-documented merits in handling convex constraints, but existing stochastic FW algorithms are basically developed for centralized settings. In this context, the present work puts forth a distributed stochastic Frank-Wolfe solver, by judiciously combining Nesterov's momentum and gradient tracking techniques for stochastic convex and nonconvex optimization over networks. It is shown that the convergence rate of the proposed algorithm is Ok-1/2) for convex optimization, and O(1/log2(k)) for nonconvex optimization. The efficacy of the algorithm is demonstrated by numerical simulations against a number of competing alternatives.
| Original language | English |
|---|---|
| Pages (from-to) | 685-699 |
| Number of pages | 15 |
| Journal | IEEE/CAA Journal of Automatica Sinica |
| Volume | 10 |
| Issue number | 3 |
| DOIs | |
| State | Published - 1 Mar 2023 |
| Externally published | Yes |
Keywords
- Distributed optimization
- Frank-Wolfe (FW) algorithms
- momentum-based method
- stochastic optimization
Fingerprint
Dive into the research topics of 'Distributed Momentum-Based Frank-Wolfe Algorithm for Stochastic Optimization'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver