Main Page: Difference between revisions
Jump to navigation
Jump to search
| Line 19: | Line 19: | ||
* [[Semidiscrete Optimal Transport]] | * [[Semidiscrete Optimal Transport]] | ||
* [[Sinkhorn's Algorithm]] | * [[Sinkhorn's Algorithm]] | ||
* [[Sliced Wasserstein Distance]] | |||
== Mathematical foundations == | == Mathematical foundations == | ||
Revision as of 09:55, 10 June 2020
Welcome to the Optimal Transport Wiki!
Here is a list of New article ideas.
The optimal transportation problem
- Monge Problem
- Kantorovich Problem
- Optimal Transport and the Monge Ampère equation
- Kantorovich Dual Problem (for general costs)
- Kantorovich Dual Problem (for c(x,y) = d(x,y)^2 where d is a metric)
The 2-Wasserstein Metric
Numerical methods for optimal transport
- Discrete Optimal Transport
- Auction Algorithm
- Semidiscrete Optimal Transport
- Sinkhorn's Algorithm
- Sliced Wasserstein Distance
Mathematical foundations
- Dual space of C_0(x) vs C_b(x)
- Convergence of Measures and Metrizability
- Fenchel-Moreau and Primal/Dual Optimization Problems