activity
20202026
most citedDecentralized Strongly-Convex Optimization with Affine Constraints: Primal and Dual Approaches

5 citations · 8 across the 13 of their papers we have counts for

collaborators

16 papers

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 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★ 1 cited

Stochastic Origin Frank-Wolfe for traffic assignment

Igor Ignashin, Demyan Yarmoshik, Andrei Raigorodskii

In this paper, we present the Stochastic Origin Frank-Wolfe (SOFW) method, which is a special case of the block-coordinate Frank-Wolfe algorithm, applied to the problem of finding…

eess.SY2025

Modeling skiers flows via Wardrope equilibrium in closed capacitated networks

Demyan Yarmoshik, Igor Ignashin, Ekaterina Sikacheva +1

We propose an equilibrium model of ski resorts where users are assigned to cycles in a closed network. As queues form on lifts with limited capacity, we derive an efficient way to…

math.OC2024

An Equilibrium Dynamic Traffic Assignment Model with Linear Programming Formulation

Victoria Guseva, Ilya Sklonin, Irina Podlipnova +2

In this paper, we consider a dynamic equilibrium transportation problem. There is a fixed number of cars moving from origin to destination areas. Preferences for arrival times are…

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

Modifications of the Frank-Wolfe algorithm in the problem of finding an equilibrium distribution of traffic flows

Igor N. Ignashin, Demyan V. Yarmoshik

The paper presents various modifications of the Frank-Wolfe algorithm in the equilibrium traffic assignment problem. The Beckman model is used as a model for experiments. In this a…

math.OC2023

On accelerated coordinate descent methods for searching equilibria in two-stage transportation equilibrium traffic flow distribution model

Nikita Iltyakov, Mark Obozov, Igor Dyslevski +3

The search for equilibrium in a two-stage traffic flow model reduces to the solution of a special nonsmooth convex optimization problem with two groups of different variables. For…

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★ 1 cited

Primal-Dual Gradient Methods for Searching Network Equilibria in Combined Models with Nested Choice Structure and Capacity Constraints

Meruza Kubentayeva, Demyan Yarmoshik, Mikhail Persiianov +8

We consider a network equilibrium model (i.e. a combined model), which was proposed as an alternative to the classic four-step approach for travel forecasting in transportation net…

math.OC2023★ 1 cited

Sufficient conditions for multi-stages traffic assignment model to be the convex optimization problem

Evgenia Gasnikova, Alexander Gasnikov, Demyan Yarmoshik +7

In this paper we consider multi-stages traffic assignment with several demand layers, user types and network types. We consider two stages: demand matrix calculation (Entropy Wilso…

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

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.OC2020

Finding equilibrium in two-stage traffic assignment model

Ekaterina Kotliarova, Alexander Gasnikov, Evgenia Gasnikova +1

Authors describe a two-stage traffic assignment model. It contains of two blocks. The first block consists of model for calculating correspondence (demand) matrix, whereas the seco…