Talk:Quadratically constrained quadratic program

Mathematics Start‑class Low‑priority

	Mathematics portal This article is within the scope of WikiProject Mathematics, a collaborative effort to improve the coverage of mathematics on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.MathematicsWikipedia:WikiProject MathematicsTemplate:WikiProject Mathematicsmathematics
Start	This article has been rated as Start-class on Wikipedia's content assessment scale.
Low	This article has been rated as Low-priority on the project's priority scale.

Quadratic Programming

Is this not the same as Quadratic programming? 68.174.98.161 22:57, 9 August 2007 (UTC)[reply]

In quadratic programming, the constraints are linear. Here, they are quadratic. -- Jitse Niesen (talk) 00:33, 10 August 2007 (UTC)[reply]

Oh, I see.. Thanks! 68.174.98.161 18:31, 15 August 2007 (UTC)[reply]

The statement "If P0, … Pm are all positive semidefinite then the problem is convex." is correct, but the link to the convex set is somewhat misleading. A convex program is not quite the same as a convex set.

The statement "If these matrices are neither positive or negative semidefinite, the problem is non-convex" is technically correct but quite misleading. Apart from trivial cases, if a single matrix is not positive semidefinite then the problem is nonconvex. —Preceding unsigned comment added by Alexander.mitsos (talk • contribs) 14:36, 1 November 2010 (UTC)[reply]

Equality Constraints

I am still not able to verify this, but as far as I can understand, even though equality constraints can be written in the format required by QCQP and (at least for some cases) satisfy the semi-definiteness restriction, they make the problem non-convex. If such can be verified, this exception should definitely be included in the text.