DC models for spherical separation
From MaRDI portal
Publication:604962
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
90C26: Nonconvex programming, global optimization
Related Items
A splitting bundle approach for non-smooth non-convex minimization, Robust spherical separation, On the problem polyhedral separability: a numerical solution, On numerical solving the spherical separability problem, Multi-instance classification through spherical separation and VNS, Supervised classification and mathematical optimization, A DC optimization-based clustering technique for edge detection, DC programming and DCA: thirty years of developments, Minimizing nonsmooth DC functions via successive DC piecewise-affine approximations, Margin maximization in spherical separation, Polyhedral separation via difference of convex (DC) programming, Classification in the multiple instance learning framework via spherical separation, Spherical separation with infinitely far center, An augmented subgradient method for minimizing nonsmooth DC functions, An illumination problem: optimal apex and optimal orientation for a cone of light, A class of semi-supervised support vector machines by DC programming, Semisupervised spherical separation, 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, A proximal bundle method for nonsmooth DC optimization utilizing nonconvex cutting planes, Training robust support vector regression with smooth non-convex loss function
Uses Software
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