Related papers: A class of multi-marginal c-cyclically monotone se…
In this short note, we show that given a cost function $c$, any coupling $\pi$ of two probability measures where the second is a discrete measure can be associated to a certain bipartite graph containing a perfect matching, based on the…
Necessary and sufficient conditions for convexity and strong convexity, respectively, of sublevel sets that are defined by finitely many real-valued $C^{1,1}$-maps are presented. A novel characterization of strongly convex sets in terms of…
We study the convergence rate of Sinkhorn's algorithm for solving entropy-regularized optimal transport problems when at least one of the probability measures, $\mu$, admits a density over $\mathbb{R}^d$. For a semi-concave cost function…
We develop a "metrically selfdual" variational calculus for $c$-monotone vector fields between general manifolds $X$ and $Y$, where $c$ is a coupling on $X\times Y$. Remarkably, many of the key properties of classical monotone operators…
The optimal transport problem has recently developed into a powerful framework for various applications in estimation and control. Many of the recent advances in the theory and application of optimal transport are based on regularizing the…
We consider the multi-marginal optimal transport of aligning several compactly supported marginals on the Heisenberg group to minimize the total cost, which we take to be the sum of the squared Carnot-Carath\'eodory distances from the…
The goal of the present work is three-fold. The first goal is to set foundational results on optimal transport in Lorentzian (pre-)length spaces, including cyclical monotonicity, stability of optimal couplings and Kantorovich duality…
Motivated by the grid search method and Bayesian optimization, we introduce the concept of contractibility and its applications in model-based optimization. First, a basic framework of contraction methods is established to construct a…
We present new min-max relations in digraphs between the number of paths satisfying certain conditions and the order of the corresponding cuts. We define these objects in order to capture, in the context of solving the half-integral linkage…
This paper discusses a more general contractive condition for a class of extended cyclic self-mappings on the union of a finite number of subsets of a metric space which are allowed to have a finite number of successive images in the same…
In this letter we study the proximal gradient dynamics. This recently-proposed continuous-time dynamics solves optimization problems whose cost functions are separable into a nonsmooth convex and a smooth component. First, we show that the…
We consider maps $T$ solving the optimal transport problem with a cost $c(x-y)$ modeled on the $p$-cost. For H\"older continuous marginals, we prove a $C^{1,\alpha}$-partial regularity result for $T $in the set $\{|T(x)-x|>0\}$.
We introduce a model of infinite horizon linear dynamic optimization and obtain results concerning existence of solution and satisfaction of the competitive condition and transversality condition being unconditionally sufficient for…
We shall prove new contraction properties of general transportation costs along nonnegative measure-valued solutions to Fokker-Planck equations in $R^d$, when the drift is a monotone (or $\lambda$-monotone) operator. A new duality approach…
We consider the problem of optimal transportation with general cost between a empirical measure and a general target probability on R d , with d $\ge$ 1. We extend results in [19] and prove asymptotic stability of both optimal transport…
We study the regularity of solutions to an optimal transportation problem where the dimension of the source is larger than that of the target. We demonstrate that if the target is $c$-convex, then the source has a canonical foliation whose…
Capacity constrained optimal transport is a variant of optimal transport, which adds extra constraints on the set of feasible couplings in the original optimal transport problem to limit the mass transported between each pair of source and…
We study the Monge--Kantorovich problem with one-dimensional marginals $\mu$ and $\nu$ and the cost function $c = \min\{l_1, \ldots, l_n\}$ that equals the minimum of a finite number $n$ of affine functions $l_i$ satisfying certain…
In the past decade, we had developed a series of splitting contraction algorithms for separable convex optimization problems, at the root of the alternating direction method of multipliers. Convergence of these algorithms was studied under…
We construct a family of monotone and convex $C^1$ integro cubic splines under a strictly convex position of the dataset. Then, we find an optimal spline by considering its approximation properties. Finally, we give some examples to…