Graph-theoretic perspectives on splitting methods for sparse optimal transport
Jacob Lindbäck ⋅ Mikael Johansson
Abstract
We study the local behavior of splitting methods for sparse optimal transport. By leveragingfinite-time identification properties, we relate the algorithms’ local convergence behavior to graph-theoretic properties of the solution. This connection offers insights into suitable stepsize choices,which we use to design a simple stepsize heuristic. We demonstrate the efficiency and robustnessof the heuristic on a range of experiments.
Chat is not available.
Successful Page Load