An algorithm for determining copositive matrices (Q636239)

A real symmetric \(n\times n\) matrix \(A\) is said to be (strictly) copositive if the quadratic form \(Q(X)=X^TAX\geq0 (>0)\), for all \(X\in{\mathbb R}_+^n\), where \({\mathbb R}_+\) is the set of nonnegative real numbers. In general, it is an NP problem to determine whether \(A\) is not copositive. In particular, the CAD algorithm is of doubly exponential time complexity. The authors present an algorithm of simple exponential growth called COPOMATRIX for determining the copositivity of \(A\).