1 citations · 1 across the 2 of their papers we have counts for
5 papers
Numerical Methods for Large-Scale Optimal Transport
Nazarii Tupitsa, Pavel Dvurechensky, Darina Dvinskikh +1
The optimal transport (OT) problem is a classical optimization problem having the form of linear programming. Machine learning applications put forward new computational challenges…
Accelerated Alternating Minimization and Adaptability to Strong Convexity
Nazarii Tupitsa
In the first part of the paper we consider accelerated first order optimization method for convex functions with -Lipschitz-continuous gradient, that is able to automatically ad…
Multimarginal Optimal Transport by Accelerated Alternating Minimization
Nazarii Tupitsa, Pavel Dvurechensky, Alexander Gasnikov +1
We consider a multimarginal optimal transport, which includes as a particular case the Wasserstein barycenter problem. In this problem one has to find an optimal coupling between $…
Alternating Minimization Methods for Strongly Convex Optimization
Nazarii Tupitsa, Pavel Dvurechensky, Alexander Gasnikov +1
{We consider alternating minimization procedures for convex optimization problems with variable divided in many block, each block being amenable for minimization with respect to it…
On the Complexity of Approximating Wasserstein Barycenter
Alexey Kroshnin, Darina Dvinskikh, Pavel Dvurechensky +3
We study the complexity of approximating Wassertein barycenter of discrete measures, or histograms of size by contrasting two alternative approaches, both using entropic re…