Related papers: A note on some Poincar\'e inequalities on convex s…
The goal of the present paper is to discuss new transport inequalities for convex measures. We retrieve some dimensional forms of Brascamp-Lieb inequalities. We also give some quantitative forms involving the Wasserstein's distances.
We investigate the approximation of Monge--Kantorovich problems on general compact metric spaces, showing that optimal values, plans and maps can be effectively approximated via a fully discrete method. First we approximate optimal values…
One revisits the standard saddle-point method based on conjugate duality for solving convex minimization problems. Our aim is to reduce or remove unnecessary topological restrictions on the constraint set. Dual equalities and…
We adapt the problem of continuous congested optimal transport to the Heisenberg group, equipped with a sub-Riemannian metric. Originally introduced in the Euclidean setting by Carlier, Jimenez, and Santambrogio as a path-dependent variant…
In this note, we extend the regularity theory for monotone measure-preserving maps, also known as optimal transports for the quadratic cost optimal transport problem, to the case when the support of the target measure is an arbitrary convex…
We propose new variational principles for traffic assignment problems. So to find equillibrium we have to solve large-scale convex optimization problem of special type. We propose some kind of "algebra" on different models and corresponding…
Optimal mass transport, also known as the earth mover's problem, is an optimization problem with important applications in various disciplines, including economics, probability theory, fluid dynamics, cosmology and geophysics to cite a few.…
Regularising the primal formulation of optimal transport (OT) with a strictly convex term leads to enhanced numerical complexity and a denser transport plan. Many formulations impose a global constraint on the transport plan, for instance…
We study the Lagrangian formulation of a class of the Monge-Kantorovich optimal transportation problem. It can be considered a stochastic optimal transportation problem for absolutely continuous stochastic processes. A cost function and…
We study the fundamental computational problem of approximating optimal transport (OT) equations using neural differential equations (Neural ODEs). More specifically, we develop a novel framework for approximating unbalanced optimal…
We propose a volumetric formulation for computing the Optimal Transport problem defined on surfaces in $\mathbb{R}^3$, found in disciplines like optics, computer graphics, and computational methodologies. Instead of directly tackling the…
We use Lyapunov-like functions and convex optimization to propagate uncertainty in the initial condition of nonlinear systems governed by ordinary differential equations. We consider the full nonlinear dynamics without approximation,…
We investigate the existence of periodic solutions for a class of nonlocal continuity equations, which include mean-field equations derived from systems of coupled oscillators. While periodic solutions at the particle level have been…
In this paper, we propose a new Fully Composite Formulation of convex optimization problems. It includes, as a particular case, the problems with functional constraints, max-type minimization problems, and problems of Composite…
We show that the inverse problems for a class of kinetic equations can be solved by classical tools in PDE analysis including energy estimates and the celebrated averaging lemma. Using these tools, we give a unified framework for the…
Dynamical formulations of optimal transport (OT) frame the task of comparing distributions as a variational problem which searches for a path between distributions minimizing a kinetic energy functional. In applications, it is frequently…
A sharp Poincar\'e-type inequality is derived for the restriction of the Gaussian measure on the boundary of a convex set. In particular, it implies a Gaussian mean-curvature inequality and a Gaussian iso second-variation inequality. The…
The aim of this note is to show that Poincar\'e inequalities imply corresponding weighted versions in a quite general setting. Fractional Poincar\'e inequalities are considered, too. The proof is short and does not involve covering…
A basic idea in optimal transport is that optimizers can be characterized through a geometric property of their support sets called cyclical monotonicity. In recent years, similar "monotonicity principles" have found applications in other…
We study a rather general class of optimal "ballistic" transport problems for matrix-valued measures. These problems naturally arise, in the spirit of \emph{Y. Brenier. Comm. Math. Phys. (2018) 364(2) 579-605}, from a certain dual…