Related papers: Separation of Convex Sets via Barrier Cones

In Euclidean spaces, every closed, bounded, convex set can be characterized by two equivalent notions of separation properties. This is not true in general for arbitrary Banach spaces. In this work, we present a ball separation…

This paper mainly focuses on cones whose basis is a maximum $h$-scattered linear set. We start by investigating the intersection sizes of such cones with the hyperplanes. Then we analyze two constructions of point sets with few intersection…

A convex subset X of a linear topological space is called compactly convex if there is a continuous compact-valued map $\Phi:X\to exp(X)$ such that $[x,y]\subset\Phi(x)\cup \Phi(y)$ for all $x,y\in X$. We prove that each convex subset of…

This paper consists of four general parts: convex sets; convex functions; convex optimization; and the interior-point algorithm. I will start by introducing the definition of convex sets and give three common convex set examples which will…

Building sets were introduced in the study of wonderful compactifications of hyperplane arrangement complements and were later generalized to finite meet-semilattices. Convex geometries, the duals of antimatroids, offer a robust…

In this paper, we propose a method for image-set classification based on convex cone models. Image set classification aims to classify a set of images, which were usually obtained from video frames or multi-view cameras, into a target…

We consider the problem of lower bounding a generalized Minkowski measure of subsets of a convex body with a log-concave probability measure, conditioned on the set size. A bound is given in terms of diameter and set size, which is sharp…

Self-concordance is the most important property required for barriers in convex programming. It is intrinsically linked to the affine structure of the underlying space. Here we introduce an alternative notion of self-concordance which is…

Let $P$ be a set of $n$ points in general position on the plane. A set of closed convex polygons with vertices in $P$, and with pairwise disjoint interiors is called a convex decomposition of $P$ if their union is the convex hull of $P$,…

In this paper we consider convex subsets of locally-convex topological vector spaces. Given a fixed point in such a convex subset, we show that there exists a curve completely contained in the convex subset and leaving the point in a given…

For a continuous flow on a compact metric space, the aim of this paper is to prove a Conley-type decomposition of the strong chain recurrent set. We first discuss in details the main properties of strong chain recurrent sets. We then…

We establish new metric characterizations for the norm (respectively, ultraweak) closure of the convex hull of a bounded set in an arbitrary $C^*$-algebra (respectively, von Neumann algebra), and provide applications of these results to the…

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…

We study how the supporting hyperplanes produced by the projection process can complement the method of alternating projections and its variants for the convex set intersection problem. For the problem of finding the closest point in the…

This paper considers the problem of smoothing convex functions and sets, seeking the nearest smooth convex function or set to a given one. For convex cones and sublinear functions, a full characterization of the set of all optimal…

We give a conjectural description for the cone of effective divisors of the Grothendieck-Knudsen moduli space of stable rational curves with n marked points. Namely, we introduce new combinatorial structures called hypertrees and show they…

This paper deals with $\varepsilon$-efficient and $\varepsilon$-properly efficient points with respect to a co-radiant set in vector optimization problems. In the first part of the paper, we establish a new nonlinear separation theorem for…

This paper presents a selected tour through the theory and applications of lifts of convex sets. A lift of a convex set is a higher-dimensional convex set that projects onto the original set. Many convex sets have lifts that are…

We study convex subsets of buildings, discuss some structural features and derive several characterizations of buildings.

A polarity notion for sets in a Banach space is introduced in such a way that the second polar of a set coincides with the smallest strongly convex set with respect to R that contains it. Strongly convex sets are characterized in terms of…