Related papers: Pseudo-cones and measure transport
We derive the breakdown point for solutions of semi-discrete optimal transport problems, which characterizes the robustness of the multivariate quantiles based on optimal transport proposed in \cite{GS}. We do so under very mild…
Consider a real-valued function that can only be observed with stochastic noise at a finite set of design points within a Euclidean space. We wish to determine whether there exists a convex function that goes through the true function…
This paper proposes an intrinsic pseudospectral convexification framework for optimal control problems with manifold constraints. While successive pseudospectral convexification combines spectral collocation with successive convexification,…
A nonempty closed convex set in ${\mathbb R}^n$, not containing the origin, is called a pseudo-cone if with every $x$ it also contains $\lambda x$ for $x\ge 1$. We consider pseudo-cones with a given recession cone $C$, called…
Let $(X,d,m)$ be a proper, non-branching, metric measure space. We show existence and uniqueness of optimal transport maps for cost written as non-decreasing and strictly convex functions of the distance, provided $(X,d,m)$ satisfies a new…
On compact manifolds which are not simply connected, we prove the existence of "fake" solutions to the optimal transportion problem. These maps preserve volume and arise as the exponential of a closed 1 form, hence appear geometrically like…
Classic optimal transport theory is formulated through minimizing the expected transport cost between two given distributions. We propose the framework of distorted optimal transport by minimizing a distorted expected cost, which is the…
We show that a certain entropy-like function is convex, under an optimal transport problem that is adapted to Ricci flow. We use this to reprove the monotonicity of Perelman's reduced volume.
We give a necessary and sufficient condition on the cost function so that the map solution of Monge's optimal transportation problem is continuous for arbitrary smooth positive data. This condition was first introduced by Ma, Trudinger and…
The inverse radiative transfer problem finds broad applications in medical imaging, atmospheric science, astronomy, and many other areas. This problem intends to recover the optical properties, denoted as absorption and scattering…
A function is exponentially concave if its exponential is concave. We consider exponentially concave functions on the unit simplex. In a previous paper we showed that gradient maps of exponentially concave functions provide solutions to a…
Continuity of the value of the martingale optimal transport problem on the real line w.r.t. its marginals was recently established in Backhoff-Veraguas and Pammer [2] and Wiesel [21]. We present a new perspective of this result using the…
This paper concerns the reconstruction of a scalar coefficient of a second-order elliptic equation in divergence form posed on a bounded domain from internal data. This theory finds applications in multi-wave imaging, greedy methods to…
We are interested in the Wasserstein distance between two probability measures on $\R^n$ sharing the same copula $C$. The image of the probability measure $dC$ by the vectors of pseudo-inverses of marginal distributions is a natural…
Consider the problem of optimally matching two measures on the circle, or equivalently two periodic measures on the real line, and suppose the cost of matching two points satisfies the Monge condition. We introduce a notion of locally…
We study the optimal transport problem in sub-Riemannian manifolds where the cost function is given by the square of the sub-Riemannian distance. Under appropriate assumptions, we generalize Brenier-McCann's Theorem proving existence and…
In this paper, we investigate optimal (partial) transport problems for which the target is a non-convex polygonal domain in \(\mathbb{R}^2\). For the complete optimal transport problem, we prove that the singular set is locally a smooth…
We provide a unified framework for a systematic analysis of the existence of solutions to general nonconvex problems, relying on asymptotic and retractive cones for functions and sets. Using this framework we develop new necessary and…
In its most general form, the optimal transport problem is an infinite-dimensional optimization problem, yet certain notable instances admit closed-form solutions. We identify the common source of this tractability as \textit{symmetry} and…
A characterization of the proximal normal cone is obtained and a separation theorem for convex subsets of Riemannian manifolds is established. Moreover, the convexity of the distance function $d_S$ for a convex subset $S$ in the cases where…