Robust spherical separation

DOI10.1080/02331934.2017.1306743zbMath1375.90238OpenAlexW2598214175WikidataQ62473068 ScholiaQ62473068MaRDI QIDQ5277988

Immanuel M. Bomze, Annabella Astorino, Manlio Gaudioso, Antonio Fuduli

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 optimizationspherical separationrobust classification

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26)

Related Items (1)

Spherical separation with infinitely far center

Cites Work

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

This page was built for publication: Robust spherical separation