A linear separability criterion for sets of Euclidean space

DOI10.1007/s10957-012-0155-xzbMath1272.90088WikidataQ58336427 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

projection; cone of support vectors; distance between the sets; generalized support vector; generalized supporting hyperplane; pseudo-separator; separator; thickness of the separator (pseudo-separator)

Mathematics Subject Classification ID

90C30: Nonlinear programming

Related Items

Proximal gradient/semismooth Newton methods for projection onto a polyhedron via the duality-gap-active-set strategy, Design of the best linear classifier for box-constrained data sets, 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, Support and separation properties of convex sets in finite dimension

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