High Order Infeasible-Interior-Point Methods for Solving Sufficient Linear Complementarity Problems.
Josef StoerMartin WechsShinji MizunoPublished in: Math. Oper. Res. (1998)
Keyphrases
- high order
- linear complementarity problem
- interior point
- interior point methods
- linear programming
- semidefinite
- convex optimization
- linear program
- linear programming problems
- semidefinite programming
- primal dual
- quadratic programming
- higher order
- solving problems
- nonnegative matrix factorization
- pairwise
- computationally intensive
- sufficient conditions
- quadratic program
- maximum margin
- feature extraction
- linear systems
- approximation algorithms
- matrix factorization
- simplex method