Talk:Quadratic programming

From Wikipedia, the free encyclopedia

Contents

[edit] 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.—Preceding unsigned comment added by 165.124.165.113 (talk • contribs) 06:00, October 20, 2006 (UTC)

It would probably be helpful to contrast it with linear programming. But I agree with above comment. —Preceding unsigned comment added by 128.101.34.35 (talk • contribs) 20:14, March 31, 2006 (UTC)
Have added a short comment on the LP case. —Preceding unsigned comment added by 88.111.53.221 (talk • contribs) 11:56, July 7, 2006 (UTC)

[edit] Complexity

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. —Preceding unsigned comment added by 88.111.53.221 (talk • contribs) 11:56, July 7, 2006 (UTC)

[edit] Transpose

In my opinion it can be confusing to use 2 different things to note a matrix' transpose on the same page by writing v' and vT alike. —Preceding unsigned comment added by 213.44.221.86 (talk • contribs) 14:05, June 7, 2007 (UTC)

[edit] Please define your terms

Can the article please explain what the symbol \preceq means? I have a Ph.D. in maths and I don't know! --Dr Greg 12:36, 13 September 2007 (UTC)

Done. It's only because I know what it should mean that I could explain it; the symbol is not in wide use. -- Jitse Niesen (talk) 13:22, 13 September 2007 (UTC)