Achieving geometric convergence for distributed optimization over time-varying graphs

A Nedic, A Olshevsky, W Shi - SIAM Journal on Optimization, 2017 - SIAM
This paper considers the problem of distributed optimization over time-varying graphs. For
the case of undirected graphs, we introduce a distributed algorithm, referred to as DIGing …

Harnessing smoothness to accelerate distributed optimization

G Qu, N Li - IEEE Transactions on Control of Network Systems, 2017 - ieeexplore.ieee.org
There has been a growing effort in studying the distributed optimization problem over a
network. The objective is to optimize a global function formed by a sum of local functions …

Push–pull gradient methods for distributed optimization in networks

S Pu, W Shi, J Xu, A Nedić - IEEE Transactions on Automatic …, 2020 - ieeexplore.ieee.org
In this article, we focus on solving a distributed convex optimization problem in a network,
where each agent has its own convex cost function and the goal is to minimize the sum of …

Optimal algorithms for smooth and strongly convex distributed optimization in networks

K Scaman, F Bach, S Bubeck, YT Lee… - … on machine learning, 2017 - proceedings.mlr.press
In this paper, we determine the optimal convergence rates for strongly convex and smooth
distributed optimization in two settings: centralized and decentralized communications over …

Distributed Optimization Methods for Multi-robot Systems: Part 1—A Tutorial

O Shorinwa, T Halsted, J Yu… - IEEE Robotics & …, 2024 - ieeexplore.ieee.org
Distributed optimization provides a framework for deriving distributed algorithms for a variety
of multi-robot problems. This tutorial constitutes the first part of a two-part series on …

Communication-efficient algorithms for decentralized and stochastic optimization

G Lan, S Lee, Y Zhou - Mathematical Programming, 2020 - Springer
We present a new class of decentralized first-order methods for nonsmooth and stochastic
optimization problems defined over multiagent networks. Considering that communication is …

A general framework for decentralized optimization with first-order methods

R **n, S Pu, A Nedić, UA Khan - Proceedings of the IEEE, 2020 - ieeexplore.ieee.org
Decentralized optimization to minimize a finite sum of functions, distributed over a network of
nodes, has been a significant area within control and signal-processing research due to its …

Distributed nonconvex constrained optimization over time-varying digraphs

G Scutari, Y Sun - Mathematical Programming, 2019 - Springer
This paper considers nonconvex distributed constrained optimization over networks,
modeled as directed (possibly time-varying) graphs. We introduce the first algorithmic …

Distributed heavy-ball: A generalization and acceleration of first-order methods with gradient tracking

R **n, UA Khan - IEEE Transactions on Automatic Control, 2019 - ieeexplore.ieee.org
We study distributed optimization to minimize a sum of smooth and strongly-convex
functions. Recent work on this problem uses gradient tracking to achieve linear convergence …

BRIDGE: Byzantine-resilient decentralized gradient descent

C Fang, Z Yang, WU Bajwa - IEEE Transactions on Signal and …, 2022 - ieeexplore.ieee.org
Machine learning has begun to play a central role in many applications. A multitude of these
applications typically also involve datasets that are distributed across multiple computing …