Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: A symmetric tensor, which has a symmetric nonnegative decomposition, is called a completely positive tensor. ,  characterize the completely positive tensor as a truncated moment sequence, and transform the problem of checking whether a tensor is completely positive to checking whether its corresponding truncated moment sequence admits a representing measure, then present a semidefinite algorithm to solve it. If a tensor is not completely positive, a certificate for it can be obtained; if it is completely positive, a nonnegative decomposition can be obtained.
['Jinyan Fan', 'Anwa Zhou']
I am writing a research paper on a idea A semidefinite algorithm for completely positive tensor decomposition
[{"from": "human", "value": "I am writing a research paper on a idea A semidefinite algorithm for completely positive tensor decomposition"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: A symmetric tensor, which has a symmetric nonnegative decomposition, is called a completely positive tensor. ,  characterize the completely positive tensor as a truncated moment sequence, and transform the problem of checking whether a tensor is completely positive to checking whether its corresponding truncated moment sequence admits a representing measure, then present a semidefinite algorithm to solve it. If a tensor is not completely positive, a certificate for it can be obtained; if it is completely positive, a nonnegative decomposition can be obtained."}]