Encyclopedia > Quadratic programming

  Article Content

Quadratic programming

Quadratic programming is a special type of mathematical optimization problem.

Quadratic programming problem can be formulated like this:

Assume x belongs to Rn space. The (n x n) matrix E is positive semidefinite and h is any (n x 1) vector.

Minimize (with respect to x)

 f(x) = 0.5 x' E x + h' x

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

 (1) A*x <= b  (inequality constraint)
 (2) C*x  = d  (equality contraint)

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.

(this article needs a lot more work..)



All Wikipedia text is available under the terms of the GNU Free Documentation License

 
  Search Encyclopedia

Search over one million articles, find something about almost anything!
 
 
  
  Featured Article
Bugatti

... as US$10 million. The best-known collectors of Bugatti were Hans and Fritz Schlumpf, two brothers who ran a textiles business in Mulhouse[?], close to the Bugatti ...

 
 
 
This page was created in 29.4 ms