Non-smoothness in classification problems

DOI10.1080/10556780802264071zbMath1154.90643OpenAlexW2084250957WikidataQ62473104 ScholiaQ62473104MaRDI QIDQ3605194

Enrico Gorgone, Annabella Astorino, Antonio Fuduli

Publication date: 23 February 2009

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

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

zbMATH Keywords

classificationnon-smooth optimizationseparation of sets

Mathematics Subject Classification ID

Applications of mathematical programming (90C90)

Related Items (12)

Robust spherical separation ⋮ Supervised classification and mathematical optimization ⋮ Spherical separation with infinitely far center ⋮ An incremental piecewise linear classifier based on polyhedral conic separation ⋮ Diagonal bundle method with convex and concave updates for large-scale nonconvex and nonsmooth optimization ⋮ Diagonal bundle method for nonsmooth sparse optimization ⋮ Semisupervised spherical separation ⋮ Diagonal discrete gradient bundle method for derivative free nonsmooth optimization ⋮ A splitting bundle approach for non-smooth non-convex minimization ⋮ Support vector machine polyhedral separability in semisupervised learning ⋮ Limited memory discrete gradient bundle method for nonsmooth derivative-free optimization ⋮ Edge detection by spherical separation

This page was built for publication: Non-smoothness in classification problems