Pages that link to "Item:Q2100399"
From MaRDI portal
The following pages link to Polyhedral separation via difference of convex (DC) programming (Q2100399):
Displaying 7 items.
- DC models for spherical separation (Q604962) (← links)
- Exact separation of \(k\)-projection polytope constraints (Q1695086) (← links)
- Conic separation of finite sets. II: The non-homogeneous case (Q2922477) (← links)
- Ellipsoidal classification via semidefinite programming (Q6161915) (← links)
- Maximum-margin polyhedral separation for binary multiple instance learning (Q6491336) (← links)
- A classification method based on a cloud of spheres (Q6491344) (← links)
- Difference of Convex programming in adversarial SVM (Q6593354) (← links)