An improved algorithm to test copositivity (Q427387)

This paper deals with testing the copositivity of a matrix. Some previous copositivity conditions presented by \textit{S. Bundfuss} and \textit{M. Dür} [Linear Algebra Appl. 428, No. 7, 1511--1523 (2008; Zbl 1138.15007)] are generalized. These results naturally yield a modified algorithm to test whether a matrix is copositive or not. Then the authors focus on the behavior of the modified algorithm when applied to the maximum clique problem. Theoretical and numerical results demonstrate that the behavior of the new algorithm highly depends on the partitioning strategy.