DC models for spherical separation

DOI10.1007/s10898-010-9558-0zbMath1206.90120WikidataQ62473101 ScholiaQ62473101MaRDI QIDQ604962

Manlio Gaudioso, Antonio Fuduli, Annabella Astorino

Publication date: 12 November 2010

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-010-9558-0

zbMATH Keywords

DCA; DC functions

Mathematics Subject Classification ID

90C26: Nonconvex programming, global optimization

Related Items

A splitting bundle approach for non-smooth non-convex minimization, Margin maximization in spherical separation, An illumination problem: optimal apex and optimal orientation for a cone of light, A class of semi-supervised support vector machines by DC programming, Support vector machine polyhedral separability in semisupervised learning, Optimal replenishment order placement in a finite time horizon, Edge detection by spherical separation, Binary classification via spherical separator by DC programming and DCA, Training robust support vector regression with smooth non-convex loss function

Uses Software

• UCI-ml

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• Pattern separation by convex programming
• 10.1162/15324430260185583
• 10.1162/15324430152748218
• 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
• Linear and Nonlinear Separation of Patterns by Linear Programming
• Multicategory proximal support vector machine classifiers
• Polyhedral separability through successive LP