Decentralized optimization over slowly time-varying graphs: algorithms and lower bounds

DOI10.1007/s10287-023-00489-5arXiv2307.12562MaRDI QIDQ6149575

Alexander Rogozin, A. V. Gasnikov, Aleksandr Beznosikov, Dmitry Metelev, Anton V. Proskurnikov

Publication date: 6 February 2024

Published in: Computational Management Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2307.12562

zbMATH Keywords

convex optimizationconvergence ratetime-varying networkconsensusdecentralized optimization

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Related Items

Min-max optimization over slowly time-varying graphs

Cites Work

• Subgradient methods for saddle-point problems
• Distributed consensus in multi-vehicle cooperative control. Theory and applications.
• Fast linear iterations for distributed averaging
• Average Consensus on Arbitrary Strongly Connected Digraphs With Time-Varying Topologies
• Fast Convergence Rates for Distributed Non-Bayesian Learning
• Distributed Spectrum Sensing for Cognitive Radio Networks by Exploiting Sparsity
• Consensus and Cooperation in Networked Multi-Agent Systems
• Achieving Geometric Convergence for Distributed Optimization Over Time-Varying Graphs
• Distributed Subgradient Methods for Multi-Agent Optimization
• Decentralized Accelerated Gradient Methods With Increasing Penalty Parameters
• Coordination of groups of mobile autonomous agents using nearest neighbor rules
• Towards accelerated rates for distributed optimization over time-varying networks
• Near-Optimal Decentralized Algorithms for Saddle Point Problems over Time-Varying Networks