1 citations · 2 across the 5 of their papers we have counts for
8 papers
The recovery model for the calculation of correspondence matrix for Moscow
Anastasiya Ivanova, Sergey Omelchenko, Ekaterina Kotliarova +1
In this paper, we consider the problem of restoring the correspondence matrix based on the observations of real correspondences in Moscow. Following the conventional approach, the…
Oracle Complexity Separation in Convex Optimization
Anastasiya Ivanova, Evgeniya Vorontsova, Dmitry Pasechnyuk +4
Many convex optimization problems have structured objective function written as a sum of functions with different types of oracles (full gradient, coordinate derivative, stochastic…
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…
Near-optimal tensor methods for minimizing the gradient norm of convex functions and accelerated primal-dual tensor methods
Pavel Dvurechensky, Petr Ostroukhov, Alexander Gasnikov +2
Motivated, in particular, by the entropy-regularized optimal transport problem, we consider convex optimization problems with linear equality constraints, where the dual objective…
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…
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…
Composite optimization for the resource allocation problem
Anastasiya Ivanova, Pavel Dvurechensky, Alexander Gasnikov +1
In this paper we consider resource allocation problem stated as a convex minimization problem with linear constraints. To solve this problem, we use gradient and accelerated gradie…
Walrasian Equilibrium and Centralized Distributed Optimization from the point of view of Modern Convex Optimization Methods on the Example of Resource Allocation Problem
Anastasiya Ivanova, Alexander Gasnikov, Evgeni Nurminski +1
We consider the resource allocation problem and its numerical solution. The following constructions are demonstrated: 1) Walrasian price-adjustment mechanism for determining the eq…