An Efficient Primal-Dual Interior Point Method for Linear Programming Problems Based on a New Kernel Function with a Trigonometric Barrier Term.
Mousaab BouafiaDjamel BenterkiAdnan YassinePublished in: J. Optim. Theory Appl. (2016)
Keyphrases
- primal dual
- kernel function
- linear programming problems
- interior point methods
- linear programming
- convex optimization
- linear program
- feature space
- kernel methods
- support vector
- simplex algorithm
- interior point algorithm
- interior point
- semidefinite programming
- approximation algorithms
- support vector machine
- convergence rate
- input space
- kernel matrix
- high dimensional
- svm classifier
- hyperplane
- computationally intensive
- support vectors
- simplex method
- quadratic programming
- reinforcement learning
- semidefinite
- feasible solution
- image restoration
- column generation
- feature extraction