Pages that link to "Item:Q621999"
From MaRDI portal
The following pages link to Clipping algorithms for solving the nearest point problem over reduced convex hulls (Q621999):
Displaying 6 items.
- \(L_{1}\)-norm loss based twin support vector machine for data recognition (Q1671708) (← links)
- Linear convergence rate for the MDM algorithm for the nearest point problem (Q1678696) (← links)
- Fast clustering-based weighted twin support vector regression (Q2152941) (← links)
- Scaling up twin support vector regression with safe screening rule (Q2200535) (← links)
- An effective method to determine whether a point is within a convex hull and its generalized convex polyhedron classifier (Q2225169) (← links)
- A Newton Based Radius Reduction Algorithm for Nearest Point Problems in Pos Cones (Q4698235) (← links)
