Semidiscrete Optimal Transport: Difference between revisions
Jump to navigation
Jump to search
Andrewgracyk (talk | contribs) No edit summary |
Andrewgracyk (talk | contribs) No edit summary |
||
| Line 7: | Line 7: | ||
<math display="block"> \max \Big\{ \int_X \varphi d\mu + \int_Y \psi d\nu : \varphi(x) + \psi(y) \leq c(x,y) \Big\} </math> | <math display="block"> \max \Big\{ \int_X \varphi d\mu + \int_Y \psi d\nu : \varphi(x) + \psi(y) \leq c(x,y) \Big\} </math> | ||
where <math> \mu, \nu </math> denote probability measures on domains <math> X, Y </math> respectively, and <math> c | where <math> \mu, \nu </math> denote probability measures on domains <math> X, Y </math> respectively, and <math> c(x,y) </math> defined over <math> X \times Y </math>. | ||
Revision as of 04:19, 2 June 2020
Semidiscrete optimal transport refers to situations in optimal transport where two input measures are considered, and one measure is a discrete measure and the other one is continuous. Hence, because only one of the two measures is discrete, we arrive at the appropriate name "semidiscrete."
Formulation of the Semidiscrete Dual Problem
In particular, we will examine semidiscrete optimal transport in the case of the dual problem. The general dual problem for continuous measures can be stated as
where denote probability measures on domains respectively, and defined over .
