Revision as of 16:43, 15 March 2010 edit Michael Hardy (talk \| contribs) Administrators 210,597 edits fixed incorrect capitals as required by WP:MOS ← Previous edit		Revision as of 16:44, 15 March 2010 edit undo Michael Hardy (talk \| contribs) Administrators 210,597 edits →Relation to quadratic programming Next edit →
Line 20: 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> subject to the constraints : <math>\mathbf{Mz}+\mathbf{q} \ge \mathbf{0}</math> : <math>\mathbf{z} \ge \mathbf{0}</math> 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.

Linear complementarity problem: Difference between revisions