Completely positive tensor decomposition

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.

References in corpus (5)

• Truncated K-moment problems in several variables
• Finding the Spectral Radius of a Nonnegative Tensor
• Numerical Optimization for Symmetric Tensor Decomposition
• Generating Polynomials and Symmetric Tensor Decompositions
• Linear Optimization with Cones of Moments and Nonnegative Polynomials

Cited by in corpus (5)

• Numerical Optimization for Symmetric Tensor Decomposition
• Doubly Nonnegative Tensors, Completely Positive Tensors and Applications
• Inheritance Properties and Sum-of-Squares Decomposition of Hankel Tensors: Theory and Algorithms
• On {0,1} CP Tensors and CP Multi-hypergraphs
• Completely Positive Tensors and Multi-Hypergraphs