1. I.M. Bomze, “Remarks on the recursive structure of copositivity,”Journal of Information and Optimization Sciences 8 (1987) 243–260.
2. J.M. Borwein, “Necessary and sufficient conditions for quadratic minimality,”Numerical Functional Analysis and Optimization 5 (1982) 127–140.
3. L.B. Contesse, “Une caractérisation complète des minima locaux en programmation quadratique,”Numerische Mathematik 34 (1980) 315–332.
4. R.W. Cottle, G.J. Habetler and C.E. Lemke, “Quadratic forms semi-definite over convex cones,” in: H.W. Kuhn, ed.,Proceedings of the Princeton Symposium on Mathematical Programming (Princeton University Press, Princeton, NJ. 1970) pp. 551–565.
5. G. Danninger, “A recursive algorithm for determining (strict) copositivity of a symmetric matrix,” in: U. Rieder et al., eds.,Methods of Operations Research 62 (Hain, Meisenheim, 1990) pp. 45–52.