A full-Newton step infeasible interior-point algorithm for linear complementarity problems based on a kernel function.

Behrouz Kheirfam

Published in: Algorithmic Oper. Res. (2012)

Keyphrases

kernel function
linear complementarity problem
interior point
interior point methods
primal dual
semidefinite programming
support vector

kernel matrix
linear programming
kernel methods
input space
feature space
support vector machine
convex optimization

linear program
semidefinite
hyperplane
reproducing kernel hilbert space
np hard
high dimensional
support vectors

svm classifier
sufficient conditions
nonnegative matrix factorization
quadratic programming
feature set
computationally intensive