Revision as of 01:27, 21 August 2008 edit Cydebot (talk \| contribs) 6,812,251 edits m Robot - Moving category Optimization to Mathematical optimization per CFD at Wikipedia:Categories for discussion/Log/2008 August 14. ← Previous edit		Revision as of 16:18, 15 September 2008 edit undo Trevorgoodchild (talk \| contribs) 294 edits the previous statement was somewhat misleading -- M must be P.D. in order for the objective to be convex in the first place; this is not a special requirement of Lemke's or Dantzig's algorithms Next edit →
Line 18: Indeed, these constraints ensure that ''f'' is always non-negative, so that it attains a minimum of 0 at '''x''' if and only if '''x''' solves the linear complementarity problem. Although any quadratic programming algorithm can solve an LCP, there exist more efficient, specialized algorithms, such as [[Lemke's algorithm]] and [[Dantzig's algorithm]]~~, for the case that '''M''' is symmetric positive-semidefinite~~. ==See also==

Linear complementarity problem: Difference between revisions