A finite-termination algorithm for testing copositivity over the positive semidefinite cone
This paper proposes an efficient algorithm for testing copositivity of homogeneous polynomials over the positive semidefinite cone. The algorithm is based on a novel matrix optimization reformulation and requires solving a hierarchy of semidefinite programs. Notably, it always terminates in finitely many iterations. If a homogeneous...