Abstract
In this paper, we review recent development in semidefinite programming (SDP) based convex relaxations for nonconvex quadratically constrained quadratic programming (QCQP) problems. QCQP problems have been well known as NP-hard nonconvex problems. We focus on convex relaxations of QCQP, which forms the base of global algorithms for solving QCQP. We review SDP relaxations, reformulation-linearization technique, SOC-RLT constraints and various other techniques based on lifting and linearization.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
