Showing 2020Show all
3 papers · 1 filter
math.OC2020
-transport with discrete target as a combinatorial matching problem
Mohit Bansil, Jun Kitagawa
In this short note, we show that given a cost function , any coupling of two probability measures where the second is a discrete measure can be associated to a certain bipar…
math.OC2020
Computational Semi-Discrete Optimal Transport with General Storage Fees
Mohit Bansil
We propose and analyze a modified damped Newton algorithm to solve the semi-discrete optimal transport with storage fees. We prove global linear convergence for a wide range of sto…
math.AP2020
Quantitative stability in the geometry of semi-discrete optimal transport
Mohit Bansil, Jun Kitagawa
We show quantitative stability results for the geometric "cells" arising in semi-discrete optimal transport problems. Our results show two types of stability, the first is stabilit…