Quadratic programming

Quadratic programming is a subfield of nonlinear optimization which deals with quadratic optimization problems subject to the optional boundary and/or general linear equality/inequality constraints. Quadratic programming problems can be solved as general constrained nonlinear optimization problems. However, because we know that function being optimized is quadratic one, we can use specialized optimization algorithms that are more precise and robust than general ones.