Kantorovich Dual Problem (for general costs): Difference between revisions

From Optimal Transport Wiki
Jump to navigation Jump to search
Line 13: Line 13:
<references />
<references />


<ref name="Villani">[https://people.math.gatech.edu/~gangbo/Cedric-Villani.pdf C. Villani, ''Topics in Optimal Transportation'', Chapter 1.]</ref>
<ref name="Villani">[https://people.math.gatech.edu/~gangbo/Cedric-Villani.pdf C. Villani, ''Topics in Optimal Transportation'', Chapter 1.] (page 17-21)</ref>


<ref name="Santambrogio">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.]</ref>
<ref name="Santambrogio">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.]</ref>


</ references>
</ references>

Revision as of 21:50, 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 , and let a cost function be lower semi-continuous.

Proof of Theorem

References


[1]

[2]

</ references>