This is for questions on Quadratic Programming (QP). A QP problem is the problem of minimising or maximising a quadratic objective function subject to affine constraints.

Quadratic Programming (QP) is a special case of convex optimisation where a quadratic function (called the objective function) of one or several variables is optimised subject to only affine constraints. Compared to Linear Programming (LP), only the objective function is different.

history | excerpt history