Related papers: A note on some Poincar\'e inequalities on convex s…
We introduce the proximal optimal transport divergence, a novel discrepancy measure that interpolates between information divergences and optimal transport distances via an infimal convolution formulation. This divergence provides a…
This note outlines a mean-field approach to dynamic optimal transport problems based on the recently proposed McKean-Pontryagin maximum principle. Key aspects of the proposed methodology include i) avoidance of sampling over stochastic…
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 study an optimal transport problem in a compact convex set $\Omega\subset\mathbb{R}^d$ where bulk transport is coupled to dynamic optimal transport on a metric graph $ \mathsf{G} = (\mathsf{V},\mathsf{E})$ which is embedded in $\Omega$.…
We prove existence and uniqueness results for solutions to a class of optimal transportation problems with infinitely many marginals, supported on the real line. We also provide a characterization of the solution with an explicit formula.…
This work proposes an algorithm to bound the minimum distance between points on trajectories of a dynamical system and points on an unsafe set. Prior work on certifying safety of trajectories includes barrier and density methods, which do…
We prove a Payne-Weinberger type inequality for the $p$-Laplacian Neumann eigenvalues ($p\ge 2$). The inequality provides the sharp upper bound on convex domains, in terms of the diameter alone, of the best constants in Poincar\'e…
On a convex bounded open set, we prove that Poincar\'e-Sobolev constants for functions vanishing at the boundary can be bounded from below in terms of the norm of the distance function in a suitable Lebesgue space. This generalizes a result…
We consider a class of convex optimization problems modelling temporal mass transport and mass change between two given mass distributions (the so-called dynamic formulation of unbalanced transport), where we focus on those models for which…
We characterize the symmetric measures which satisfy the one dimensional convex Poincar\'e inequality. For these measures the tenesorization argument yields concentration inequalities for their products and convex sets in R^n.
We characterise equality cases in matrix H\"older's inequality and develop a divergence formulation of optimal transport of vector measures. As an application, we reprove the representation formula for measures in the polar cone to monotone…
In this paper, we introduce methods from convex optimization to solve the multimarginal transport type problems arise in the context of density functional theory. Convex relaxations are used to provide outer approximation to the set of…
We develop an algorithmic theory of convex optimization over discrete sets. Using a combination of algebraic and geometric tools we are able to provide polynomial time algorithms for solving broad classes of convex combinatorial…
We introduce a new variant of the weak optimal transport problem where mass is distributed from one space to the other through unnormalized kernels. We give sufficient conditions for primal attainment and prove a dual formula for this…
In this paper, we extend the scope of Caffarelli's contraction theorem, which provides a measure of the Lipschitz constant for optimal transport maps between log-concave probability densities in $\R^d$. Our focus is on a broader category of…
We provide a solution method for the polyhedral convex set optimization problem, that is, the problem to minimize a set-valued mapping with polyhedral convex graph with respect to a set ordering relation which is generated by a polyhedral…
In this article, we give a trajectorial proof of a kinetic Poincar\'e inequality which plays an important role in the De Giorgi-Nash-Moser theory for kinetic equations. The present work improves a result due to J. Guerand and C. Mouhot [10]…
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…
Let $G$ be a countable discrete group with an orthogonal representation $\alpha$ on a real Hilbert space $H$. We prove $L_p$ Poincar\'e inequalities for the group measure space $L_\infty(\Omega_H,\gamma)\rtimes G$, where both the group…
The paper considers existence results of solution for a linear coupled system of Boltzmann transport equations and related inverse problem. The system models the evolution of three species of particles, photons, electrons and positrons.…