Revision as of 16:44, 15 March 2010 edit Michael Hardy (talk \| contribs) Administrators 210,597 edits →Relation to quadratic programming ← Previous edit		Revision as of 17:25, 22 March 2010 edit undo Thrufir (talk \| contribs) 27 edits Relationship between QP and LCP is due to the KKT theory Next edit →
Line 18: ==Relation to quadratic programming== ~~Finding~~According to the [[Karush–Kuhn–Tucker conditions]], finding a solution to the linear complementarity problem is equivalent to minimizing the quadratic function : <math>f(\mathbf{z}) = \mathbf{z}^{\mathrm{T}}(\mathbf{Mz}+\mathbf{q})</math>

Linear complementarity problem: Difference between revisions