Let $P_1$, $P_2$ be two hermitian matrices. Can anyone comment about the following (QCQP) \begin{equation} \min_{z}~z^{H}z \\\ ~~subject~to ~z^{H}P_1z+1\leq 0,~z^{H}P_2z+1\leq 0 \end{equation} I am familiar with semi-definite relaxation. But I was wondering if we could do more here, since the objective is convex.
A certain type of Quadratic Constrained Quadratic Programming Problem (QCQP)
dineshdileep
- 1.4k
- 10
- 17