A linear separability criterion for sets of Euclidean space

DOI10.1007/S10957-012-0155-XMaRDI QIDQ368616zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Z. R. Gabidullina

Publication date 23 September 2013

Published in Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10957-012-0155-x

zbMATH Keywords

projectioncone of support vectorsdistance between the setsgeneralized support vectorgeneralized supporting hyperplanepseudo-separatorseparatorthickness of the separator (pseudo-separator)

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Recommendations

• scientific article; zbMATH DE number 4092239
• Regularity conditions for the linear separation of sets
• Structure of homothetic linearly separable sets in \(n\)-dimensional Euclidean space. I
• Theorems on the separability of \(\alpha\)-sets in Euclidean space
• Structure of homothetic linearly separable sets in n-dimensional euclidean space. II
• Structure of homothetic linearly separable sets in \(n\)-dimensional Euclidean space. III
• scientific article; zbMATH DE number 4124484
• The geometry of linear separability in data sets
• scientific article; zbMATH DE number 1200176
• Separability and Tight Enclosure of Point Sets

Cites work

• scientific article; zbMATH DE number 3972626 (Why is no real title available?)
• scientific article; zbMATH DE number 3750660 (Why is no real title available?)
• scientific article; zbMATH DE number 3606241 (Why is no real title available?)
• scientific article; zbMATH DE number 3802747 (Why is no real title available?)
• scientific article; zbMATH DE number 3892037 (Why is no real title available?)
• scientific article; zbMATH DE number 7092382 (Why is no real title available?)
• scientific article; zbMATH DE number 3293978 (Why is no real title available?)
• scientific article; zbMATH DE number 3388837 (Why is no real title available?)
• A theorem on strict separability of convex polyhedra and its applications in optimization
• Advances in large-margin classifiers
• Constrained optimization and image space analysis. Vol. 1: Separation of sets and optimality conditions
• Linear and Nonlinear Separation of Patterns by Linear Programming

Cited in

(16)

• scientific article; zbMATH DE number 2233588 (Why is no real title available?)
• Necessary and sufficient conditions for emptiness of the cones of generalized support vectors
• The problem of projecting the origin of Euclidean space onto the convex polyhedron
• scientific article; zbMATH DE number 1928680 (Why is no real title available?)
• Using -nets for linear separation of two sets in a Euclidean space R^d
• Structure of homothetic linearly separable sets in \(n\)-dimensional Euclidean space. III
• The extremal separation of two sets: I. General results
• The geometry of linear separability in data sets
• Proximal gradient/semismooth Newton methods for projection onto a polyhedron via the duality-gap-active-set strategy
• scientific article; zbMATH DE number 5582469 (Why is no real title available?)
• Monotonicity of Linear Separability Under Translation
• On the optimal separating hyperplane for arbitrary sets: a generalization of the SVM formulation and a convex hull approach
• Linear disjointness of coverings of affine spaces
• Support and separation properties of convex sets in finite dimension
• Stochastic separation theorems
• Design of the best linear classifier for box-constrained data sets

This page was built for publication: A linear separability criterion for sets of Euclidean space

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q368616)