Recommendations
- Separating hyperplanes of convex sets
- Separation of convex sets
- Separation of convex polyhedral sets with column parameters
- scientific article; zbMATH DE number 1775225
- Separation in the polytope algebra
- Separation of convex sets by extreme hyperplanes
- Separation of convex cones and extremal problems
- scientific article; zbMATH DE number 5044189
- Conic separation for vector optimization problems
- Separation and approximation of polyhedral objects
Cites work
- A Parametric Optimization Method for Machine Learning
- A global optimization approach to classification
- Introduction to machine learning.
- Mathematical Programming for Data Mining: Formulations and Challenges
- Max–min separability
- On the complexity of polyhedral separability
- Polyhedral separability through successive LP
- Unsupervised and supervised data classification via nonsmooth and global optimization (with comments and rejoinder)
Cited in
(39)- Generalized derivatives and optimality conditions in nonconvex optimization
- A conic scalarization method in multi-objective optimization
- scientific article; zbMATH DE number 139795 (Why is no real title available?)
- Nonlinear strict cone separation theorems in real normed spaces
- Conic scalarization method in multiobjective optimization and relations with other scalarization methods
- Robust spherical separation
- On the problem polyhedral separability: a numerical solution
- scientific article; zbMATH DE number 742976 (Why is no real title available?)
- Separation of two sets by piecewise linear function
- Robust separation of multiple sets.
- scientific article; zbMATH DE number 5066290 (Why is no real title available?)
- Conic separation of finite sets. II: The non-homogeneous case
- A polyhedral conic functions based classification method for noisy data
- Existence and characterization theorems in nonconvex vector optimization
- Polyhedral separability through successive LP
- Conic separation of finite sets. I: The homogeneous case
- Duality in nonconvex vector optimization
- Optimization approaches to supervised classification
- Nonlinear Cone Separation Theorems in Real Topological Linear Spaces
- Semisupervised spherical separation
- An incremental piecewise linear classifier based on polyhedral conic separation
- Separating support hyperplanes for a pair of convex polyhedral sets
- Ellipsoidal separation for classification problems
- Max–min separability
- Supervised data classification via max-min separability
- Conic scalarization approach to solve multi-choice multi-objective transportation problem with interval goal
- Maximum-margin polyhedral separation for binary multiple instance learning
- An approach to classification based on separation of sets by means of several ellipsoids
- Lower bounds for the number of hyperplanes separating two finite sets of points
- Support vector machine polyhedral separability in semisupervised learning
- Strict polynomial separation of two sets
- O-PCF algorithm for one-class classification
- Exact separation of k-projection polytope constraints
- A coradiant based scalarization to characterize approximate solutions of vector optimization problems with variable ordering structures
- Visual object detection using cascades of binary and one-class classifiers
- Polyhedral separation via difference of convex (DC) programming
- A novel piecewise linear classifier based on polyhedral conic and max-min separabilities
- Clustering based polyhedral conic functions algorithm in classification
- Separation of finitely many convex sets and data pre-classification
This page was built for publication: Separation via polyhedral conic functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5481682)
