mlsanityData to 14 Oct 2026

A fast approach to optimal transport: The back-and-forth method

arXiv 1905.12154 ↗First posted 29 May 2019math.OC cs.NA math.NAcited by 16

Not on the map. Why?

Abstract (arXiv)

We present an iterative method to efficiently solve the optimal transportation problem for a class of strictly convex costs which includes quadratic and p-power costs. Given two probability measures supported on a discrete grid with n points, we compute the optimal map using O(n) storage space and O(n log(n)) operations per iteration, with an approximately exponential convergence rate. Our approach allows us to solve optimal transportation problems on spatial grids as large as 4096x4096 and 384x384x384 in a matter of minutes.

Key facts. Cited by 16 papers in the map (data through 14 Oct 2026). First posted on arXiv 29 May 2019.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2021: 2; 2022: 5; 2023: 1; 2024: 4; 2025: 4.

16 papers.

Sort: