Gramian Tensor Decomposition via Semidefinite Programming
From MaRDI portal
Publication:6289923
arXiv1708.02659MaRDI QIDQ6289923FDOQ6289923
Authors: Erik Skau, Agnes Szanto 
Publication date: 8 August 2017
Abstract: In this paper we examine a symmetric tensor decomposition problem, the Gramian decomposition, posed as a rank minimization problem. We study the relaxation of the problem and consider cases when the relaxed solution is a solution to the original problem. In some instances of tensor rank and order, we prove generically that the solution to the relaxation will be optimal in the original. In other cases, we present interesting examples and approaches that demonstrate the intricacy of this problem.
Multilinear algebra, tensor calculus (15A69) Matrix completion problems (15A83) Computational aspects in algebraic geometry (14Q99)
This page was built for publication: Gramian Tensor Decomposition via Semidefinite Programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6289923)
