Ahmed, Faizan; Still, Georg - In: Journal of Global Optimization 57 (2013) 4, pp. 1139-1146
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...