Pages that link to "Item:Q836799"
From MaRDI portal
The following pages link to Adaptive constraint reduction for training support vector machines (Q836799):
Displaying 13 items.
- Nearest neighbors methods for support vector machines (Q256606) (← links)
- Clustering-based preconditioning for stochastic programs (Q288399) (← links)
- A constraint-reduced algorithm for semidefinite optimization problems with superlinear convergence (Q306395) (← links)
- Adaptive constraint reduction for convex quadratic programming (Q434155) (← links)
- A polynomial time constraint-reduced algorithm for semidefinite optimization problems (Q493064) (← links)
- Using an iterative linear solver in an interior-point method for generating support vector machines (Q616790) (← links)
- Adaptive pruning algorithm for least squares support vector machine classifier (Q973696) (← links)
- An infeasible-start framework for convex quadratic optimization, with application to constraint-reduced interior-point and other methods (Q2089775) (← links)
- An adaptive error penalization method for training an efficient and generalized SVM (Q2369549) (← links)
- A constraint-reduced MPC algorithm for convex quadratic programming, with a modified active set identification scheme (Q2419534) (← links)
- Binary separation and training support vector machines (Q2890532) (← links)
- Error bounds for support vector machines with application to the identification of active constraints (Q3562393) (← links)
- Neighborhood Property–Based Pattern Selection for Support Vector Machines (Q3591521) (← links)
