Talk:Quadratic programming
From Wikipedia, the free encyclopedia
Help please...
This is a very good article if you already know what quadratic programming is. For those of us who had to look it up, this is not particularly helpful.
It would probably be helpful to contrast it with linear programming. But I agree with above comment.
>Have added a short comment on the LP case.
I'm not so sure about the comments in the complexity section - why should Q need to be positive definite in order to obtain a polynomial time solution? Perhaps the article should say "If Q is postive semidefinite (including Q = 0), then a solution can be found in polynomial time".
I'm also not convinced about the ellipsoidal method reference - the associated article claims that ellipsoid method is for LPs. Perhaps a reference to an interior point text or to a general convex optimization book is more appropriate.
