Revision as of 13:25, 25 July 2006 edit A quant (talk \| contribs) 26 edits link give no useful inormation about the package; should be at bottom anyway ← Previous edit		Revision as of 13:55, 25 July 2006 edit undo A quant (talk \| contribs) 26 edits link to convex optimization article Next edit →
Line 17: If there are only equality constraints, then the QP can be solved by a [[linear system]]. Otherwise, the most common method of solving a QP is an [[interior point method]]. [[Active set]] methods are also commonly used, as well as [[Conjugate gradient method]] with projection. Quadratic programming is a special case of the more general field of [[convex optimization]]. ==Complexity==

Quadratic programming: Difference between revisions