A saddle-point approach to the Monge-Kantorovich optimal transport problem
Open Access
- 31 March 2010
- journal article
- research article
- Published by EDP Sciences in ESAIM: Control, Optimisation and Calculus of Variations
- Vol. 17 (3) , 682-704
Abstract
The Monge-Kantorovich problem is revisited by means of a variant of the saddle-point method without appealing to c-conjugates. A new abstract characterization of the optimal plans is obtained in the case where the cost function takes infinite values. It leads us to new explicit sufficient and necessary optimality conditions. As by-products, we obtain a new proof of the well-known Kantorovich dual equality and an improvement of the convergence of the minimizing sequences.Keywords
All Related Versions
This publication has 13 references indexed in Scilit:
- Optimal and better transport plansJournal of Functional Analysis, 2009
- Characterization of optimal transport plans for the Monge-Kantorovich problemProceedings of the American Mathematical Society, 2008
- Wasserstein Distance on Configuration SpacePotential Analysis, 2008
- On the sufficiency of c-cyclical monotonicity for optimality of transport plansMathematische Zeitschrift, 2007
- Monge-Kantorovitch Measure Transportation and Monge-Ampère Equation on Wiener SpaceProbability Theory and Related Fields, 2003
- Existence and stability results in the L1 theory of optimal transportation2003
- Convex Analysis and Variational Problems1999
- On c-optimal random variablesStatistics & Probability Letters, 1996
- An Introduction to Γ-Convergence1993
- Decomposition of Multivariate FunctionsCanadian Journal of Mathematics, 1992