Nonconvex Quadratically Constrained Quadratic Programs (QCQPs)
Here you can find the data used in the paper
Convex Quadratic Relaxations
of Nonconvex Quadratically Constrained Quadratic Programs
and Bin Yu.
The data files contain three classes of nonconvex QCQP problems:
was supported by the National Science Foundation under grants
DMS-0715446 and CMMI-0969600,
and by the Air Force Office of Sponsored Research under
grants FA9550-08-1-0061, FA9550-08-1-0081,
FA9550-11-1-0151, and FA9550-11-1-0260.
Any opinions, findings, and conclusions or recommendations expressed
in this material are those of the author(s) and do not necessarily
reflect the views of the National Science Foundation.
Back to my homepage