Separation via polyhedral conic functions
From MaRDI portal
Publication:5481682
DOI10.1080/10556780600723252zbMath1113.90095OpenAlexW1986734868MaRDI QIDQ5481682
Gurkan Ozturk, Rafail N. Gasimov
Publication date: 10 August 2006
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556780600723252
Related Items (18)
Robust spherical separation ⋮ A conic scalarization method in multi-objective optimization ⋮ Conic scalarization approach to solve multi-choice multi-objective transportation problem with interval goal ⋮ A polyhedral conic functions based classification method for noisy data ⋮ An incremental piecewise linear classifier based on polyhedral conic separation ⋮ Visual object detection using cascades of binary and one-class classifiers ⋮ Conic Scalarization Method in Multiobjective Optimization and Relations with Other Scalarization Methods ⋮ Generalized derivatives and optimality conditions in nonconvex optimization ⋮ Nonlinear Cone Separation Theorems in Real Topological Linear Spaces ⋮ A novel piecewise linear classifier based on polyhedral conic and max-min separabilities ⋮ A coradiant based scalarization to characterize approximate solutions of vector optimization problems with variable ordering structures ⋮ Optimization approaches to supervised classification ⋮ Semisupervised spherical separation ⋮ Clustering based polyhedral conic functions algorithm in classification ⋮ Duality in nonconvex vector optimization ⋮ O-PCF algorithm for one-class classification ⋮ Support vector machine polyhedral separability in semisupervised learning ⋮ Existence and characterization theorems in nonconvex vector optimization
Uses Software
Cites Work
- Unnamed Item
- On the complexity of polyhedral separability
- Unsupervised and supervised data classification via nonsmooth and global optimization (with comments and rejoinder)
- A global optimization approach to classification
- A Parametric Optimization Method for Machine Learning
- Mathematical Programming for Data Mining: Formulations and Challenges
- Max–min separability
- Polyhedral separability through successive LP
This page was built for publication: Separation via polyhedral conic functions