Abstract
We present semidefinite relaxations of nonconvex, box-constrained quadratic programming, which incorporate the first- and second-order necessary optimality conditions, and establish theoretical relationships between the new relaxations and a basic semidefinite relaxation due to Shor. We compare these relaxations in the context of branch-and-bound to determine a global optimal solution, where it is shown empirically that the new relaxations are significantly stronger than Shor's. An effective branching strategy is also developed.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.