Max–min separability

DOI10.1080/10556780512331318263zbMath1129.90059OpenAlexW2000752850MaRDI QIDQ5317750

Adil M. Bagirov

Publication date: 21 September 2005

Published in: Optimization Methods and Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10556780512331318263

zbMATH Keywords

algorithmerror functionnonsmooth optimizationnonconvex optimizationdiscrete gradient methodmax-min separability

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Minimax problems in mathematical programming (90C47) Nonlinear programming (90C30) Nonsmooth analysis (49J52)

Related Items (13)

Robust spherical separation ⋮ Supervised classification and mathematical optimization ⋮ A polyhedral conic functions based classification method for noisy data ⋮ Alternating multiconlitron: a novel framework for piecewise linear classification ⋮ Margin maximization in spherical separation ⋮ An incremental piecewise linear classifier based on polyhedral conic separation ⋮ A partially inexact bundle method for convex semi-infinite minmax problems ⋮ An effective method to determine whether a point is within a convex hull and its generalized convex polyhedron classifier ⋮ Optimization approaches to supervised classification ⋮ Codifferential method for minimizing nonsmooth DC functions ⋮ Clustering based polyhedral conic functions algorithm in classification ⋮ Separation via polyhedral conic functions ⋮ Support vector machine polyhedral separability in semisupervised learning

Uses Software

• C4.5

Cites Work

• Misclassification minimization
• UOBYQA: unconstrained optimization by quadratic approximation
• A global optimization approach to classification
• Semismooth and Semiconvex Functions in Constrained Optimization
• On the Conversion of Optimization Problems with Max-Min Constraints to Standard Optimization Problems
• Continuous selections of linear functions and nonsmooth critical point theory
• A Parametric Optimization Method for Machine Learning
• Minmaxmin problems revisited
• A Method for Minimization of Quasidifferentiable Functions
• Breast Cancer Diagnosis and Prognosis Via Linear Programming
• Mathematical Programming for Data Mining: Formulations and Challenges
• Massive data discrimination via linear support vector machines
• A numerical method for finding best guaranteed estimates
• Polyhedral separability through successive LP

This page was built for publication: Max–min separability