Kantorovich Dual Problem (for general costs): Difference between revisions
Jump to navigation
Jump to search
| Line 5: | Line 5: | ||
==Statement of Theorem== | ==Statement of Theorem== | ||
(Kantorovich Duality) Let X and Y be Polish spaces... | (Kantorovich Duality) Let X and Y be Polish spaces, let <math>\mu \in \mathcal{P}(X)</math> and <math>\v \in \mathcal{P}(Y)</math>... | ||
==Proof of Theorem== | ==Proof of Theorem== | ||
Revision as of 21:36, 16 May 2020
Introduction
The main advantage of Kantorovich Problem, in comparison to Monge problem, is in the convex constraint property. It is possible to formulate the dual problem.
Statement of Theorem
(Kantorovich Duality) Let X and Y be Polish spaces, let and Failed to parse (unknown function "\v"): {\displaystyle \v \in \mathcal{P}(Y)} ...
Proof of Theorem
References
</ references>
- ↑ C. Villani, Topics in Optimal Transportation, Chapter 1.
- ↑ https://link-springer-com.proxy.library.ucsb.edu:9443/book/10.1007/978-3-319-20828-2 F. Santambrogio, Optimal Transport for Applied Mathematicians, Chapter 1.]