2 citations · 7 across the 20 of their papers we have counts for
6 papers · 1 filter
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…
Numerical methods for the resource allocation problem in networks
Anastasiya Ivanova, Dmitry Pasechnyuk, Pavel Dvurechensky +2
In this paper, we consider the resource allocation problem in a network with a large number of connections which are used by a huge number of users. The resource allocation problem…
Gradient Methods for Problems with Inexact Model of the Objective
Fedor Stonyakin, Darina Dvinskikh, Pavel Dvurechensky +8
We consider optimization methods for convex minimization problems under inexact information on the objective function. We introduce inexact model of the objective, which as a parti…
Inexact Model: A Framework for Optimization and Variational Inequalities
Fedor Stonyakin, Alexander Gasnikov, Alexander Tyurin +6
In this paper we propose a general algorithmic framework for first-order methods in optimization in a broad sense, including minimization problems, saddle-point problems and variat…