Related papers: On supporting hyperplanes to convex bodies
Let $\mathcal{P}$ be a set of points in the plane, and $\mathcal{S}$ a strictly convex set of points. In this note, we show that if $\mathcal{P}$ contains many translates of $\mathcal{S}$, then these translates must come from a generalized…
In this paper we study two basic facts of optimal transportation on Wiener space W. Our first aim is to answer to the Monge Problem on the Wiener space endowed with the Sobolev type norm (k,gamma) to the power of p (cases p = 1 and p > 1…
Recently geometric hypergraphs that can be defined by intersections of pseudohalfplanes with a finite point set were defined in a purely combinatorial way. This led to extensions of earlier results about points and halfplanes to…
In this paper we establish a general framework in which the verification of support theorems for generalized convex functions acting between an algebraic structure and an ordered algebraic structure is still possible. As for the domain…
This paper aims to improve the reliability of optimal control using models constructed by machine learning methods. Optimal control problems based on such models are generally non-convex and difficult to solve online. In this paper, we…
We introduce complex intersection bodies and show that their properties and applications are similar to those of their real counterparts. In particular, we generalize Busemann's theorem to the complex case by proving that complex…
We prove that for two-component maps in dimension two, rank-one convexity is equivalent to quasiconvexity. The essential tool for the proof is a fixed-point argument for a suitable set-valued map going from one component to the other that…
We prove an estimate for arbitrary measure of sections of convex bodies. The proof is based on a stability result for intersection bodies.
We prove that stability -- a strong quasiconvexity property -- pulls back under proper actions on proper metric spaces. This result has several applications, including that convex cocompact subgroups of both mapping class groups and outer…
We discuss the optimization problem for minimizing the $(n-1)$-volume of the intersection of a convex cone $K$ in $\Bbb R^n$ with a hyperplane through a given point, first considered in \cite{We}. We give a geometric characterization of the…
This paper addresses the problem of a boundary control design for traffic evolving in a large-scale urban network. The traffic state is described on a macroscopic scale and corresponds to the vehicle density, whose dynamics are governed by…
We survey the (old and new) regularity theory for the Monge-Amp\`ere equation, show its connection to optimal transportation, and describe the regularity properties of a general class of Monge-Amp\`ere type equations arising in that…
In the first part of this paper, we consider, in the context of an arbitrary hyperplane arrangement, the map between compactly supported cohomology to the usual cohomology of a local system. A formula (i.e., an explicit algebraic de Rham…
We extend recent computer-assisted design and analysis techniques for first-order optimization over structured functions--known as performance estimation--to apply to structured sets. We prove "interpolation theorems" for smooth and…
This paper studies a vertical powered descent problem in the context of planetary landing, considering glide-slope and thrust pointing constraints and minimizing any final cost. In a first time, it proves the Max-Min-Max or Max-Singular-Max…
In this paper, the problem of reaching formation for a network of rigid agents over a special orthogonal group is investigated by considering bearing-only constraints as the desired formation. Each agent is able to gather the measurements…
Recently, Kronqvist et al.~\cite{KronqvistLundellWesterlund2016} rediscovered the supporting hyperplane algorithm of Veinott~\cite{Veinott1967} and demonstrated its computational benefits for solving convex mixed-integer nonlinear programs.…
We establish that solving an optimal transportation problem in which the source and target densities are defined on manifolds with different dimensions, is equivalent to solving a new nonlocal analog of the Monge-Amp\`ere equation,…
Suppose that each proper subset of a set $S$ of points in a vector space is contained in the union of planes of specified dimensions, but $S$ itself is not contained in any such union. How large can $|S|$ be? We prove a general upper bound…
Optimal transport has found numerous applications across data science, many of which require differentiating the optimal transport map with respect to the underlying probability densities in the Fr\'echet sense. In this work, we show that…