Skip to Main Content

Mathematics of Computation

Published by the American Mathematical Society since 1960 (published as Mathematical Tables and other Aids to Computation 1943-1959), Mathematics of Computation is devoted to research articles of the highest quality in computational mathematics.

ISSN 1088-6842 (online) ISSN 0025-5718 (print)

The 2020 MCQ for Mathematics of Computation is 1.78.

What is MCQ? The Mathematical Citation Quotient (MCQ) measures journal impact by looking at citations over a five-year period. Subscribers to MathSciNet may click through for more detailed information.

 

Approximation of optimal transport problems with marginal moments constraints
HTML articles powered by AMS MathViewer

by Aurélien Alfonsi, Rafaël Coyaud, Virginie Ehrlacher and Damiano Lombardi HTML | PDF
Math. Comp. 90 (2021), 689-737 Request permission

Abstract:

Optimal transport (OT) problems arise in a wide range of applications, from physics to economics. Getting a numerical approximate solution of these problems is a challenging issue of practical importance. In this work, we investigate the relaxation of the OT problem when the marginal constraints are replaced by some moment constraints. Using Tchakaloff’s theorem, we show that the moment constrained optimal transport problem (MCOT) is achieved by a finite discrete measure. Interestingly, for multimarginal OT problems, the number of points weighted by this measure scales linearly with the number of marginal laws, which is encouraging to bypass the curse of dimension. This approximation method is also relevant for Martingale OT problems. We show the convergence of the MCOT problem toward the corresponding OT problem. In some fundamental cases, we obtain rates of convergence in $O(1/n)$ or $O(1/n^2)$ where $n$ is the number of moments, which illustrates the role of the moment functions. Last, we present algorithms exploiting the fact that the MCOT is reached by a finite discrete measure and provide numerical examples of approximations.
References
Similar Articles
  • Retrieve articles in Mathematics of Computation with MSC (2010): 49M25, 65K10
  • Retrieve articles in all journals with MSC (2010): 49M25, 65K10
Additional Information
  • Aurélien Alfonsi
  • Affiliation: Université Paris-Est, CERMICS (ENPC), INRIA, F-77455 Marne-la-Vallée, France
  • Email: aurelien.alfonsi@enpc.fr
  • Rafaël Coyaud
  • Affiliation: Université Paris-Est, CERMICS (ENPC), INRIA, F-77455 Marne-la-Vallée, France
  • ORCID: 0000-0003-0886-5634
  • Email: rafael.coyaud@enpc.fr
  • Virginie Ehrlacher
  • Affiliation: Université Paris-Est, CERMICS (ENPC), INRIA, F-77455 Marne-la-Vallée, France
  • MR Author ID: 958960
  • Email: virginie.ehrlacher@enpc.fr
  • Damiano Lombardi
  • Affiliation: INRIA Paris and Sorbonne Universités, UPMC Univ Paris 6, UMR 7598 LJLL, F-75589 Paris Cedex 12, France
  • MR Author ID: 932089
  • Email: damiano.lombardi@inria.fr
  • Received by editor(s): May 24, 2019
  • Received by editor(s) in revised form: April 22, 2020
  • Published electronically: October 23, 2020
  • Additional Notes: The first author benefited from the support of the “Chaire Risques Financiers”, Fondation du Risque.
    The Labex Bézout is acknowledged for funding the Ph.D. thesis of the second author.
  • © Copyright 2020 American Mathematical Society
  • Journal: Math. Comp. 90 (2021), 689-737
  • MSC (2010): Primary 49M25, 65K10
  • DOI: https://doi.org/10.1090/mcom/3568
  • MathSciNet review: 4194160