A linear separability criterion for sets of Euclidean space

DOI10.1007/s10957-012-0155-xzbMath1272.90088OpenAlexW2072784147WikidataQ58336427 ScholiaQ58336427MaRDI QIDQ368616

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)

Related Items (5)

The problem of projecting the origin of Euclidean space onto the convex polyhedron ⋮ Proximal gradient/semismooth Newton methods for projection onto a polyhedron via the duality-gap-active-set strategy ⋮ Support and separation properties of convex sets in finite dimension ⋮ Design of the best linear classifier for box-constrained data sets ⋮ Necessary and sufficient conditions for emptiness of the cones of generalized support vectors

Cites Work

• A theorem on strict separability of convex polyhedra and its applications in optimization
• Constrained optimization and image space analysis. Vol. 1: Separation of sets and optimality conditions
• Linear and Nonlinear Separation of Patterns by Linear Programming
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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