On approximating complex quadratic optimization problems via semidefinite programming relaxations