Related papers: An interval version of separation by semispaces in…
We develop a class of new kinetic data structures for collision detection between moving convex polytopes; the performance of these structures is sensitive to the separation of the polytopes during their motion. For two convex polygons in…
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…
Let A be a set of integers dense in a finite interval. We establish upper and lower bounds for the longest regularly-spaced and convex subsets of A and of A-A.
In this paper, we solve a separation of singularities problem in the Bergman space. More precisely, we show that if $P\subset \mathbb{C}$ is a convex polygon which is the intersection of $n$ half planes, then the Bergman space on $P$…
Let $G = V, E$ be a simple connected undirected graph. A set $X \subseteq V$ is \emph{geodesically convex} if for any pair of vertices $x, y \in X$, all vertices on all shortest paths in $G$ from $x$ to $y$ are contained in $X$. A set $H…
In this short note we provide a new proof of the recent result of Han and Nashimura on the separation of spherical convex sets established in arXiv:2002.06558. Our proof is based on a result stated in locally convex spaces.
We consider convex sets and functions over idempotent semifields, like the max-plus semifield. We show that if $K$ is a conditionally complete idempotent semifield, with completion $\bar{K}$, a convex function $K^n\to\bar{K}$ which is lower…
Detecting hidden convexity is one of the tools to address nonconvex minimization problems. After giving a formal definition of hidden convexity, we introduce the notion of conditional infimum, as it will prove instrumental in detecting…
In this paper, we study relationships between symmetric and non-symmetric separation of (not necessarily convex) cones by using separating cones of Bishop-Phelps type in real normed spaces. Besides extending some known results for the…
Quantum states that remain separable (i.e., not entangled) under any global unitary transformation are known as absolutely separable and form a convex set. Despite extensive efforts, the complete characterization of this set remains largely…
Differential completions and compactifications of differential spaces are introduced and investigated. The existence of the maximal differential completion and the maximal differential compactification is proved. A sufficient condition for…
Discrete Fenchel duality is one of the central issues in discrete convex analysis. The Fenchel-type min-max theorem for a pair of integer-valued M-natural-convex functions generalizes the min-max formulas for polymatroid intersection and…
This paper presents a piecewise convexification method to approximate the whole approximate optimal solution set of non-convex optimization problems with box constraints. In the process of box division, we first classify the sub-boxes and…
It is shown that a separated sequence of points in the unit disc of the complex plane is in fact uniformly separated, if there exists a certain intermediate sequence whose separated subsequences are uniformly separated. This property is…
This work develops a class of relaxations in between the big-M and convex hull formulations of disjunctions, drawing advantages from both. The proposed "P-split" formulations split convex additively separable constraints into P partitions…
We give a simple conceptual proof of the consistency of a test for multivariate uniformity in a bounded set $K \subset \mathbb{R}^d$ that is based on the maximal spacing generated by i.i.d. points $X_1, \ldots,X_n$ in $K$, i.e., the volume…
In this paper we prove a strong Hahn-Banach theorem: separation of disjoint convex sets by linear forms is possible without any further conditions, if the target field $\R$ is replaced by a more general real closed extension field. From…
It is known that, in finite dimensions, the support function of a compact convex set with non empty interior is differentiable excepting the origin if and only if the set is strictly convex. In this paper we realize a thorough study of the…
Motivated by recent advances in solution methods for mixed-integer convex optimization (MICP), we study the fundamental and open question of which sets can be represented exactly as feasible regions of MICP problems. We establish several…
F. Wehrung has asked: Given a family $\mathcal{C}$ of subsets of a set $\Omega$, under what conditions will there exist a total ordering on $\Omega$ under which every member of $\mathcal{C}$ is convex? <p> Note that if $A$ and $B$ are…