Decentralized convex optimization over time-varying graphs: a survey
arXiv:2210.09719 · doi:10.1007/978-3-030-54621-2_860-1
Abstract
Decentralized optimization over time-varying networks has a wide range of applications in distributed learning, signal processing and various distributed control problems. The agents of the distributed system locally hold optimization objectives and can communicate to their immediate neighbors over a network that changes from time to time. In this paper, we survey state-of-the-art results and describe the techniques for optimization over time-varying graphs. We also give an overview of open questions in the field and formulate hypotheses and directions for future work.
References in corpus (7)
- Recent theoretical advances in decentralized distributed convex optimization
- Acceleration in Distributed Optimization under Similarity
- Decentralized convex optimization over time-varying graphs: a survey
- Decentralized Optimization Over Slowly Time-Varying Graphs: Algorithms and Lower Bounds
- Decentralized Strongly-Convex Optimization with Affine Constraints: Primal and Dual Approaches
- RECAPP: Crafting a More Efficient Catalyst for Convex Optimization
- An acceleration of decentralized SGD under general assumptions with low stochastic noise