Revision as of 17:13, 16 July 2009 edit Numsgil (talk \| contribs) 655 edits Aggressive refactor based on the two online references I found ← Previous edit		Revision as of 17:27, 16 July 2009 edit undo Numsgil (talk \| contribs) 655 edits Dantzig's algorithm == simplex method? Next edit →
Line 29: Because these constraints ensure that ''f'' is always non-negative, it attains its minimum of 0 at '''z''' if and only if '''z''' solves the linear complementarity problem. If '''M''' is [[Positive-definite matrix\|positive definite]], any algorithm for solving (convex) [[Quadratic programming\|QPs]] can of course be used to solve the LCP. However, there also exist more efficient, specialized algorithms, such as [[Lemke's algorithm]] and [[Simplex algorithm \| Dantzig's algorithm]]. == See also ==

Linear complementarity problem: Difference between revisions