A theorem on strict separability of convex polyhedra and its applications in optimization
From MaRDI portal
Publication:535082
The author gives necessary and sufficient conditions of strict separability of convex polyhedra and presents many applications in optimization.
Recommendations
- Separation theorems for convex polytopes and finitely-generated cones derived from theorems of the alternative
- Separation of convex cones and extremal problems
- scientific article; zbMATH DE number 5044189
- Optimization and approximation for polyhedra in separable Hilbert spaces
- On the separation of parametric convex polyhedral sets with application in MOLP.
- scientific article; zbMATH DE number 1383191
- On a calculation of an arbitrary separating hyperplane of convex polyhedral sets
- scientific article; zbMATH DE number 3222564
- scientific article; zbMATH DE number 1228304
- scientific article; zbMATH DE number 4042544
Cites work
- A recursive method for the investigation of the linear separability of two sets
- An iterative algorithm learning the maximal margin classifier.
- Extensions of Mappings into n-Cubes
- Finding the Point of a Polyhedron Closest to the Origin
- scientific article; zbMATH DE number 3972626 (Why is no real title available?)
- scientific article; zbMATH DE number 1391397 (Why is no real title available?)
- scientific article; zbMATH DE number 3366028 (Why is no real title available?)
- scientific article; zbMATH DE number 2233588 (Why is no real title available?)
- Maximal Separation Theorems for Convex Sets
- On Projection Algorithms for Solving Convex Feasibility Problems
- Separable nonlinear least squares: the variable projection method and its applications
- Separation of a finite set in \(\mathbb{R}^ d\) by spanned hyperplanes
- Some recent advances in projection-type methods for variational inequalities
Cited in
(9)- Exact separation of k-projection polytope constraints
- 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
- The problem of projecting the origin of Euclidean space onto the convex polyhedron
- A linear separability criterion for sets of Euclidean space
- Separation theorems for convex polytopes and finitely-generated cones derived from theorems of the alternative
- Separating hyperplanes of convex sets
- A data mining algorithm via decentralized optimization in parallel or distributed systems: mathematical aspects
This page was built for publication: A theorem on strict separability of convex polyhedra and its applications in optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q535082)
