Adaptive constraint reduction for training support vector machines
From MaRDI portal
Recommendations
Cited in
(15)- An infeasible-start framework for convex quadratic optimization, with application to constraint-reduced interior-point and other methods
- An adaptive error penalization method for training an efficient and generalized SVM
- A constraint-reduced MPC algorithm for convex quadratic programming, with a modified active set identification scheme
- Nearest neighbors methods for support vector machines
- Clustering-based preconditioning for stochastic programs
- Binary separation and training support vector machines
- A constraint-reduced algorithm for semidefinite optimization problems with superlinear convergence
- Error bounds for support vector machines with application to the identification of active constraints
- Neighborhood Property–Based Pattern Selection for Support Vector Machines
- Adaptive constraint reduction for convex quadratic programming
- A polynomial time constraint-reduced algorithm for semidefinite optimization problems
- scientific article; zbMATH DE number 2221952 (Why is no real title available?)
- Using an iterative linear solver in an interior-point method for generating support vector machines
- A majorization penalty method for SVM with sparse constraint
- Adaptive pruning algorithm for least squares support vector machine classifier
This page was built for publication: Adaptive constraint reduction for training support vector machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q836799)
