Kernel-Based Interior-Point Methods for Monotone Linear Complementarity Problems over Symmetric Cones.
Goran LesajaCornelis RoosPublished in: J. Optim. Theory Appl. (2011)
Keyphrases
- linear complementarity problem
- interior point
- interior point methods
- semidefinite
- convex optimization
- linear programming
- linear program
- primal dual
- semidefinite programming
- quadratic programming
- kernel methods
- solving problems
- computationally intensive
- linear programming problems
- support vector machine
- nonnegative matrix factorization
- variational inequalities
- kernel matrix
- quadratic program
- upper bound
- support vector
- linear systems
- svm classifier