A quadratic program (QP) is an optimization problem in which the objective function is quadratic and the feasible region is a convex polytope.
A quadratic program (QP) is an optimization problem in which the objective function is quadratic and the feasible region is a convex polytope.