Skip to main content

A certain type of Quadratic Constrained Quadratic Programming Problemquadratic constrained quadratic program (QCQP)

Let $P_1$, $P_2$ be two hermitianHermitian matrices. Can anyone comment abouton 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} IQCQP?

$$\begin{array}{ll} \text{minimize} & z^{H} z\\ \text{subject to} & z^{H} P_1 z +1 \leq 0\\ & z^{H} P_2 z + 1 \leq 0\end{array}$$

I am familiar with semi-definitesemidefinite 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)

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 program (QCQP)

Let $P_1$, $P_2$ be two Hermitian matrices. Can anyone comment on the following QCQP?

$$\begin{array}{ll} \text{minimize} & z^{H} z\\ \text{subject to} & z^{H} P_1 z +1 \leq 0\\ & z^{H} P_2 z + 1 \leq 0\end{array}$$

I am familiar with semidefinite relaxation. But I was wondering if we could do more here, since the objective is convex.

Source Link
dineshdileep
  • 1.4k
  • 10
  • 17

A certain type of Quadratic Constrained Quadratic Programming Problem (QCQP)

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.