Quadratic programming: Difference between revisions

Revision as of 05:28, 4 July 2003

Revision as of 22:29, 14 February 2004

Line 16:

If 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 Karush-Kuhn-Tucker (KKT) point.

{{msg:stub}}

(this article needs a lot more work..)