activity
20182026
most citedRecent theoretical advances in decentralized distributed convex optimization

26 citations · 122 across the 33 of their papers we have counts for

collaborators
Showing 2023Show all

6 papers · 1 filter

math.OC2023★ 6 cited

Decentralized Optimization Over Slowly Time-Varying Graphs: Algorithms and Lower Bounds

Dmitry Metelev, Aleksandr Beznosikov, Alexander Rogozin +2

We consider a decentralized convex unconstrained optimization problem, where the cost function can be decomposed into a sum of strongly convex and smooth functions, associated with…

math.OC2023

Decentralized conditional gradient method over time-varying graphs

Roman Vedernikov, Alexander Rogozin, Alexander Gasnikov

In this paper we study a generalization of distributed conditional gradient method to time-varying network architectures. We theoretically analyze convergence properties of the alg…

math.OC2023

Decentralized optimization with affine constraints over time-varying networks

Demyan Yarmoshik, Alexander Rogozin, Alexander Gasnikov

The decentralized optimization paradigm assumes that each term of a finite-sum objective is privately stored by the corresponding agent. Agents are only allowed to communicate with…

math.OC2023

Decentralized Proximal Optimization Method with Consensus Procedure

Alexander Rogozin, Anton Novitskii, Alexander Gasnikov

Decentralized optimization is well studied for smooth unconstrained problems. However, constrained problems or problems with composite terms are an open direction for research. We…

math.OC2023

On Decentralized Nonsmooth Optimization

Savelii Chezhegov, Alexander Rogozin, Alexander Gasnikov

In decentralized optimization, several nodes connected by a network collaboratively minimize some objective function. For minimization of Lipschitz functions lower bounds are known…

math.OC2023★ 1 cited

Is Consensus Acceleration Possible in Decentralized Optimization over Slowly Time-Varying Networks?

Dmitriy Metelev, Alexander Rogozin, Dmitry Kovalev +1

We consider decentralized optimization problems where one aims to minimize a sum of convex smooth objective functions distributed between nodes in the network. The links in the net…