Abstract: Quadratically constrained quadratic programs (QCQPs) have a wide range of applications in signal processing and wireless communications. Non-convex QCQPs are NP-hard in general. Existing ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback