Pages that link to "Item:Q368616"
From MaRDI portal
The following pages link to A linear separability criterion for sets of Euclidean space (Q368616):
Displaying 12 items.
- Using \(\varepsilon\)-nets for linear separation of two sets in a Euclidean space \(\mathbb R^d\) (Q269155) (← links)
- The extremal separation of two sets: I. General results (Q425912) (← links)
- Structure of homothetic linearly separable sets in \(n\)-dimensional Euclidean space. III (Q1816292) (← links)
- Design of the best linear classifier for box-constrained data sets (Q2091432) (← links)
- Stochastic separation theorems (Q2292236) (← links)
- Necessary and sufficient conditions for emptiness of the cones of generalized support vectors (Q2341097) (← links)
- The problem of projecting the origin of Euclidean space onto the convex polyhedron (Q2412941) (← links)
- The geometry of linear separability in data sets (Q2497241) (← links)
- Support and separation properties of convex sets in finite dimension (Q3390301) (← links)
- (Q5321078) (← links)
- Linear disjointness of coverings of affine spaces (Q5961638) (← links)
- Proximal gradient/semismooth Newton methods for projection onto a polyhedron via the duality-gap-active-set strategy (Q6176299) (← links)
