A hierarchy of semidefinite relaxations for completely positive tensor optimization problems

Abstract

In this paper, we study the completely positive (CP) tensor program, which is a linear optimization problem with the cone of CP tensors and some linear constraints. We reformulate it as a linear program over the cone of moments, then construct a hierarchy of semidefinite relaxations for solving it. We also discuss how to find a best CP approximation of a given tensor. Numerical experiments are presented to show the efficiency of the proposed methods.