Quadratic programming: Difference between revisions

Revision as of 21:25, 26 February 2006

Revision as of 11:17, 2 March 2006

Line 19:

==Complexity==

For positive-definite ''E'', the ellipsoid algorithm solves the problem in polynomial time. If ''E'' has at least one negative [[eigenvalue]], the problem is [[NP-hard]].

==References==