A polynomial-time algorithm for the tridiagonal and Hessenberg P-matrix linear complementarity problem.

Bernd Gärtner Markus Sprecher

Published in: Oper. Res. Lett. (2012)

Keyphrases

linear complementarity problem
learning algorithm
computational complexity
worst case
dynamic programming
optimal solution
objective function
np hard
knapsack problem
variational inequalities
singular value decomposition
linear systems
quadratic programming