Linear complementarity, linear and nonlinear programming
Citations
193 citations
192 citations
191 citations
Cites background from "Linear complementarity, linear and ..."
...Iterative methods for quadratic programming and linear complementarity exist that can be adopted to this problem[14]....
[...]
...For non-PSD LCP’s with solutions, Lemke’s algorithm terminates either by finding a solution or by encountering an unbounded ray.1 As a result, Lemke’s algorithm is not suitable for solving non-PSD LCP’s....
[...]
...For frictionless systems, the LCP is always PSD and has a solution, so frictionless configurations do not have valid impulse solutions....
[...]
...The algorithm is exponential in the worst case, but has an expected running time polynomial in n[14]....
[...]
...However, for non-PSD LCP’s, Lemke’s algorithm is not guaranteed to terminate correctly (although it still takes only expected polynomial time to do so)....
[...]
185 citations
185 citations