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

From Optimal Transport Wiki
Jump to navigation Jump to search
Line 9: Line 9:
\newline
\newline
<math> I[\pi]= \int_{X\times Y} c(x,y) d\pi(x,y), \quad J(\varphi,\psi)=\int_{X}\varphi(x)d\mu(x)+\int_{Y}\psi(y) d\nu(y) </math>.
<math> I[\pi]= \int_{X\times Y} c(x,y) d\pi(x,y), \quad J(\varphi,\psi)=\int_{X}\varphi(x)d\mu(x)+\int_{Y}\psi(y) d\nu(y) </math>.
Define <math> \Pi(\mu,\nu) </math> to be the set of Borel probability measures <math> \pi <\math> on <math> X\times Y <\math> such that for all measurable sets


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

Revision as of 22:41, 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 \newline .

Define to be the set of Borel probability measures <math> \pi <\math> on <math> X\times Y <\math> such that for all measurable sets

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)