Quadratically Constrained Quadratic Program

In mathematical optimization, a quadratically constrained quadratic program (QCQP) is an optimization problem in which both the objective function and the constraints are quadratic functions. It has the form

$\begin{align} & \text{minimize} && \tfrac12 x^\mathrm{T} P_0 x + q_0^\mathrm{T} x \\ & \text{subject to} && \tfrac12 x^\mathrm{T} P_i x + q_i^\mathrm{T} x + r_i \leq 0 \quad \text{for } i = 1,\dots,m, \\ &&& Ax = b, \end{align}$

where P₀, … P_m are n-by-n matrices and x ∈ Rn is the optimization variable.

If P₀, … P_m are all positive semidefinite, then the problem is convex. If these matrices are neither positive or negative semidefinite, the problem is non-convex. If P₁, … P_m are all zero, then the constraints are in fact linear and the problem is a quadratic program.

Read more about Quadratically Constrained Quadratic Program: Hardness, Relaxation, Example, Solvers and Scripting (programming) Languages

Famous quotes containing the words constrained and/or program:

“An expansive life, one not constrained by four walls, requires as well an expansive pocket.”
—Anton Pavlovich Chekhov (1860–1904)

“These native villages are as unchanging as the woman in one of their stories. When she was called before a local justice he asked her age. “I have 45 years.” “But,” said the justice, “you were forty-five when you appeared before me two years ago.” “Señor Judge,” she replied proudly, drawing herself to her full height, “I am not of those who are one thing today and another tomorrow!””
—State of New Mexico, U.S. public relief program (1935-1943)