Complexity analysis of interior point methods for linear programming based on a parameterized kernel function.
Mousaab BouafiaDjamel BenterkiAdnan YassinePublished in: RAIRO Oper. Res. (2016)
Keyphrases
- kernel function
- complexity analysis
- interior point methods
- linear programming
- linear program
- primal dual
- semidefinite programming
- quadratic programming
- support vector
- interior point
- theoretical analysis
- kernel methods
- support vector machine
- feature space
- lower bound
- optimal solution
- input space
- kernel matrix
- computational complexity
- objective function
- np hard
- support vector regression
- first order logic
- hyperplane
- svm classifier
- dynamic programming
- high dimensional
- kernel learning
- feature set
- support vectors
- multiple kernel learning
- cross validation
- markov random field
- image processing