Kantorovich Dual Problem (for general costs)

From Optimal Transport Wiki
Jump to navigation Jump to search

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 on such that for all measurable sets and , , , and define to be the set of all measurable functions Failed to parse (unknown function "\math"): {\displaystyle (\varphi, \psi) \in L^{1}(d\mu) \times L^{1}(d\nu) <\math> satisfying <math> \varphi(x)+\psi(y) \leq c(x,y) } .

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)