2 citations · 3 across the 4 of their papers we have counts for
10 papers
-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…
Optimal transport and the Gauss curvature equation
Nestor Guillen, Jun Kitagawa
In this short note, we consider the problem of prescribing the Gauss curvature and image of the Gauss map for the graph of a function over a domain in Euclidean space. The prescrip…
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…
Inverse Iteration for the Monge-Ampère Eigenvalue Problem
Farhan Abedin, Jun Kitagawa
We present an iterative method based on repeatedly inverting the Monge-Ampère operator with Dirichlet boundary condition and prescribed right-hand side on a bounded, convex domain…
A Newton algorithm for semi-discrete optimal transport with storage fees
Mohit Bansil, Jun Kitagawa
We introduce and prove convergence of a damped Newton algorithm to approximate solutions of the semi-discrete optimal transport problem with storage fees, corresponding to a proble…
An optimal transport problem with storage fees
Mohit Bansil, Jun Kitagawa
We introduce and investigate properties of a variant of the semi-discrete optimal transport problem. In this problem, one is given an absolutely continuous source measure and cost…