Minimal convex extensions and finite difference discretization of the quadratic Monge-Kantorovich problem - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Article Dans Une Revue European Journal of Applied Mathematics Année : 2019

Minimal convex extensions and finite difference discretization of the quadratic Monge-Kantorovich problem

Résumé

We present an adaptation of the MA-LBR scheme to the Monge-Ampère equation with second boundary value condition, provided the target is a convex set. This yields a fast adaptive method to numerically solve the Optimal Transport problem between two absolutely continuous measures, the second of which has convex support. The proposed numerical method actually captures a specific Brenier solution which is minimal in some sense. We prove the convergence of the method as the grid stepsize vanishes and we show with numerical experiments that it is able to reproduce subtle properties of the Optimal Transport problem.
Fichier principal
Vignette du fichier
MABV2final.pdf (3.69 Mo) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-01616842 , version 1 (15-10-2017)
hal-01616842 , version 2 (31-10-2017)
hal-01616842 , version 3 (17-07-2018)

Identifiants

Citer

Jean-David Benamou, Vincent Duval. Minimal convex extensions and finite difference discretization of the quadratic Monge-Kantorovich problem. European Journal of Applied Mathematics, In press, ⟨10.1017/S0956792518000451⟩. ⟨hal-01616842v3⟩
485 Consultations
361 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More