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

Abstract : 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.
Document type :
Journal articles
Complete list of metadatas

https://hal.inria.fr/hal-01616842
Contributor : Vincent Duval <>
Submitted on : Tuesday, July 17, 2018 - 4:04:24 PM
Last modification on : Monday, March 18, 2019 - 9:23:04 AM
Long-term archiving on : Monday, October 1, 2018 - 3:49:05 AM

Files

MABV2final.pdf
Files produced by the author(s)

Identifiers

Données associées

Collections

Citation

Jean-David Benamou, Vincent Duval. Minimal convex extensions and finite difference discretization of the quadratic Monge-Kantorovich problem. European Journal of Applied Mathematics, Cambridge University Press (CUP), In press, ⟨10.1017/S0956792518000451⟩. ⟨hal-01616842v3⟩

Share

Metrics

Record views

354

Files downloads

150