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 math.OCShow all

36 papers · 1 filter

math.OC2026

Parameter-Free Zeroth-Order Optimization with Ellipsoidal Sampling

Alexander Sholokhov, Alexander Rogozin

Zeroth-order optimization methods are essential for solving black-box problems where gradient information is unavailable or expensive to compute. This paper presents POEM-ES, a nov…

math.OC2026

Accelerated Consensus and Decentralized Optimization over Slowly Varying Networks

Darina Dvinskikh, Anton Novitskii, Demyan Yarmoshik +3

We study average consensus over slowly time-varying networks and its application to decentralized optimization. We introduce WAVE, a windowed Chebyshev method that limits the accum…

math.OC2026

Decentralized Optimization with Cross-Coupled Mixed Affine Constraints

Ewsey Obzherin, Ilya Khomchenko, Natalia Shelegeda +4

We study decentralized optimization with cross-coupled mixed affine constraints, where local and shared variables interact through two affine channels. We show that the intrinsic d…

math.OC2026

Decentralized Inexact Cubic Newton Method with Consensus Procedure

Artem Agafonov, Anton Novitskii, Alexander Rogozin +5

Distributed optimization is widely used in large-scale and privacy-preserving machine learning, where each agent stores a local objective and communicates only with its neighbors i…

math.OC2026

Exploring New Frontiers in Vertical Federated Learning: the Role of Saddle Point Reformulation

Aleksandr Beznosikov, Georgiy Kormakov, Alexander Grigorievskiy +7

The objective of Vertical Federated Learning (VFL) is to collectively train a model using features available on different devices while sharing the same users. This paper focuses o…

math.OC2026

Decentralized Optimization with Mixed Affine Constraints

Demyan Yarmoshik, Nhat Trung Nguyen, Alexander Rogozin +1

This paper considers decentralized optimization of convex functions with mixed affine equality constraints involving both local and global variables. Constraints on global variable…

math.OC2025

Dual Smoothing for Decentralized Optimization

Alexander Rogozin, Nhat Trung Nguyen, Hamed Azami Zenuzagh +1

Decentralized optimization is widely used in different fields of study such as distributed learning, signal processing, and various distributed control problems. In these types of…

math.OC2025

Robustifying networks for flow problems against edge failure

Artyom Klyuchikov, Roland Hildebrand, Sergei Protasov +2

We consider the robust version of a multi-commodity network flow problem. The robustness is defined with respect to the deletion, or failure, of edges. While the flow problem itsel…

math.OC2024

Average-case optimization analysis for distributed consensus algorithms on regular graphs

Nhat Trung Nguyen, Alexander Rogozin, Alexander Gasnikov

The consensus problem in distributed computing involves a network of agents aiming to compute the average of their initial vectors through local communication, represented by an un…

math.OC2024

Decentralized Optimization with Coupled Constraints

Demyan Yarmoshik, Alexander Rogozin, Nikita Kiselev +3

We consider the decentralized minimization of a separable objective , where the variables are coupled through an affine constraint $\sum_{i=1}^n\left(\math…

math.OC2024

Delay-tolerant distributed Bregman proximal algorithms

S. Chraibi, F. Iutzeler, J. Malick +1

Many problems in machine learning write as the minimization of a sum of individual loss functions over the training examples. These functions are usually differentiable but, in som…

math.OC2024

Decentralized Finite-Sum Optimization over Time-Varying Networks

Dmitry Metelev, Savelii Chezhegov, Alexander Rogozin +4

We consider decentralized time-varying stochastic optimization problems where each of the functions held by the nodes has a finite sum structure. Such problems can be efficiently s…

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…

math.OC2022★ 8 cited

Decentralized convex optimization over time-varying graphs: a survey

Alexander Rogozin, Alexander Gasnikov, Aleksander Beznosikov +1

Decentralized optimization over time-varying networks has a wide range of applications in distributed learning, signal processing and various distributed control problems. The agen…

math.OC2022

The Mirror-Prox Sliding Method for Non-smooth decentralized saddle-point problems

Ilya Kuruzov, Alexander Rogozin, Demyan Yarmoshik +1

The saddle-point optimization problems have a lot of practical applications. This paper focuses on such non-smooth problems in decentralized case. This work contains generalization…

math.OC2022★ 5 cited

Decentralized Strongly-Convex Optimization with Affine Constraints: Primal and Dual Approaches

Alexander Rogozin, Demyan Yarmoshik, Ksenia Kopylova +1

Decentralized optimization is a common paradigm used in distributed signal processing and sensing as well as privacy-preserving and large-scale machine learning. It is assumed that…

math.OC2022★ 2 cited

Decentralized Saddle-Point Problems with Different Constants of Strong Convexity and Strong Concavity

Dmitriy Metelev, Alexander Rogozin, Alexander Gasnikov +1

Large-scale saddle-point problems arise in such machine learning tasks as GANs and linear models with affine constraints. In this paper, we study distributed saddle-point problems…

math.OC2022

Decentralized convex optimization under affine constraints for power systems control

Demyan Yarmoshik, Alexander Rogozin, Oleg. O. Khamisov +2

Modern power systems are now in continuous process of massive changes. Increased penetration of distributed generation, usage of energy storage and controllable demand require intr…

math.OC2022★ 1 cited

A General Framework for Distributed Partitioned Optimization

Savelii Chezhegov, Anton Novitskii, Alexander Rogozin +3

Decentralized optimization is widely used in large scale and privacy preserving machine learning and various distributed control and sensing systems. It is assumed that every agent…