default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlexander V. Gasnikov
- > Home > Persons > Alexander V. Gasnikov
Publications
- 2025
[j44]Egor Gladin
, Alexander V. Gasnikov, Pavel E. Dvurechensky:
Accuracy Certificates for Convex Minimization with Inexact Oracle. J. Optim. Theory Appl. 204(1): 1 (2025)- 2024
- [j40]Olga Yufereva, Michael Persiianov, Pavel E. Dvurechensky, Alexander V. Gasnikov, Dmitry Kovalev:
Decentralized convex optimization on time-varying networks with application to Wasserstein barycenters. Comput. Manag. Sci. 21(1): 12 (2024) - [j35]Eduard Gorbunov, Marina Danilova, Innokentiy Shibaev, Pavel E. Dvurechensky, Alexander V. Gasnikov:
High-Probability Complexity Bounds for Non-smooth Stochastic Convex Optimization with Heavy-Tailed Noise. J. Optim. Theory Appl. 203(3): 2679-2738 (2024) - [j34]Artem Agafonov, Dmitry Kamzolov, Pavel E. Dvurechensky, Alexander V. Gasnikov, Martin Takác:
Inexact tensor methods and their application to stochastic convex optimization. Optim. Methods Softw. 39(1): 42-83 (2024) - [j33]Pavel E. Dvurechensky, Petr Ostroukhov, Alexander V. Gasnikov, César A. Uribe, Anastasiya Ivanova:
Near-optimal tensor methods for minimizing the gradient norm of convex functions and accelerated primal-dual tensor methods. Optim. Methods Softw. 39(5): 1068-1103 (2024) - [c62]Eduard Gorbunov, Abdurakhmon Sadiev, Marina Danilova, Samuel Horváth, Gauthier Gidel, Pavel E. Dvurechensky, Alexander V. Gasnikov, Peter Richtárik:
High-Probability Convergence for Composite and Distributed Stochastic Minimization and Variational Inequalities with Heavy-Tailed Noise. ICML 2024 - 2023
- [j31]Nikita Kornilov, Alexander V. Gasnikov, Pavel E. Dvurechensky, Darina Dvinskikh:
Gradient-free methods for non-smooth convex stochastic optimization with heavy-tailed noise on convex compact. Comput. Manag. Sci. 20(1): 37 (2023) - [j29]Artem Vasin, Alexander V. Gasnikov, Pavel E. Dvurechensky, Vladimir G. Spokoiny:
Accelerated gradient methods with absolute and relative noise in the gradient. Optim. Methods Softw. 38(6): 1180-1229 (2023) - [c52]Abdurakhmon Sadiev, Marina Danilova, Eduard Gorbunov, Samuel Horváth, Gauthier Gidel, Pavel E. Dvurechensky, Alexander V. Gasnikov, Peter Richtárik:
High-Probability Bounds for Stochastic Optimization and Variational Inequalities: the Case of Unbounded Variance. ICML 2023: 29563-29648 - [c47]Dmitry Pasechnyuk, Michael Persiianov, Pavel E. Dvurechensky, Alexander V. Gasnikov:
Algorithms for Euclidean-Regularised Optimal Transport. OPTIMA 2023: 84-98 - [i48]Abdurakhmon Sadiev, Marina Danilova, Eduard Gorbunov, Samuel Horváth, Gauthier Gidel, Pavel E. Dvurechensky, Alexander V. Gasnikov, Peter Richtárik:
High-Probability Bounds for Stochastic Optimization and Variational Inequalities: the Case of Unbounded Variance. CoRR abs/2302.00999 (2023) - [i44]Eduard Gorbunov, Abdurakhmon Sadiev, Marina Danilova, Samuel Horváth, Gauthier Gidel, Pavel E. Dvurechensky, Alexander V. Gasnikov, Peter Richtárik:
High-Probability Convergence for Composite and Distributed Stochastic Minimization and Variational Inequalities with Heavy-Tailed Noise. CoRR abs/2310.01860 (2023) - 2022
- [j25]Pavel E. Dvurechensky, Dmitry Kamzolov, Aleksandr Lukashevich, Soomin Lee, Erik Ordentlich, César A. Uribe, Alexander V. Gasnikov:
Hyperfast second-order local solvers for efficient statistically preconditioned distributed optimization. EURO J. Comput. Optim. 10: 100045 (2022) - [j24]Ekaterina Borodich, Vladislav Tominin, Yaroslav Tominin, Dmitry Kovalev, Alexander V. Gasnikov, Pavel E. Dvurechensky:
Accelerated variance-reduced methods for saddle-point problems. EURO J. Comput. Optim. 10: 100048 (2022) - [j23]Anastasiya Ivanova, Pavel E. Dvurechensky, Evgeniya A. Vorontsova, Dmitry Pasechnyuk, Alexander V. Gasnikov, Darina Dvinskikh, Alexander Tyurin:
Oracle Complexity Separation in Convex Optimization. J. Optim. Theory Appl. 193(1): 462-490 (2022) - [j22]Fedor S. Stonyakin, Alexander V. Gasnikov, Pavel E. Dvurechensky, Alexander A. Titov, Mohammad S. Alkousa:
Generalized Mirror Prox Algorithm for Monotone Variational Inequalities: Universality and Inexact Oracle. J. Optim. Theory Appl. 194(3): 988-1013 (2022) - [j20]Innokentiy Shibaev, Pavel E. Dvurechensky, Alexander V. Gasnikov:
Zeroth-order methods for noisy Hölder-gradient functions. Optim. Lett. 16(7): 2123-2143 (2022) - [j19]Daniil Tiapkin, Alexander V. Gasnikov, Pavel E. Dvurechensky:
Stochastic saddle-point optimization for the Wasserstein barycenter problem. Optim. Lett. 16(7): 2145-2175 (2022) - [j17]Eduard Gorbunov, Pavel E. Dvurechensky, Alexander V. Gasnikov:
An Accelerated Method for Derivative-Free Smooth Stochastic Convex Optimization. SIAM J. Optim. 32(2): 1210-1238 (2022) - [c43]Alexander V. Gasnikov, Anton Novitskii, Vasilii Novitskii, Farshed Abdukhakimov, Dmitry Kamzolov, Aleksandr Beznosikov, Martin Takác, Pavel E. Dvurechensky, Bin Gu:
The power of first-order smooth optimization for black-box non-smooth problems. ICML 2022: 7241-7265 - [c42]Aleksandr Beznosikov, Pavel E. Dvurechensky, Anastasia Koloskova, Valentin Samokhin, Sebastian U. Stich, Alexander V. Gasnikov:
Decentralized Local Stochastic Extra-Gradient for Variational Inequalities. NeurIPS 2022 - [c40]Eduard Gorbunov, Marina Danilova, David Dobre, Pavel E. Dvurechenskii, Alexander V. Gasnikov, Gauthier Gidel:
Clipped Stochastic Methods for Variational Inequalities with Heavy-Tailed Noise. NeurIPS 2022 - [i38]Eduard Gorbunov, Marina Danilova, David Dobre, Pavel E. Dvurechensky, Alexander V. Gasnikov, Gauthier Gidel:
Clipped Stochastic Methods for Variational Inequalities with Heavy-Tailed Noise. CoRR abs/2206.01095 (2022) - 2021
- [j15]Pavel E. Dvurechensky, Eduard Gorbunov, Alexander V. Gasnikov:
An accelerated directional derivative method for smooth stochastic convex optimization. Eur. J. Oper. Res. 290(2): 601-621 (2021) - [j13]Anastasiya Ivanova, Pavel E. Dvurechensky, Alexander V. Gasnikov, Dmitry Kamzolov:
Composite optimization for the resource allocation problem. Optim. Methods Softw. 36(4): 720-754 (2021) - [j12]Yurii E. Nesterov, Alexander V. Gasnikov, Sergey Guminov, Pavel E. Dvurechensky:
Primal-dual accelerated gradient methods with small-dimensional relaxation oracle. Optim. Methods Softw. 36(4): 773-810 (2021) - [j11]Fedor S. Stonyakin, Alexander Tyurin, Alexander V. Gasnikov, Pavel E. Dvurechensky, Artem Agafonov, Darina Dvinskikh, Mohammad S. Alkousa, Dmitry Pasechnyuk, Sergei Artamonov, Victoria V. Piskunova:
Inexact model: a framework for optimization and variational inequalities. Optim. Methods Softw. 36(6): 1155-1201 (2021) - [j10]Dmitry Kamzolov, Pavel E. Dvurechensky, Alexander V. Gasnikov:
Universal intermediate gradient method for convex problems with inexact oracle. Optim. Methods Softw. 36(6): 1289-1316 (2021) - [c29]Artem Agafonov, Pavel E. Dvurechensky, Gesualdo Scutari, Alexander V. Gasnikov, Dmitry Kamzolov, Aleksandr Lukashevich, Amir Daneshmand:
An Accelerated Second-Order Method for Distributed Stochastic Optimization. CDC 2021: 2407-2413 - [c28]Alexander Rogozin, Mikhail Bochko, Pavel E. Dvurechensky, Alexander V. Gasnikov, Vladislav Lukoshkin:
An Accelerated Method For Decentralized Distributed Stochastic Optimization Over Time-Varying Graphs. CDC 2021: 3367-3373 - [c27]Amir Daneshmand, Gesualdo Scutari, Pavel E. Dvurechensky, Alexander V. Gasnikov:
Newton Method over Networks is Fast up to the Statistical Precision. ICML 2021: 2398-2409 - [c26]Sergey Guminov, Pavel E. Dvurechensky, Nazarii Tupitsa, Alexander V. Gasnikov:
On a Combination of Alternating Minimization and Nesterov's Momentum. ICML 2021: 3886-3898 - [i31]Amir Daneshmand, Gesualdo Scutari, Pavel E. Dvurechensky, Alexander V. Gasnikov:
Newton Method over Networks is Fast up to the Statistical Precision. CoRR abs/2102.06780 (2021) - [i30]Alexander Rogozin, Aleksandr Beznosikov, Darina Dvinskikh, Dmitry Kovalev, Pavel E. Dvurechensky, Alexander V. Gasnikov:
Decentralized Distributed Optimization for Saddle Point Problems. CoRR abs/2102.07758 (2021) - [i26]Eduard Gorbunov, Marina Danilova, Innokentiy Shibaev, Pavel E. Dvurechensky, Alexander V. Gasnikov:
Near-Optimal High Probability Complexity Bounds for Non-Smooth Stochastic Optimization with Heavy-Tailed Noise. CoRR abs/2106.05958 (2021) - [i24]Aleksandr Beznosikov, Pavel E. Dvurechensky, Anastasia Koloskova, Valentin Samokhin, Sebastian U. Stich, Alexander V. Gasnikov:
Decentralized Local Stochastic Extra-Gradient for Variational Inequalities. CoRR abs/2106.08315 (2021) - 2020
- [c17]Nazarii Tupitsa, Pavel E. Dvurechensky, Alexander V. Gasnikov, César A. Uribe:
Multimarginal Optimal Transport by Accelerated Alternating Minimization. CDC 2020: 6132-6137 - [c15]Pavel E. Dvurechensky, Alexander V. Gasnikov, Sergey Omelchenko, Alexander Tiurin:
A Stable Alternative to Sinkhorn's Algorithm for Regularized Optimal Transport. MOTOR 2020: 406-423 - [c13]Dmitry Kamzolov, Alexander V. Gasnikov, Pavel E. Dvurechensky:
Optimal Combination of Tensor Optimization Methods. OPTIMA 2020: 166-183 - [i16]Daniil Tiapkin, Alexander V. Gasnikov, Pavel E. Dvurechensky:
Stochastic Saddle-Point Optimization for Wasserstein Barycenters. CoRR abs/2006.06763 (2020) - [i15]Abdurakhmon Sadiev, Aleksandr Beznosikov, Pavel E. Dvurechensky, Alexander V. Gasnikov:
Zeroth-Order Algorithms for Smooth Saddle-Point Problems. CoRR abs/2009.09908 (2020) - [i13]Marina Danilova, Pavel E. Dvurechensky, Alexander V. Gasnikov, Eduard Gorbunov, Sergey Guminov, Dmitry Kamzolov, Innokentiy Shibaev:
Recent Theoretical Advances in Non-Convex Optimization. CoRR abs/2012.06188 (2020) - 2019
- [j7]Evgeniya A. Vorontsova, Alexander V. Gasnikov, Eduard A. Gorbunov, Pavel E. Dvurechenskii:
Accelerated Gradient-Free Optimization Methods with a Non-Euclidean Proximal Operator. Autom. Remote. Control. 80(8): 1487-1501 (2019) - [c11]Darina Dvinskikh, Eduard Gorbunov, Alexander V. Gasnikov, Pavel E. Dvurechensky, César A. Uribe:
On Primal and Dual Approaches for Distributed Stochastic Convex Optimization over Networks. CDC 2019: 7435-7440 - [c10]Alexander V. Gasnikov, Pavel E. Dvurechensky, Eduard Gorbunov, Evgeniya A. Vorontsova, Daniil Selikhanovych, César A. Uribe:
Optimal Tensor Methods in Smooth Convex and Uniformly ConvexOptimization. COLT 2019: 1374-1391 - [c9]Alexander V. Gasnikov, Pavel E. Dvurechensky, Eduard Gorbunov, Evgeniya A. Vorontsova, Daniil Selikhanovych, César A. Uribe, Bo Jiang, Haoyue Wang, Shuzhong Zhang, Sébastien Bubeck, Qijia Jiang, Yin Tat Lee, Yuanzhi Li, Aaron Sidford:
Near Optimal Methods for Minimizing Convex Functions with Lipschitz $p$-th Derivatives. COLT 2019: 1392-1393 - [c8]Alexey Kroshnin, Nazarii Tupitsa, Darina Dvinskikh, Pavel E. Dvurechensky, Alexander V. Gasnikov, Cesar A. Uribe:
On the Complexity of Approximating Wasserstein Barycenters. ICML 2019: 3530-3540 - [c7]Fedor S. Stonyakin, Darina Dvinskikh, Pavel E. Dvurechensky, Alexey Kroshnin, Olesya Kuznetsova, Artem Agafonov, Alexander V. Gasnikov, Alexander Tyurin, César A. Uribe, Dmitry Pasechnyuk, Sergei Artamonov:
Gradient Methods for Problems with Inexact Model of the Objective. MOTOR 2019: 97-114 - [i12]Alexey Kroshnin, Darina Dvinskikh, Pavel E. Dvurechensky, Alexander V. Gasnikov, Nazarii Tupitsa, César A. Uribe:
On the Complexity of Approximating Wasserstein Barycenter. CoRR abs/1901.08686 (2019) - [i11]Sergey Guminov, Pavel E. Dvurechensky, Alexander V. Gasnikov:
Accelerated Alternating Minimization. CoRR abs/1906.03622 (2019) - 2018
- [c6]Cesar A. Uribe, Darina Dvinskikh, Pavel E. Dvurechensky, Alexander V. Gasnikov, Angelia Nedic:
Distributed Computation of Wasserstein Barycenters Over Networks. CDC 2018: 6544-6549 - [c5]Pavel E. Dvurechensky, Alexander V. Gasnikov, Alexey Kroshnin:
Computational Optimal Transport: Complexity by Accelerated Gradient Descent Is Better Than by Sinkhorn's Algorithm. ICML 2018: 1366-1375 - [c4]Pavel E. Dvurechenskii, Darina Dvinskikh, Alexander V. Gasnikov, César A. Uribe, Angelia Nedich:
Decentralize and Randomize: Faster Algorithm for Wasserstein Barycenters. NeurIPS 2018: 10783-10793 - [i10]Pavel E. Dvurechensky, Alexander V. Gasnikov, Alexey Kroshnin:
Computational Optimal Transport: Complexity by Accelerated Gradient Descent Is Better Than by Sinkhorn's Algorithm. CoRR abs/1802.04367 (2018) - [i9]Pavel E. Dvurechensky, Alexander V. Gasnikov, Eduard Gorbunov:
An Accelerated Method for Derivative-Free Smooth Stochastic Convex Optimization. CoRR abs/1802.09022 (2018) - [i8]César A. Uribe, Darina Dvinskikh, Pavel E. Dvurechensky, Alexander V. Gasnikov, Angelia Nedic:
Distributed Computation of Wasserstein Barycenters over Networks. CoRR abs/1803.02933 (2018) - [i7]Pavel E. Dvurechensky, Alexander V. Gasnikov, Eduard Gorbunov:
An Accelerated Directional Derivative Method for Smooth Stochastic Convex Optimization. CoRR abs/1804.02394 (2018) - [i6]Pavel E. Dvurechensky, Darina Dvinskikh, Alexander V. Gasnikov, César A. Uribe, Angelia Nedic:
Decentralize and Randomize: Faster Algorithm for Wasserstein Barycenters. CoRR abs/1806.03915 (2018) - 2017
- [i3]Pavel E. Dvurechensky, Alexander V. Gasnikov, Alexander Tiurin:
Randomized Similar Triangles Method: A Unifying Framework for Accelerated Randomized Optimization Methods (Coordinate Descent, Directional Search, Derivative-Free Method). CoRR abs/1707.08486 (2017) - 2016
- [j2]Pavel E. Dvurechensky, Alexander V. Gasnikov:
Stochastic Intermediate Gradient Method for Convex Problems with Stochastic Inexact Oracle. J. Optim. Theory Appl. 171(1): 121-145 (2016) - [c3]Alexey Chernov, Pavel E. Dvurechensky, Alexander V. Gasnikov:
Fast Primal-Dual Gradient Method for Strongly Convex Minimization Problems with Linear Constraints. DOOR 2016: 391-403 - [c2]Pavel E. Dvurechensky, Alexander V. Gasnikov, Evgenia Gasnikova, Sergey Matsievsky, Anton Rodomanov, Inna Usik:
Primal-Dual Method for Searching Equilibrium in Hierarchical Congestion Population Games. DOOR (Supplement) 2016: 584-595 - [c1]Lev Bogolubsky, Pavel E. Dvurechensky, Alexander V. Gasnikov, Gleb Gusev, Yurii E. Nesterov, Andrei M. Raigorodskii, Aleksey Tikhonov, Maksim Zhukovskii:
Learning Supervised PageRank with Gradient-Based and Gradient-Free Optimization Methods. NIPS 2016: 4907-4915
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-08-27 19:52 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
