Quadratic Programming

Let us consider a constrained optimization problem in the form where .

As the objective function is quadratic and the constraints linear the problem is convex. For this reason KKT conditions are not only necessary but also sufficient if a feasible w.r.t the constraints exists.

KKT Conditions

The KKT conditions of this problem can be states as:

Dual problem

The dual problem of the QP problem can be written as where the Lagrangian can be manipulated into the form Its critical point can be found by solving which yields When substituted back into the original dual problem, after basic manipulations, we attain