A theorem on strict separability of convex polyhedra and its applications in optimization
From MaRDI portal
Publication:535082
DOI10.1007/S10957-010-9767-1zbMATH Open1226.90068DBLPjournals/jota/Gabidullina11OpenAlexW1966987264WikidataQ58336428 ScholiaQ58336428MaRDI QIDQ535082FDOQ535082
Authors: Z. R. Gabidullina 
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
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
- On Projection Algorithms for Solving Convex Feasibility Problems
- Title not available (Why is that?)
- Separable nonlinear least squares: the variable projection method and its applications
- Title not available (Why is that?)
- Finding the Point of a Polyhedron Closest to the Origin
- Some recent advances in projection-type methods for variational inequalities
- 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.
- Extensions of Mappings into n-Cubes
- Maximal Separation Theorems for Convex Sets
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (8)
- 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
- Separating hyperplanes of convex sets
- Separation theorems for convex polytopes and finitely-generated cones derived from theorems of the alternative
- Penumbras and separation of convex sets
- Exact separation of \(k\)-projection polytope constraints
- A linear separability criterion for sets of Euclidean space
- Design of the best linear classifier for box-constrained data sets
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)
