Dynamical Optimal Transport: discretization and convergence
I will present the dynamical formulation of optimal transport (a.k.a Benamou-Brenier formulation): it consists in writing the optimal transport problem as the minimization of a convex functional under a PDE constraint, and can handle a priori a vast class of cost functions and geometries. It is one of the oldest numerical method to solve the problem, and it is also the basis for a lot of extensions and generalizations of the optimal transport problem.
The optimization problem is then discretized to end up with a finite dimensional convex optimization problem. I will illustrate this method by presenting a discretization when the ground space is a surface. Although much effort has been devoted to solve efficently the discretized problem, the study of convergence under mesh refinement of the solution of the approximate problems has only been tackled recently. I will present an abstract framework guaranteeing convergence under mesh refinement, with no condition on the relative scale of the spacial and temporal mesh sizes, and even if the densities are very singular.
Tuesday, November 9, 2021
11:00AM Zoom ID 970 1854 2148
Center for Computational Mathematics9500 Gilman Dr. #0112La Jolla, CA 92093-0112Tel: (858)534-9056