On convex relaxations for quadratically constrained quadratic programming
A quadratically constrained (possibly non-convex) quadratic programming problem is considered. The efficiency, for this problem, of several known convex underestimating methods is analyzed. The underestimates, obtained by means of the considered methods, are ranked according to their tightness.
scientific article; zbMATH DE number 6116941
scientific article