Computational Optimal Transport: Complexity by Accelerated Gradient Descent Is Better Than by Sinkhorn's Algorithm (Q6297660)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Computational Optimal Transport: Complexity by Accelerated Gradient Descent Is Better Than by Sinkhorn's Algorithm |
preprint article from arXiv
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computational Optimal Transport: Complexity by Accelerated Gradient Descent Is Better Than by Sinkhorn's Algorithm |
preprint article from arXiv |
Statements
12 February 2018
0 references
cs.DS
0 references
math.OC
0 references
Pavel Dvurechensky
0 references
Alexander Gasnikov
0 references
Alexey Kroshnin
0 references
