Revision as of 02:50, 18 August 2004 edit Milkmandan (talk \| contribs) 1,975 edits m Reworded ← Previous edit		Revision as of 14:31, 29 October 2004 edit undo Crust (talk \| contribs) Extended confirmed users 1,898 edits mNo edit summary Next edit →
Line 3: The quadratic programming problem can be formulated like this: Assume x belongs to '''R'''<sup>n</sup> space. The (n x n) [[matrix (math)\|matrix]] E is [[positive semidefinite]] and h is any (n x 1) vector. Minimize (with respect to x)

Quadratic programming: Difference between revisions