activity
20182025
most citedSolving strongly convex-concave composite saddle point problems with a small dimension of one of the variables

2 citations · 7 across the 20 of their papers we have counts for

collaborators
Showing 2021Show all

5 papers · 1 filter

math.OC2021

Network utility maximization by updating individual transmission rates

Dmitry Pasechnyuk

This paper discusses the problem of maximizing the total data transmission utility of the computer network. The total utility is defined as the sum of the individual (corresponding…

math.OC2021

Stochastic optimization for dynamic pricing

Dmitry Pasechnyuk, Pavel Dvurechensky, Sergey Omelchenko +1

We consider the problem of supply and demand balancing that is stated as a minimization problem for the total expected revenue function describing the behavior of both consumers an…

math.OC2021

Non-convex optimization in digital pre-distortion of the signal

Dmitry Pasechnyuk, Alexander Maslovskiy, Alexander Gasnikov +9

In this paper, we give some observation of applying modern optimization methods for functionals describing digital predistortion (DPD) of signals with orthogonal frequency division…

math.OC2021

On the Computational Efficiency of Catalyst Accelerated Coordinate Descent

Dmitry Pasechnyuk, Vladislav Matyukhin

This article is devoted to one particular case of using universal accelerated proximal envelopes to obtain computationally efficient accelerated versions of methods used to solve v…

math.OC2021

Accelerated Proximal Envelopes: Application to the Coordinate Descent Method

Dmitry Pasechnyuk, Anton Anikin, Vladislav Matyukhin

This article is devoted to one particular case of using universal accelerated proximal envelopes to obtain computationally efficient accelerated versions of methods used to solve v…