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

From Optimal Transport Wiki
Jump to navigation Jump to search
Line 18: Line 18:
Then <math> inf_{\Pi(\mu,\nu)} I[\pi] = sup_{\Phi_{c}} J(\varphi,\psi) </math>. <br>
Then <math> inf_{\Pi(\mu,\nu)} I[\pi] = sup_{\Phi_{c}} J(\varphi,\psi) </math>. <br>


Moreover, the infimum <math> inf_{\Pi(\mu,\nu)} I[\pi] </math> is attained. It is possible to restrict <math> \varphi </math> and <math> \psi </math> to be continuous and bounded.
Moreover, the infimum <math> inf_{\Pi(\mu,\nu)} I[\pi] </math> is attained. In addition it is possible to restrict <math> \varphi </math> and <math> \psi </math> to be continuous and bounded.


==Proof of Theorem==
==Proof of Theorem==

Revision as of 23:16, 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. Whenever and , define

.

Define to be the set of Borel probability measures on such that for all measurable sets and ,

, ,

and define to be the set of all measurable functions satisfying for almost everywhere in X and almost everywhere in Y.

Then .

Moreover, the infimum is attained. In addition it is possible to restrict and to be continuous and bounded.

Proof of Theorem

References


[1]

[2]

</ references>

  1. C. Villani, Topics in Optimal Transportation, Chapter 1. (pages 17-21)
  2. 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.] (pages 9-16)