Optimal Transport Wiki: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
No edit summary |
||
| Line 4: | Line 4: | ||
Here is a list of [[New article ideas]]. | Here is a list of [[New article ideas]]. | ||
Contact Katy Craig if you would like to contribute to this wiki. | Contact Katy Craig if you would like to contribute to this wiki. | ||
Revision as of 03:23, 28 September 2020
Welcome to the Optimal Transport Wiki!
Here is a list of New article ideas.
Contact Katy Craig if you would like to contribute to this wiki.
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
- Geodesics and generalized geodesics
- Formal Riemannian Structure of the Wasserstein metric
- Asymptotic equivalence of W_2 and H^-1
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
- Fenchel-Rockafellar and Linear Programming