Calculus of variations and optimal control; optimization Problem
Optimal transport and the Monge problem
Builds on Probability measurePushforward measureBorel measureMonge–Ampère equationWasserstein metric
Problem
Let and be complete separable metric spaces. Let be a Borel probability measure on and a Borel probability measure on . Let be a lower semicontinuous cost function.
- Monge problem: minimize over all Borel maps with , where is the pushforward measure .
- Kantorovich problem: minimize over all transport plans, the Borel probability measures on with marginals and .
Decide when minimizers exist, when they are unique, and when an optimal plan is given by a map.
Remarks
Monge posed the problem in 1781, in his memoir on cuttings and fillings, for the cost in . His aim was to move a pile of soil into a hole of the same volume with least total work. The Monge problem may have no admissible map at all: if is a Dirac mass and is not, no satisfies . Kantorovich introduced the relaxed problem in 1942; under the hypotheses above it always has a minimizer, by weak compactness of the set of plans and lower semicontinuity of the cost. For , , absolutely continuous and both measures with finite second moments, Brenier's theorem gives a unique optimal plan, induced by the map for a convex function . Then solves a Monge–Ampère equation in a weak sense, and the optimal cost defines the squared Wasserstein distance . For Monge's original cost in with absolutely continuous and both measures with finite first moments, optimal maps exist but are in general not unique. Evans and Gangbo proved existence under extra hypotheses in 1999, and later work removed them.
Reading path
To understand this page from the ground up, read these 9 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Borel sigma-algebra concept
- Measure concept
- Monge–Ampère equation concept
- Probability measure concept
- Pushforward measure concept
- Topological space concept
- Wasserstein metric concept
- Borel measure definition
- Optimal transport and the Monge problem problem
Further reading
About this page
| Tag | K8EBASR5VG |
|---|---|
| URI | m2://K8EBASR5VG |
| Kind | problem |
| Writing | W0 stub |
| MSC | 49Q22, 35J96, 60A10 |
| Status | This copy of the site has no build data. Run m2 status K8EBASR5VG. |
| About | Probability measure, Pushforward measure |
| Uses | Probability measure, Pushforward measure, Borel measure, Monge–Ampère equation, Wasserstein metric |
| Same as | |
| Changed | 2 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.