Related papers: Separation of Convex Sets via Barrier Cones
The separation of two sets (or more specific of two cones) plays an important role in different fields of mathematics such as variational analysis, convex analysis, convex geometry, optimization. In the paper, we derive some new results for…
We present a concise proof for the supporting hyperplane theorem. We then observe that the proof not only establishes the supporting hyperplane theorem but also extends it to a hyperplane separation theorem for certain non-convex sets. The…
A subset X of a vector space V is said to have the "Separation Property" if it separates linear forms in the following sense: given a pair (a, b) of linearly independent forms on V there is a point x on X such that a(x)=0 and b(x) is not…
We study separation of a closed box from a max-min convex set by max-min semispace. This can be regarded as an interval extension of known separation results. We give a constructive proof of the separation in the case when the box and the…
In this paper, we derive some new results for the separation of two not necessarily convex cones by a (convex) cone / conical surface in real (reflexive) normed spaces. In essence, we follow the nonlinear and nonsymmetric separation…
A family of $k$ point sets in $d$ dimensions is well-separated if the convex hulls of any two disjoint subfamilies can be separated by a hyperplane. Well-separation is a strong assumption that allows us to conclude that certain kinds of…
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…
The concept of separation by hyperplanes is fundamental for convex geometry and its tropical (max-plus) analogue. However, analogous separation results in max-min convex geometry are based on semispaces. This paper answers the question…
In this paper, we deal with analytic and geometric properties of orthogonally convex sets. We establish a Blaschke-type theorem for path-connected and orthogonally convex sets in the plane using orthogonally convex paths. The separation of…
We give some sufficient conditions of separation of two sets of integer points by a hyperplane. Our conditions are related to the notion of convexity of sets of integer points and are weaker than existing notions.
In this paper we first extend from normed spaces to locally convex spaces some characterizations of denting points in convex sets. On the other hand, we also prove that in an infrabarreled locally convex space a point in a convex set is…
The paper considers the minimization of a separable convex function subject to linear ascending constraints. The problem arises as the core optimization in several resource allocation scenarios, and is a special case of an optimization of a…
Tree convex sets refer to a collection of sets such that each set in the collection is a subtree of a tree whose nodes are the elements of these sets. They extend the concept of row convex sets each of which is an interval over a total…
The present work considers the properties of classes of generally convex sets in the plane known as $1$-semiconvex and weakly $1$-semiconvex. More specifically, the examples of open and closed weakly $1$-semiconvex but non $1$-semiconvex…
We introduce and study a generalized concept of boundedness of a subset of a normed vector space with respect to a cone, which is defined as lower boundedness of the images of the underlying set through all the positive functionals of the…
Given a convex set and an interior point close to the boundary, we prove the existence of a supporting hyperplane whose distance to the point is controlled, in a dimensionally quantified way, by the thickness of the convex set in the…
A convex optimization problem in conic form involves minimizing a linear functional over the intersection of a convex cone and an affine subspace. In some cases, it is possible to replace a conic formulation using a certain cone, with a…
In this note we characterize isoperimetric regions inside almost-convex cones. More precisely, as in the case of convex cones, we show that isoperimetric sets are given by intersecting the cone with a ball centered at the origin.
Decomposition techniques for linear programming are difficult to extend to conic optimization problems with general non-polyhedral convex cones because the conic inequalities introduce an additional nonlinear coupling between the variables.…
We introduce the cone of completely-positive functions, a subset of the cone of positive-type functions, and use it to fully characterize maximum-density distance-avoiding sets as the optimal solutions of a convex optimization problem. As a…