The back-and-forth method for Wasserstein gradient flows

6Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

We present a method to efficiently compute Wasserstein gradient flows. Our approach is based on a generalization of the back-and-forth method (BFM) introduced in Jacobs and Léger [Numer. Math. 146 (2020) 513-544.]. to solve optimal transport problems. We evolve the gradient flow by solving the dual problem to the JKO scheme. In general, the dual problem is much better behaved than the primal problem. This allows us to efficiently run large scale gradient flows simulations for a large class of internal energies including singular and non-convex energies.

References Powered by Scopus

The Porous Medium Equation : Mathematical Theory

1251Citations
N/AReaders
Get full text

The variational formulation of the Fokker-Planck equation

1143Citations
N/AReaders
Get full text

Polar factorization and monotone rearrangement of vector‐valued functions

1135Citations
N/AReaders
Get full text

Cited by Powered by Scopus

Renormalization group flow as optimal transport

13Citations
N/AReaders
Get full text

Efficient natural gradient descent methods for large-scale pde-based optimization problems*

9Citations
N/AReaders
Get full text

A dynamic mass transport method for Poisson-Nernst-Planck equations

8Citations
N/AReaders
Get full text

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Cite

CITATION STYLE

APA

Jacobs, M., Lee, W., & Léger, F. (2021). The back-and-forth method for Wasserstein gradient flows. ESAIM - Control, Optimisation and Calculus of Variations, 27. https://doi.org/10.1051/cocv/2021029

Readers' Seniority

Tooltip

Researcher 2

67%

PhD / Post grad / Masters / Doc 1

33%

Readers' Discipline

Tooltip

Mathematics 2

67%

Engineering 1

33%

Save time finding and organizing research with Mendeley

Sign up for free