# Quadratic program

### From Glossary

(QP). Classically, this is to optimize a quadratic function over a polyhedron, defined by linear equations and/or inequalities:

where is symmetric (without loss in generality). A QP is convex if its quadratic form matrix is positive semi-definite. More generally, there could be quadratic constraint functions.