QCQPQuadratically-Constrained Quadratic Programming
References in periodicals archive ?
l], [for all]l [not equal to] r is QCQP, which is well known to belong to the categories of convex optimization problem.
This subproblem is QCQP since the objective function is quadratic over T and quadratic constraints on T are given.
The subproblem to determine T with given fixed W and R is QCQP, which is a convex problem.