$LaTeX: \max \left \{\frac{x^T Qx}{2} + cx: Ax \le b\right \},$
where $LaTeX: Q$ is symmetric (without loss in generality). A QP is convex if its quadratic form matrix $LaTeX: (Q)$ is positive semi-definite. More generally, there could be quadratic constraint functions.