An efficient primal simplex method for solving large-scale support vector machines.
Belkacem BrahmiPublished in: Neurocomputing (2024)
Keyphrases
- simplex method
- linear program
- support vector
- linear programming
- simplex algorithm
- primal dual
- linear fractional
- linear programming problems
- learning machines
- large margin classifiers
- column generation
- convergence rate
- interior point algorithm
- objective function
- optimal solution
- kernel function
- generalization ability
- kernel methods
- np hard
- dynamic programming
- support vector machine
- interior point methods
- convex optimization
- feature selection
- mixed integer
- cross validation
- semidefinite programming
- quadratic programming
- maximum margin
- radial basis function
- dual variables
- hyperplane
- feasible solution