Quadratic Programming (QP)

Learn about quadratic programming (QP) and solve it using projected gradient descent (PGD).

When the objective function is quadratic but constraints are linear, the optimization problem is said to be a quadratic programming (QP) problem. The general form of a QP problem is given as follows:

Get hands-on with 1200+ tech skills courses.