Polynomial Interior Point Algorithms for General Linear Complementarity Problems.
Tibor IllésMarianna NagyTamás TerlakyPublished in: Algorithmic Oper. Res. (2010)
Keyphrases
- interior point
- linear complementarity problem
- linear programming
- interior point methods
- nonnegative matrix factorization
- linear program
- primal dual
- semidefinite programming
- convex optimization
- semidefinite
- linear programming problems
- learning algorithm
- linear systems
- computational complexity
- integer programming
- low rank
- sufficient conditions
- special case