Related papers: Turnpike in infinite dimension

We introduce and study the turnpike property for time-varying shapes, within the viewpoint of optimal control. We focus here on second-order linear parabolic equations where the shape acts as a source term and we seek the optimal…

Let $G$ be a graph on $n$ vertices, labeled $v_1,\ldots,v_n$ and $\pi$ be a permutation on $[n]:=\{1,2,\cdots, n\}$. Suppose that each pebble $p_i$ is placed at vertex $v_{\pi(i)}$ and has destination $v_i$. During each step, a disjoint set…

We show that the fundamental groupoid~\(\Pi_1(X)\) of a locally path connected semilocally simply connected space~\(X\) can be equipped with a \emph{natural} topology so that it becomes a topological groupoid; we also justify the necessity…

The aim of this article is to show that the Monge-Kantorovich problem is the limit of a sequence of entropy minimization problems when a fluctuation parameter tends down to zero. We prove the convergence of the entropic values to the…

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…

In this paper, given a topological space $X$, an interval $I\subseteq {\bf R}$ and five continuous functions $\varphi, \psi, \omega :X\to {\bf R}$, $\alpha, \beta:I\to {\bf R}$, we are interested in the infimum of the function $\Phi:X\to…

Let $\mathcal{I}$ be a meager ideal on $\mathbf{N}$. We show that if $x$ is a sequence with values in a separable metric space then the set of subsequences [resp. permutations] of $x$ which preserve the set of $\mathcal{I}$-cluster points…

We present a novel feasibility criteria for the finite intersection of convex sets given by inequalities. This criteria allows us to easily assert the feasibility by analyzing the unconstrained minimum of a speci?fic convex function, that…

We define several topological spaces whose points are quivers with a given infinite vertex set $X$. In the special case when $X$ is countably infinite, we show that two of the spaces of interest are homeomorphic to the Baire space…

We study the convergence of entropically regularized optimal transport to optimal transport. The main result is concerned with the convergence of the associated optimizers and takes the form of a large deviations principle quantifying the…

Inverse limits, unlike direct limits, can in general be void, [1]. The existence of fixed points for arbitrary mappings $T : X \longrightarrow X$ is conjectured to be equivalent with the fact that related direct limits of all finite…

We consider the action of an irreducible outer automorphism $\phi$ on the closure of Culler--Vogtmann Outer space. This action has north-south dynamics and so, under iteration, points converge exponentially to $[T^\phi_+]$. For each $N \geq…

This paper presents, using dynamical system theory, a framework for investigating the turnpike property in nonlinear optimal control. First, it is shown that a turnpike-like property appears in general dynamical systems with hyperbolic…

We focus on entropy admissible solutions of scalar conservation laws in one space dimension and establish new regularity results with respect to time. First, we assume that the flux function $f$ is strictly convex and show that, for every $…

We prove that, if the closed unit ball of a normed space $X$ has sufficiently many extreme points, then every mapping $\Phi$ from $X$ into itself with the following property is affine: For any pair of points in $X$, there exists a (not…

This paper presents a simulation study on turnpike phenomena in stochastic optimal control problems. We employ the framework of Polynomial Chaos Expansions (PCE) to investigate the presence of turnpikes in stochastic LQ problems. Our…

Given an $n$-vertex non-negatively real-weighted graph $G$, whose vertices are partitioned into a set of $k$ clusters, a \emph{clustered network design problem} on $G$ consists of solving a given network design optimization problem on $G$,…

In any graph, the maximum size of an induced path is bounded by the maximum size of a path. However, in the general case, one cannot find a converse bound, even up to an arbitrary function, as evidenced by the case of cliques. Galvin, Rival…

In this article, we first consider solutions to a semilinear elliptic problem in divergence form \begin{equation*} \begin{cases} -\varepsilon^2\text{div}(K(x)\nabla u)= (u-q|\ln\varepsilon|)^{p}_+,\ \ &x\in \Omega,\\ u=0,\ \ &x\in\partial…

Given $n+1$ unit vectors in $\mathbf{R}^n$ or $\mathbf{C}^n,$ consider the absolute values of the determinants of the vectors taken $n$ at a time. By taking a geometric perspective, we show that the minimum of these determinants is…