Pages that link to "Item:Q5959910"
From MaRDI portal
The following pages link to Polyhedral separability through successive LP (Q5959910):
Displayed 16 items.
- DC models for spherical separation (Q604962) (← links)
- An aggregate deformation homotopy method for min-max-min problems with max-min constraints (Q616792) (← links)
- On the solution of min-sum-min problems (Q813350) (← links)
- A fixed-center spherical separation algorithm with kernel transformations for classification problems (Q839850) (← links)
- Margin maximization in spherical separation (Q1928756) (← links)
- A novel piecewise linear classifier based on polyhedral conic and max-min separabilities (Q1948524) (← links)
- Accurately learning from few examples with a polyhedral classifier (Q2475608) (← links)
- A constraint generation algorithm for large scale linear programs using multiple-points separation (Q2492707) (← links)
- The method of virtual experts in mathematical diagnostics (Q2501112) (← links)
- Separation of convex sets by Clarke subdifferential (Q3066929) (← links)
- An approach to classification based on separation of sets by means of several ellipsoids (Q3534645) (← links)
- Mathematical diagnostics via nonsmooth analysis (Q5317745) (← links)
- Data pre-classification and the separation law for closed bounded convex sets (Q5317746) (← links)
- Ellipsoidal separation for classification problems (Q5317749) (← links)
- Max–min separability (Q5317750) (← links)
- Separation via polyhedral conic functions (Q5481682) (← links)