Abstract We study Benamou’s domain decomposition algorithm for optimal transport in the entropy regularized setting. The key observation is that variant converges to globally solution under very mild assumptions. prove linear convergence of with respect Kullback–Leibler divergence and illustrate (potentially slow) rates numerical examples. On problems sufficient geometric structure (such as Was...