Separation via polyhedral conic functions
From MaRDI portal
Publication:5481682
DOI10.1080/10556780600723252zbMATH Open1113.90095OpenAlexW1986734868MaRDI QIDQ5481682FDOQ5481682
Gurkan Ozturk, Rafail N. Gasimov
Publication date: 10 August 2006
Published in: Optimization Methods \& Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556780600723252
Cites Work
- Title not available (Why is that?)
- On the complexity of polyhedral separability
- Unsupervised and supervised data classification via nonsmooth and global optimization (with comments and rejoinder)
- Polyhedral separability through successive LP
- Mathematical Programming for Data Mining: Formulations and Challenges
- Max–min separability
- A global optimization approach to classification
- A Parametric Optimization Method for Machine Learning
Cited In (28)
- A conic scalarization method in multi-objective optimization
- Nonlinear strict cone separation theorems in real normed spaces
- Title not available (Why is that?)
- Robust spherical separation
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the problem polyhedral separability: a numerical solution
- A polyhedral conic functions based classification method for noisy data
- Existence and characterization theorems in nonconvex vector optimization
- Polyhedral separability through successive LP
- 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
- Maximum-margin polyhedral separation for binary multiple instance learning
- Conic scalarization approach to solve multi-choice multi-objective transportation problem with interval goal
- Support vector machine polyhedral separability in semisupervised learning
- O-PCF algorithm for one-class classification
- Conic Scalarization Method in Multiobjective Optimization and Relations with Other Scalarization Methods
- 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
- Clustering based polyhedral conic functions algorithm in classification
- A novel piecewise linear classifier based on polyhedral conic and max-min separabilities
- Generalized derivatives and optimality conditions in nonconvex optimization
Uses Software
Recommendations
- Separation and approximation of polyhedral objects 👍 👎
- Conic separation for vector optimization problems 👍 👎
- Separation of convex sets by extreme hyperplanes 👍 👎
- Separation of convex cones and extremal problems 👍 👎
- Separation of convex sets 👍 👎
- Separation in the polytope algebra 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
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)
