A theorem on strict separability of convex polyhedra and its applications in optimization
From MaRDI portal
Publication:535082
DOI10.1007/s10957-010-9767-1zbMath1226.90068OpenAlexW1966987264WikidataQ58336428 ScholiaQ58336428MaRDI QIDQ535082
Publication date: 11 May 2011
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-010-9767-1
Related Items (6)
A linear separability criterion for sets of Euclidean space ⋮ The problem of projecting the origin of Euclidean space onto the convex polyhedron ⋮ Unnamed Item ⋮ Penumbras and separation of convex sets ⋮ 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A recursive method for the investigation of the linear separability of two sets
- Separation of a finite set in \(\mathbb{R}^ d\) by spanned hyperplanes
- An iterative algorithm learning the maximal margin classifier.
- Some recent advances in projection-type methods for variational inequalities
- Extensions of Mappings into n-Cubes
- Finding the Point of a Polyhedron Closest to the Origin
- Separable nonlinear least squares: the variable projection method and its applications
- On Projection Algorithms for Solving Convex Feasibility Problems
- Maximal Separation Theorems for Convex Sets
This page was built for publication: A theorem on strict separability of convex polyhedra and its applications in optimization
