```markdown
### Quadratically Constrained Quadratic Program (QCQP)

- **Objective**: Minimize \((1/2)x^T P_0 x + q_0^T x + r_0\)
- **Subject to**:
  - \((1/2)x^T P_i x + q_i^T x + r_i \leq 0\), \(i = 1, \ldots, m\)
  - \(Ax = b\)

- **Notes**:
  - \(P_i \in S_n^+\); objective and constraints are convex quadratic.
  - If \(P_1, \ldots, P_m \in S_n^{++}\), the feasible region is the intersection of \(m\) ellipsoids and an affine set.
```
