General Heuristics for Nonconvex Quadratically Constrained Quadratic Programming

arXiv1703.07870MaRDI QIDQ6284701FDOQ6284701

Authors: Jaehyun Park, Stephen Boyd 

Publication date: 22 March 2017

Abstract: We introduce the Suggest-and-Improve framework for general nonconvex quadratically constrained quadratic programs (QCQPs). Using this framework, we generalize a number of known methods and provide heuristics to get approximate solutions to QCQPs for which no specialized methods are available. We also introduce an open-source Python package QCQP, which implements the heuristics discussed in the paper.

This page was built for publication: General Heuristics for Nonconvex Quadratically Constrained Quadratic Programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6284701)