10 papers
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…
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…
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…
Adaptive Mirror Descent for the Network Utility Maximization Problem
Anastasiya Ivanova, Fedor Stonyakin, Dmitry Pasechnyuk +2
Network utility maximization is the most important problem in network traffic management. Given the growth of modern communication networks, we consider the utility maximization pr…
Adaptive Catalyst for Smooth Convex Optimization
Anastasiya Ivanova, Dmitry Pasechnyuk, Dmitry Grishchenko +3
In this paper, we present a generic framework that allows accelerating almost arbitrary non-accelerated deterministic and randomized algorithms for smooth convex optimization probl…
Scheduling strategies for resource allocation in a cellular base station
Dmitry Pasechnyuk
The problem of scheduling the (time) resource allocation of a base station (cell tower) that interacts with clients (users of wireless mobile devices with Internet access) and serv…