Content deleted Content added
m Fixing Links |
No edit summary |
||
Line 3:
Quadratic programming problem can be formulated like this:
Assume x belongs to '''R'''<sup>n</sup> 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 +
with the following constraints (if there exists an answer then it satisfies these):
| |||