Related papers: A geometric perspective on regularized optimal tra…
This paper addresses the Optimal Transport problem, which is regularized by the square of Euclidean $\ell_2$-norm. It offers theoretical guarantees regarding the iteration complexities of the Sinkhorn--Knopp algorithm, Accelerated Gradient…
Information geometry and optimal transport are two distinct geometric frameworks for modeling families of probability measures. During the recent years, there has been a surge of research endeavors that cut across these two areas and…
We consider optimal transport problems where the cost is optimized over controlled dynamics and the end time is free. Unlike the classical setting, the search for optimal transport plans also requires the identification of optimal "stopping…
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…
The article surveys inverse problems related to the twisted geodesic flows on Riemannian manifolds with boundary, focusing on the generalized ray transforms, tensor tomography, and rigidity problems. The twisted geodesic flow generalizes…
We present a minimization problem with a horizontal divergence-type constraint in the Heisenberg group. Our study explores its dual formulation and examines its relationship with the congested optimal transport problem, for $1 < p <…
We geometrically describe optimal control problems in terms of Morse families in the Hamiltonian framework. These geometric structures allow us to recover the classical first order necessary conditions for optimality and the starting point…
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…
In this work, we develop a new framework for dynamic network flow problems based on optimal transport theory. We show that the dynamic multi-commodity minimum-cost network flow problem can be formulated as a multi-marginal optimal transport…
Classical turnpikes correspond to optimal steady states which are attractors of optimal control problems. In this paper, motivated by mechanical systems with symmetries, we generalize this concept to manifold turnpikes. Specifically, the…
The optimal (Monge-Kantorovich) transportation problem is discussed from several points of view. The Lagrangian formulation extends the action of the {\em Lagrangian} $L(v,x,t)$ from the set of orbits in $\R^n$ to a set of measure-valued…
The modeling of phenomenological structure is a crucial aspect in inverse imaging problems. One emerging modeling tool in computational imaging is the optimal transport framework. Its ability to model geometric displacements across an…
This article introduces a new class of fast algorithms to approximate variational problems involving unbalanced optimal transport. While classical optimal transport considers only normalized probability distributions, it is important for…
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…
We present a definition of stochastic Hamiltonian process on finite graph via its corresponding density dynamics in Wasserstein manifold. We demonstrate the existence of stochastic Hamiltonian process in many classical discrete problems,…
We consider an optimal transportation problem with more than two marginals. We use a family of semi-Riemannian metrics derived from the mixed, second order partial derivatives of the cost function to provide upper bounds for the dimension…
Sliced optimal transport reduces optimal transport on multi-dimensional domains to transport on the line. More precisely, sliced optimal transport is the concatenation of the well-known Radon transform and the cumulative density transform,…
We introduce fast algorithms for generalized unnormalized optimal transport. To handle densities with different total mass, we consider a dynamic model, which mixes the $L^p$ optimal transport with $L^p$ distance. For $p=1$, we derive the…
A class of elliptic-hyperbolic equations is placed in the context of a geometric variational theory, in which the change of type is viewed as a change in the character of an underlying metric. A fundamental example of a metric which changes…
We introduce and discuss a simple Hamiltonian dynamical system, interpretable as a 3-body problem in the complex plane and providing the prototype of a mechanism explaining the transition from regular to irregular motions as travel on…