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

DOI10.1007/S10287-023-00489-5MaRDI QIDQ6149575zbMATH OpenFDO

Authors Dmitry Metelev, Aleksandr Beznosikov, Alexander Rogozin, A. V. Gasnikov, A. 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

consensusconvergence rateconvex optimizationdecentralized optimizationtime-varying network

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Recommendations

• Towards accelerated rates for distributed optimization over time-varying networks
• Decentralized optimization with affine constraints over time-varying networks
• Min-max optimization over slowly time-varying graphs
• Near-Optimal Decentralized Algorithms for Saddle Point Problems over Time-Varying Networks
• Achieving Geometric Convergence for Distributed Optimization Over Time-Varying Graphs

Cites work

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

Cited in

(5)

• Min-max optimization over slowly time-varying graphs
• Decentralized optimization with affine constraints over time-varying networks
• Towards accelerated rates for distributed optimization over time-varying networks
• Near-Optimal Decentralized Algorithms for Saddle Point Problems over Time-Varying Networks
• Editorial

This page was built for publication: Decentralized optimization over slowly time-varying graphs: algorithms and lower bounds

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6149575)