Jump to content

Quadratic programming

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Shd~enwiki (talk | contribs) at 14:55, 22 February 2002. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

Quadratic programming is a special type of Mathematical programming problem.

Assume x belongs to R^n space.

min 0.5*x'*E*x + f'*x
 x

with following boundary constraints (if there exists an answer then it satisfies these):

(1) A*x <= b
(2) C*x  = d (optional)

Matrix E (nxn) is usually positive semidefinite.