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
where P0, … Pm are n-by-n matrices and x ∈ Rn is the optimization variable.
If P0, … Pm are all positive semidefinite, then the problem is convex. If these matrices are neither positive or negative semidefinite, the problem is non-convex. If P1, … Pm 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 (18601904)
“The slogan 45 minutes in Havana was not coined in the Cuban city, but in a Yankee cigar factory here.”
—Administration for the State of Con, U.S. public relief program (1935-1943)