A saddle-point approach to the Monge-Kantorovich optimal transport problem
Probability
2013-08-02 v1 Functional Analysis
Optimization and Control
Abstract
The Monge-Kantorovich problem is revisited by means of a variant of the saddle-point method without appealing to -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
Cite
@article{arxiv.1308.0214,
title = {A saddle-point approach to the Monge-Kantorovich optimal transport problem},
author = {Christian Léonard},
journal= {arXiv preprint arXiv:1308.0214},
year = {2013}
}