Robust spherical separation

DOI10.1080/02331934.2017.1306743MaRDI QIDQ5277988zbMATH OpenOpenAlexWikidataFDO

Authors Immanuel M. Bomze, Annabella Astorino, A. Fuduli, Manlio Gaudioso

Publication date 12 July 2017

Published in Optimization (Search for Journal in Brave)

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

zbMATH Keywords

non-smooth optimizationrobust classificationspherical separation

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26)

Recommendations

• DC models for spherical separation
• Margin maximization in spherical separation
• Semisupervised spherical separation
• Spherical separation with infinitely far center
• Set separation problems and global optimization.

Cites work

• A fixed-center spherical separation algorithm with kernel transformations for classification problems
• A sequential algorithm for sparse support vector classifiers
• Binary classification via spherical separator by DC programming and DCA
• Chance constrained uncertain classification via robust optimization
• DC models for spherical separation
• Edge detection by spherical separation
• Estimating the support of a high-dimensional distribution
• Margin maximization in spherical separation
• Max–min separability
• Minimizing Nonconvex Nonsmooth Functions via Cutting Planes and Proximity Control
• Model selection for primal SVM
• Multi-instance classification through spherical separation and VNS
• Non-smoothness in classification problems
• Nonconvex separation theorems and some applications in vector optimization
• Robust classification and regression using support vector machines
• Robust convex optimization
• Robust solutions of uncertain linear programs
• Robust Solutions to Least-Squares Problems with Uncertain Data
• Robust Solutions to Uncertain Semidefinite Programs
• Robust support vector machines for classification and computational issues
• Second order mathematical programming formulations for discriminant analysis
• Semismooth and Semiconvex Functions in Constrained Optimization
• Separation of convex sets by Clarke subdifferential
• Separation via polyhedral conic functions
• Set-valued optimization. An introduction with applications
• Supervised classification and mathematical optimization
• Support vector data description
• Synergies of operations research and data mining
• Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
• The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
• Two-group classification via a biobjective margin maximization model

Cited in

(5)

• Margin maximization in spherical separation
• Spherical separation with infinitely far center
• Semisupervised spherical separation
• The separating spherical belt with the maximum ratio of radii
• DC models for spherical separation

This page was built for publication: Robust spherical separation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5277988)