1. Arima, N., Kim, S., Kojima, M.: Simplified copositive and lagrangian relaxations for linearly constrained quadratic optimization problems in continuous and binary variables, Research Report B-469. Department of Mathematical and Computing Sciences, Tokyo Institute of Technology, Oh-Okayama, Meguro-ku, Tokyo (2012)
2. Benson, S.J., Ye, Y.: Approximating maximum stable set and minimum graph coloring problems with the positive semidefinite relaxation (1999) http://www.stanford.edu/~yyye/yyye/stable.ps
3. Semidefinite relaxations, multivariate normal distributions, and order statistics;D Bertsimas,1998
4. Bomze, I.M., de Klerk, E.: Solving standard quadratic optimization problems via linear, semidefinite and copositive programming. J. Global Optim. 24, 163–185 (2002)
5. Burer, S.: On the copositive representation of binary and continuous nonconvex quadratic programs. Math. Prog. 120(2), 479–495 (2009)