Quadratically constrained quadratic programs (QQPs) problems play an important modeling role in many diverse problems. These problems are in general NP hard and numerically intractable. Semidefinite programming (SDP) relaxations often provide good approximate solutions to these hard problems. For several special cases of QQP, e.g., convex programs and trust region subproblems, SDP relaxation pr...