现在位置:首页 > 学术报告
 

 

Academy of Mathematics and Systems Science, CAS
Colloquia & Seminars

Speaker:

Zi Yang, UCSD

Inviter:  
Title:
A Complete Semidefinite Algorithm for Detecting Copositive Matrices and Tensors
Time & Venue:
2018.6.25 10:30-12:00 N202
Abstract:
A real symmetric matrix (resp., tensor) is said to be copositive if the associated quadratic (resp., homogeneous) form is greater than or equal to zero over the nonnegative orthant. The problem of detecting their copositivity is NP-hard. This paper proposes a complete semidefinite relaxation algorithm for detecting the copositivity of a matrix or 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 matrices and tensors.
 

 

附件下载:
 
 
【打印本页】【关闭本页】
电子政务平台   |   科技网邮箱   |   ARP系统   |   会议服务平台   |   联系我们   |   友情链接