Deng, Zhibin; Fang, Shu-Cherng; Jin, Qingwei; Xing, Wenxun - In: European Journal of Operational Research 229 (2013) 1, pp. 21-28
It is co-NP-complete to decide whether a given matrix is copositive or not. In this paper, this decision problem is transformed into a quadratic programming problem, which can be approximated by solving a sequence of linear conic programming problems defined on the dual cone of the cone of...