Quadratic programming: Difference between revisions

Content deleted Content added
A quant (talk | contribs)
link to convex optimization article
Line 21:
 
==Complexity==
For positive-definite ''Q'', the ellipsoid algorithm[[Ellipsoid_method]] solves the problem in polynomial time. If ''Q'' has at least one negative [[eigenvalue]], the problem is [[NP-hard]].
 
==References==