Quadratic programming: Difference between revisions

Revision as of 22:53, 21 October 2002

Revision as of 15:16, 16 November 2002

Line 14:

(2) C*x = d (equality contraint)

SinceIf E is positive definite then f(x) is a '''convex function''' , and constraints are '''linear functions''', we have from optimization theory that for point x to be an optimum point it is necessary and sufficient that x is a Kuhn-Tucker point.

(this article needs a lot more work..)