Skip to Main content Skip to Navigation

Optimal transport: discretization and algorithms

Abstract : This chapter describes techniques for the numerical resolution of optimal transport problems. We will consider several discretizations of these problems, and we will put a strong focus on the mathematical analysis of the algorithms to solve the discretized problems. We will describe in detail the following discretizations and corresponding algorithms: the assignment problem and Bertsekas auction's algorithm; the entropic regularization and Sinkhorn-Knopp's algorithm; semi-discrete optimal transport and Oliker-Prussner or damped Newton's algorithm, and finally semi-discrete entropic regularization. Our presentation highlights the similarity between these algorithms and their connection with the theory of Kantorovich duality.
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-02494446
Contributor : Quentin Mérigot <>
Submitted on : Friday, February 28, 2020 - 5:10:37 PM
Last modification on : Sunday, March 29, 2020 - 1:09:19 AM

Files

chap-to.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-02494446, version 1
  • ARXIV : 2003.00855

Collections

Citation

Quentin Merigot, Boris Thibert. Optimal transport: discretization and algorithms. 2020. ⟨hal-02494446⟩

Share

Metrics

Record views

64

Files downloads

51