A note on set-semidefinite relaxations of nonconvex quadratic programs

We consider semidefinite, copositive, and more general, set-semidefinite programming relaxations of general nonconvex quadratic problems. For the semidefinite case a comparison between the feasible set of the original program and the feasible set of the relaxation has been given by Kojima and Tunçel (SIAM J Optim 10(3):750–778, <CitationRef CitationID="CR12">2000</CitationRef>). In this paper the comparison is presented for set-positive relaxations which contain copositive relaxations as a special case. Copyright Springer Science+Business Media New York 2013