Related papers: From Hopf-Lax formula to optimal weak transfer pla…
We show that a class of Poincar\'e-Wirtinger inequalities on bounded convex sets can be obtained by means of the dynamical formulation of Optimal Transport. This is a consequence of a more general result valid for convex sets, possibly…
Optimal transportation of raw material from suppliers to customers is an issue arising in logistics that is addressed here with a continuous model relying on optimal transport theory. A physics informed neuralnetwork method is advocated…
In this paper, we propose a novel resource management scheme that jointly allocates the transmit power and computational resources in a centralized radio access network architecture. The network comprises a set of computing nodes to which…
We show that there is a PDE formulation in terms of Fokker-Planck equations for weak optimal transport problems. The main novelty is that we introduce a minimization problem involving Fokker-Planck equations in the extended sense of…
In this paper, the existence of weak solutions of a convective Cahn-Hilliard equation with degenerate mobility is studied. We first define a notion of weak solutions and establish a regularized problems. The existence of such solutions is…
We simplify the geometric interpretation of the weak Ma-Trudinger-Wang condition for regularity in optimal transportation and provide a geometric proof of the global c-convexity of locally $c$-convex potentials when the cost function $c$ is…
We consider the compressible Navier-Stokes system with variable entropy. The pressure is a nonlinear function of the density and the entropy/potential temperature which, unlike in the Navier-Stokes-Fourier system, satisfies only the…
This paper deals with the existence of optimal transport maps for some optimal transport problems with a convex but non strictly convex cost. We give a decomposition strategy to address this issue. As part of our strategy, we have to treat…
We study an entropic optimal transport problem in which the transport plan is penalized by a nonlinear convex functional acting on the coupling. We establish existence, uniqueness, and uniform a priori bounds for minimizers, and we show…
We consider so-called branched transport and variants thereof in two space dimensions. In these models one seeks an optimal transportation network for a given mass transportation task. In two space dimensions, they are closely connected to…
We introduce a quadratically-constrained approximation (QCAC) of the AC optimal power flow (AC-OPF) problem. Unlike existing approximations like the DC-OPF, our model does not rely on typical assumptions such as high reactance-to-resistance…
We consider optimal transport based distributionally robust optimization (DRO) problems with locally strongly convex transport cost functions and affine decision rules. Under conventional convexity assumptions on the underlying loss…
This paper presents a method to obtain a convex inner approximation that aims to improve the feasibility of optimal power flow (OPF) models in distribution feeders. For a resistive distribution network, both real and reactive power effect…
We consider the problem of synthesizing optimal linear feedback policies subject to arbitrary convex constraints on the feedback matrix. This is known to be a hard problem in the usual formulations ($\Htwo,\Hinf,\LQR$) and previous works…
This paper provides characterizations of the weak solutions of optimization problems where a given vector function $F,$ from a decision space $X$ to an objective space $Y$, is "minimized" on the set of elements $x\in C$ (where $C\subset X$…
Motivated by applications to geometric inequalities, Gozlan, Roberto, Samson, and Tetali introduced a transport problem for `weak' cost functionals. Basic results of optimal transport theory can be extended to this setup in remarkable…
We address the problem of optimal transport with a quadratic cost functional and a constraint on the flux through a constriction along the path. The constriction, conceptually represented by a toll station, limits the flow rate across. We…
Many problems in power systems involve optimizing a certain objective function subject to power flow equations and engineering constraints. A long-standing challenge in solving them is the nonconvexity of their feasible sets. In this paper,…
We consider the problem of navigation with safety constraints. The safety constraints are probabilistic, where a given set is assigned a degree of safety, a number between zero and one, with zero being safe and one being unsafe. The…
We analyze the convergence behavior of \emph{globally weakly} and \emph{locally strongly contracting} dynamics. Such dynamics naturally arise in the context of convex optimization problems with a unique minimizer. We show that convergence…