A Polynomial-Time Algorithm for the Tridiagonal and Hessenberg P-Matrix Linear Complementarity Problem

Bernd Gärtner Markus Sprecher

Published in: CoRR (2011)

Keyphrases

linear complementarity problem
computational complexity
dynamic programming
objective function
optimal solution
worst case
learning algorithm
np hard
k means
simulated annealing
knapsack problem
globally optimal
semidefinite programming