AbstractLet S be a convex subset of a Banach space L, and G a subset of L∗. We prove that if G does a good job of separating points in S from convex subsets of S, then any point outside of S can be separated from S by a linear combination of at most three members of G
AbstractIn this note we study the separation of two convex sets in the straight line spaces introduc...
Given a finite n-element set X, a family of subsets F ⊂ 2X is said to separate X if any two element...
AbstractWe derive from Motzkin’s Theorem that a point can be strongly separated by a hyperplane from...
AbstractLet S be a convex subset of a Banach space L, and G a subset of L∗. We prove that if G does ...
AbstractFirst we give some elementary properties of the core of a subset relative to a linear subspa...
We prove new theorems which describe a necessary and sufficient condition for linear (strong and non...
We prove new theorems which describe a necessary and sufficient condition for linear (strong and non...
AbstractIn this paper we provide a ball separation property of bounded convex sets in a Hilbert spac...
We prove new theorems which describe a necessary and sufficient condition for linear (strong and non...
A convex subset B of a real locally convex space X is said to have the separation property if it can...
The separation theorems are the key results for convex programming. They are important consequences ...
AbstractThis is the second of a series of three papers dealing with convexity spaces. In the first p...
investigating the strength of set existence axioms needed for separable Banach space theory. We show...
The paper studies separation properties for subsets of the space (Formula presented.) of normlinear ...
The paper studies separation properties for subsets of the space (Formula presented.) of normlinear ...
AbstractIn this note we study the separation of two convex sets in the straight line spaces introduc...
Given a finite n-element set X, a family of subsets F ⊂ 2X is said to separate X if any two element...
AbstractWe derive from Motzkin’s Theorem that a point can be strongly separated by a hyperplane from...
AbstractLet S be a convex subset of a Banach space L, and G a subset of L∗. We prove that if G does ...
AbstractFirst we give some elementary properties of the core of a subset relative to a linear subspa...
We prove new theorems which describe a necessary and sufficient condition for linear (strong and non...
We prove new theorems which describe a necessary and sufficient condition for linear (strong and non...
AbstractIn this paper we provide a ball separation property of bounded convex sets in a Hilbert spac...
We prove new theorems which describe a necessary and sufficient condition for linear (strong and non...
A convex subset B of a real locally convex space X is said to have the separation property if it can...
The separation theorems are the key results for convex programming. They are important consequences ...
AbstractThis is the second of a series of three papers dealing with convexity spaces. In the first p...
investigating the strength of set existence axioms needed for separable Banach space theory. We show...
The paper studies separation properties for subsets of the space (Formula presented.) of normlinear ...
The paper studies separation properties for subsets of the space (Formula presented.) of normlinear ...
AbstractIn this note we study the separation of two convex sets in the straight line spaces introduc...
Given a finite n-element set X, a family of subsets F ⊂ 2X is said to separate X if any two element...
AbstractWe derive from Motzkin’s Theorem that a point can be strongly separated by a hyperplane from...
DOI
Add to ORKG