Polyhedral separation via difference of convex (DC) programming
From MaRDI portal
Publication:2100399
DOI10.1007/s00500-021-05758-6zbMath1498.90153OpenAlexW3151921359MaRDI QIDQ2100399
Manlio Gaudioso, Massimo Di Francesco, Annabella Astorino, Enrico Gorgone, Benedetto Manca
Publication date: 22 November 2022
Published in: Soft Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00500-021-05758-6
Related Items (1)
Uses Software
Cites Work
- On the problem polyhedral separability: a numerical solution
- Multi-instance classification through spherical separation and VNS
- A DC optimization-based clustering technique for edge detection
- DC models for spherical separation
- A fixed-center spherical separation algorithm with kernel transformations for classification problems
- On the complexity of polyhedral separability
- Arbitrary-norm separating plane
- Lagrangian relaxation for SVM feature selection
- Minimizing nonsmooth DC functions via successive DC piecewise-affine approximations
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
- Margin maximization in spherical separation
- Support vector machine polyhedral separability in semisupervised learning
- Pattern separation by convex programming
- A proximal bundle method for nonsmooth DC optimization utilizing nonconvex cutting planes
- Breast Cancer Diagnosis and Prognosis Via Linear Programming
- Ellipsoidal separation for classification problems
- Polyhedral separability through successive LP
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Polyhedral separation via difference of convex (DC) programming
