Completely positive tensor decomposition
Optimization and Control
2014-11-20 v1
Abstract
A symmetric tensor, which has a symmetric nonnegative decomposition, is called a completely positive tensor. We consider the completely positive tensor decomposition problem. A semidefinite algorithm is presented for checking whether a symmetric tensor is completely positive. If it is not completely positive, a certificate for it can be obtained; if it is completely positive, a nonnegative decomposition can be obtained.
Cite
@article{arxiv.1411.5149,
title = {Completely positive tensor decomposition},
author = {Jinyan Fan and Anwa Zhou},
journal= {arXiv preprint arXiv:1411.5149},
year = {2014}
}