On the complexity of approximating Wasserstein barycenters A Kroshnin, N Tupitsa, D Dvinskikh, P Dvurechensky, A Gasnikov, C Uribe
International conference on machine learning, 3530-3540, 2019
120 2019 On a combination of alternating minimization and Nesterov’s momentum S Guminov, P Dvurechensky, N Tupitsa, A Gasnikov
International conference on machine learning, 3886-3898, 2021
52 2021 Multimarginal optimal transport by accelerated alternating minimization N Tupitsa, P Dvurechensky, A Gasnikov, CA Uribe
2020 59th ieee conference on decision and control (cdc), 6132-6137, 2020
29 2020 Accelerated meta-algorithm for convex optimization problems AV Gasnikov, DM Dvinskikh, PE Dvurechensky, DI Kamzolov, ...
Computational Mathematics and Mathematical Physics 61, 17-28, 2021
26 2021 Methods for Convex -Smooth Optimization: Clipping, Acceleration, and Adaptivity E Gorbunov, N Tupitsa, S Choudhury, A Aliev, P Richtárik, S Horváth, ...
arXiv preprint arXiv:2409.14989, 2024
11 2024 Primal-dual gradient methods for searching network equilibria in combined models with nested choice structure and capacity constraints M Kubentayeva, D Yarmoshik, M Persiianov, A Kroshnin, E Kotliarova, ...
Computational Management Science 21 (1), 15, 2024
7 2024 Alternating minimization methods for strongly convex optimization N Tupitsa, P Dvurechensky, A Gasnikov, S Guminov
Journal of Inverse and Ill-posed Problems 29 (5), 721-739, 2021
6 2021 Strongly convex optimization for the dual formulation of optimal transport N Tupitsa, A Gasnikov, P Dvurechensky, S Guminov
International Conference on Mathematical Optimization Theory and Operations …, 2020
4 2020 Numerical methods for large-scale optimal transport N Tupitsa, P Dvurechensky, D Dvinskikh, A Gasnikov
arXiv preprint arXiv:2210.11368, 2022
3 2022 Federated Learning Can Find Friends That Are Beneficial N Tupitsa, S Horváth, M Takáč, E Gorbunov
arXiv preprint arXiv:2402.05050, 2024
2 2024 Accelerated alternating minimization and adaptability to strong convexity N Tupitsa
arXiv preprint arXiv:2006.09097, 2020
2 2020 Remove that Square Root: A New Efficient Scale-Invariant Version of AdaGrad S Choudhury, N Tupitsa, N Loizou, S Horvath, M Takac, E Gorbunov
arXiv preprint arXiv:2403.02648, 2024
1 2024 Computational Optimal Transport N Tupitsa, P Dvurechensky, D Dvinskikh, A Gasnikov
Encyclopedia of Optimization, 1-17, 2023
1 2023 Low-Resource Machine Translation through the Lens of Personalized Federated Learning V Moskvoretskii, N Tupitsa, C Biemann, S Horváth, E Gorbunov, ...
arXiv preprint arXiv:2406.12564, 2024
2024 Byzantine-tolerant methods for distributed variational inequalities N Tupitsa, AJ Almansoori, Y Wu, M Takác, K Nandakumar, S Horváth, ...
Advances in Neural Information Processing Systems 36, 2024
2024 On accelerated adaptive methods and their modifications for alternating minimization NK Tupitsa
Computer Research and Modeling 14 (2), 497-515, 2022
2022 Методы решения задач, допускающих альтернативную минимизацию/Methods for Solving Problems That Allow Alternating Minimization NK Tupitsa