3 citations · 5 across the 6 of their papers we have counts for
6 papers
Bregman Proximal Method for Efficient Communications under Similarity
Aleksandr Beznosikov, Darina Dvinskikh, Dmitry Bylinkin +2
We propose a novel stochastic distributed method for both monotone and strongly monotone variational inequalities with Lipschitz operator and proper convex regularizers arising in…
Min-max optimization over slowly time-varying graphs
Nhat Trung Nguyen, Alexander Rogozin, Dmitry Metelev +1
Distributed optimization is an important direction of research in modern optimization theory. Its applications include large scale machine learning, distributed signal processing a…
Optimal Algorithm with Complexity Separation for Strongly Convex-Strongly Concave Composite Saddle Point Problems
Ekaterina Borodich, Georgiy Kormakov, Dmitry Kovalev +2
In this work, we focuses on the following saddle point problem where is -smooth, -strongly convex, -strongly concave an…
Convex optimization
Evgeniya Vorontsova, Roland Hildebrand, Alexander Gasnikov +1
This textbook is based on lectures given by the authors at MIPT (Moscow), HSE (Moscow), FEFU (Vladivostok), V.I. Vernadsky KFU (Simferopol), ASU (Republic of Adygea), and the Unive…
Adaptive Proximal Method for Variational Inequalities
Fedor Stonyakin, Alexander Gasnikov, Pavel Dvurechensky +1
A new adaptive approach is proposed for variational inequalities with a Lipschitz-continuous field. Estimates of the necessary number of iterations are obtained to achieve a given…
About universality of entropy in stochastic chemical kinetic models
Alexander Gasnikov, Evgenia Gasnikova
This paper studies the relationship between the Lyapunov function of a macrosystem whose dynamics is governed by the laws of stochastic chemical kinetics and the invariant measure…