Margin maximization in spherical separation

DOI10.1007/s10589-012-9486-7zbMath1258.90066OpenAlexW2052290961WikidataQ62473094 ScholiaQ62473094MaRDI QIDQ1928756

Manlio Gaudioso, Annabella Astorino, Antonio Fuduli

Publication date: 4 January 2013

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10589-012-9486-7

zbMATH Keywords

DCADC functionsperical separation

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Nonlinear programming (90C30)

Related Items (22)

Robust spherical separation ⋮ The DTC (difference of tangentially convex functions) programming: optimality conditions ⋮ On numerical solving the spherical separability problem ⋮ Classification in the multiple instance learning framework via spherical separation ⋮ Spherical separation with infinitely far center ⋮ A proximal bundle method for nonsmooth DC optimization utilizing nonconvex cutting planes ⋮ An incremental piecewise linear classifier based on polyhedral conic separation ⋮ Partitional clustering via successive transportation problems ⋮ Ellipsoidal classification via semidefinite programming ⋮ A redistributed bundle algorithm based on local convexification models for nonlinear nonsmooth DC programming ⋮ DC programming and DCA: thirty years of developments ⋮ A DC optimization-based clustering technique for edge detection ⋮ An illumination problem: optimal apex and optimal orientation for a cone of light ⋮ Double Bundle Method for finding Clarke Stationary Points in Nonsmooth DC Programming ⋮ Semisupervised spherical separation ⋮ Stochastic sub-sampled Newton method with variance reduction ⋮ A maximum-margin multisphere approach for binary multiple instance learning ⋮ A splitting bundle approach for non-smooth non-convex minimization ⋮ Support vector machine polyhedral separability in semisupervised learning ⋮ Optimal replenishment order placement in a finite time horizon ⋮ Polyhedral separation via difference of convex (DC) programming ⋮ Edge detection by spherical separation

Uses Software

• UCI-ml
• SVMlight
• LIBSVM

Cites Work

• DC models for spherical separation
• A fixed-center spherical separation algorithm with kernel transformations for classification problems
• The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
• An Affine-Scaling Interior-Point Method for Continuous Knapsack Constraints with Application to Support Vector Machines
• 10.1162/15324430260185583
• A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
• Minimizing Nonconvex Nonsmooth Functions via Cutting Planes and Proximity Control
• Ellipsoidal separation for classification problems
• Max–min separability
• On the convergence of a modified version of SVM^lightalgorithm
• Polyhedral separability through successive LP
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Margin maximization in spherical separation