Revision as of 22:43, 14 February 2004 edit Hike395 (talk \| contribs) Autopatrolled, Extended confirmed users, Pending changes reviewers, Rollbackers, Template editors 103,122 edits expanded article somewhat ← Previous edit		Revision as of 19:57, 22 March 2004 edit undo Robbot (talk \| contribs) 94,607 edits m Andre Engels - Robot-assisted disambiguation: Function Next edit →
Line 14: (2) C*x = d (equality contraint) If E is positive definite then f(x) is a [[convex]] [[function (mathematics)\|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.

Quadratic programming: Difference between revisions