IE417 Lecture 24
In the absence of degeneracy, Lemke’s algorithm will nd a KKT point in a nite number of iterations under any of the following conditions:
H is positive semi-de nite and c = 0.
H is positive de nite.
H has nonnegative elements with positive diagonal entries.