科研之友
微信
新浪微博
Facebook
分享链接
摘要
A real symmetric tensor is said to be copositive if the associated homogeneous form is greater than or equal to zero over the nonnegative orthant. The problem of detecting tensor copositivity is NP-hard. This paper proposes a complete semidefinite relaxation algorithm for detecting the copositivity of a symmetric tensor. If it is copositive, the algorithm can get a certificate for the copositivity. If it is not, the algorithm can get a point that refutes the copositivity. We show that the detection can be done by solving a finite number of semidefinite relaxations for all tensors. As a special case, the algorithm can also be applied to detect matrix copositivity.
- 出版日期2018
- 单位天津大学
