Please use this identifier to cite or link to this item:
Title: Copositivity detection of tensors : theory and algorithm
Authors: Chen, HB
Huang, ZH
Qi, LQ 
Keywords: Symmetric tensor
Strictly copositive tensor
Positive semi-definiteness
Simplicial partition
Issue Date: 2017
Publisher: Springer
Source: Journal of optimization theory and applications, 2017, v. 174, no. 3, p. 746-761 How to cite?
Journal: Journal of optimization theory and applications 
Abstract: A symmetric tensor is called copositive if it generates a multivariate form taking nonnegative values over the nonnegative orthant. Copositive tensors have found important applications in polynomial optimization, tensor complementarity problems and vacuum stability of a general scalar potential. In this paper, we consider copositivity detection of tensors from both theoretical and computational points of view. After giving several necessary conditions for copositive tensors, we propose several new criteria for copositive tensors based on the representation of the multivariate form in barycentric coordinates with respect to the standard simplex and simplicial partitions. It is verified that, as the partition gets finer and finer, the concerned conditions eventually capture all strictly copositive tensors. Based on the obtained theoretical results with the help of simplicial partitions, we propose a numerical method to judge whether a tensor is copositive or not. The preliminary numerical results confirm our theoretical findings.
ISSN: 0022-3239
EISSN: 1573-2878
DOI: 10.1007/s10957-017-1131-2
Appears in Collections:Journal/Magazine Article

View full-text via PolyU eLinks SFX Query
Show full item record


Citations as of May 12, 2018


Last Week
Last month
Citations as of May 20, 2018

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.