Let $P_1$, $P_2$ be two hermitian matrices. Can anyone comment about the following (QCQP) $$\min_{z}~z^{H}z \\\ ~~subject~to ~z^{H}P_1z+1\leq 0,~z^{H}P_2z+1\leq 0$$ I am familiar with semi-definite relaxation. But I was wondering if we could do more here, since the objective is convex.

-

Yes, a lot can be said for your special case. Given the notation, I presume you are optimizing over $\mathbb{C}^n$. In this case, see Section 2 in the paper Strong Duality in Nonconvex Quadratic Optimization with two Quadratic Constraints, A. Beck and Y. Eldar, SIAM J. Optimization, 17(3), 2006.

PS: The complex variable case seems to be easier than the real variable case.

-
@Suvrit thanks for that link. As I understand, the paper talks about the lagrangian relaxation of the above problem and it works well (I tested it). It is essentially a SDP problem. I was wondering if we could come up with some kind of fixed point algorithm for the dual problem of this. –  dineshdileep Nov 21 '12 at 6:28
But theorem 2.2 in that paper seems to say that under a finiteness and strict feasibility condition, the relaxation (given by (2.1) in the paper) has the same optimal value as the original problem.... –  Suvrit Nov 21 '12 at 6:46
They prove that the duality gap is zero, so the relaxation should give the same value as the original problem. In fact, they say that if we take the dual of this, we will get the semi definite relaxation. The problem for me is I need to implement this in a real time system where I can't assume the availability of a convex optimization package. So I need to come up with an iterative algorithm. It is fine if it converges to a local minimum or not a optimal solution. –  dineshdileep Nov 21 '12 at 8:12
well, if your RT system has an floating point processor, and you can compile C code for it, then you can get some open source SDP solver and use it, why not? –  Dima Pasechnik Nov 21 '12 at 8:53
e.g. if you have BLAS and LAPACK on your system then you can easily use CSDP: coin-or.org/projects/Csdp.xml –  Dima Pasechnik Nov 21 '12 at 8:58

Quadratic optimization subject to fixed number of quadratic constraints is "easy", even without any convexity assumptions. The algorithms are polynomial-time, but in practice quite hard to implement efficiently. See e.g. this.

The complex case can obviously be reduced to the real one.

-
Wow, that sounds like a cool paper! I need to read it someday! –  Suvrit Nov 21 '12 at 18:50