Polyhedral separation via difference of convex (DC) programming
From MaRDI portal
Recommendations
- Solving polyhedral d.c. optimization problems via concave minimization
- Separation via polyhedral conic functions
- Separating plane algorithms for convex optimization
- A splitting method for separable convex programming
- Polyhedral optimization for polyhedral discrete and differential inclusions and duality
- scientific article; zbMATH DE number 1166327
- Separation of convex polyhedral sets with column parameters
- On the problem of minimizing a difference of polyhedral convex functions under linear constraints
- On the separation of parametric convex polyhedral sets with application in MOLP.
- Polyhedral approximation in mixed-integer convex optimization
Cites work
- scientific article; zbMATH DE number 3950216 (Why is no real title available?)
- scientific article; zbMATH DE number 1314294 (Why is no real title available?)
- scientific article; zbMATH DE number 823069 (Why is no real title available?)
- A DC optimization-based clustering technique for edge detection
- A fixed-center spherical separation algorithm with kernel transformations for classification problems
- A proximal bundle method for nonsmooth DC optimization utilizing nonconvex cutting planes
- Arbitrary-norm separating plane
- Breast Cancer Diagnosis and Prognosis Via Linear Programming
- Conic separation of finite sets. I: The homogeneous case
- Conic separation of finite sets. II: The non-homogeneous case
- DC models for spherical separation
- Ellipsoidal separation for classification problems
- Lagrangian relaxation for SVM feature selection
- Margin maximization in spherical separation
- Minimizing nonsmooth DC functions via successive DC piecewise-affine approximations
- Multi-instance classification through spherical separation and VNS
- On the complexity of polyhedral separability
- On the problem polyhedral separability: a numerical solution
- Pattern separation by convex programming
- Polyhedral separability through successive LP
- Support vector machine polyhedral separability in semisupervised learning
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
Cited in
(7)- Conic separation of finite sets. II: The non-homogeneous case
- Ellipsoidal classification via semidefinite programming
- DC models for spherical separation
- Difference of Convex programming in adversarial SVM
- A classification method based on a cloud of spheres
- Maximum-margin polyhedral separation for binary multiple instance learning
- Exact separation of k-projection polytope constraints
This page was built for publication: Polyhedral separation via difference of convex (DC) programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2100399)
