Related papers: On the quadratic barycentric transport problem
The optimal transport and Wasserstein barycenter of Gaussian distributions have been solved. In literature, the closed form formulas of the Monge map, the Wasserstein distance and the Wasserstein barycenter have been given. Moreover, when…
We consider the problem of optimal transportation with quadratic cost between a empirical measure and a general target probability on R d , with d $\ge$ 1. We provide new results on the uniqueness and stability of the associated optimal…
In this note, we propose polynomial-time algorithms solving the Monge and Kantorovich formulations of the $\infty$-optimal transport problem in the discrete and finite setting. It is the first time, to the best of our knowledge, that…
In this Doctoral Dissertation we propose new variational principles for traffic assignment problems. So to find equillibrium we have to solve large-scale convex optimization problem of special (multilevel) type. We propose different…
We address the Monge problem in metric spaces with a geodesic distance: (X, d) is a Polish space and dN is a geodesic Borel distance which makes (X,dN) a possibly branching geodesic space. We show that under some assumptions on the…
We consider the problem of transporting \nota{one probability measure into another through} the flow of a given driftless control-affine system. Under suitable regularity conditions, the controllability of the system by means of open-loop…
What is the optimal way to deform a projective hypersurface into another one? In this paper we will answer this question adopting the point of view of measure theory, introducing the optimal transport problem between complex algebraic…
This paper introduces two variational formulations for a model of robust optimal transport, that is, the problem of designing optimal transport networks that are resilient to potential damages, balancing construction costs against the…
In this paper we use a traveling wave reduction or a so-called spatial approximation to comprehensively investigate the periodic solutions of the complex cubic-quintic Ginzburg-Landau equation. The primary tools used here are Hopf…
The dynamical formulation of the optimal transport can be extended through various choices of the underlying geometry (kinetic energy), and the regularization of density paths (potential energy). These combinations yield different…
This article generalizes the study of branched/ramified optimal transportation to those with capacity constraints. Each admissible transport network studied here is represented by a transport multi-path between measures, with a capacity…
We explore the geometry of the Bures-Wasserstein space for potentially degenerate Gaussian measures on a separable Hilbert space. In this general setting, the optimal transport map is formally the subgradient of a convex function that is…
The dual problem of optimal transportation in Lorentz-Finsler geometry is studied. It is shown that in general no solution exists even in the presence of an optimal coupling. Under natural assumptions dual solutions are established. It is…
This article introduces a generalization of the discrete optimal transport, with applications to color image manipulations. This new formulation includes a relaxation of the mass conservation constraint and a regularization term. These two…
Quadratic flows have the unique property of uniform strain and are commonly used in turbulence modeling and hydrodynamic analysis. While previous application focused on two-dimensional homogeneous fluid, this study examines the geometric…
We study the computational complexity of optimally solving multi-robot path planning problems on planar graphs. For four common time- and distance-based objectives, we show that the associated path optimization problems for multiple robots…
With the growing attention towards developing the multimodal transport system to enhance urban mobility, there is an increasing need to construct new, rebuild or expand existing infrastructure to facilitate existing and accommodate newly…
During recent decades, there has been a substantial development in optimal mass transport theory and methods. In this work, we consider multi-marginal problems wherein only partial information of each marginal is available, which is a setup…
We propose an efficient federated dual decomposition algorithm for calculating the Wasserstein barycenter of several distributions, including choosing the support of the solution. The algorithm does not access local data and uses only…
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…