Quadratic programming: Difference between revisions

Revision as of 11:26, 16 January 2006

Revision as of 03:52, 1 February 2006

Line 16:

If ''E'' is [[positive-definite matrix|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.

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]], such as [http://www.orfe.princeton.edu/~loqo LOQO]. [[Active set]] methods are also commonly used.

==References==