Completely positive tensor decomposition

MaRDI QIDQ6256554zbMATH OpenFDO

Authors Jinyan Fan, Anwa Zhou

Publication date 19 November 2014

Mathematics Subject Classification ID

Eigenvalues, singular values, and eigenvectors (15A18) Multilinear algebra, tensor calculus (15A69) Semidefinite programming (90C22)

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.

This page was built for publication: Completely positive tensor decomposition

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6256554)