A new Algorithm for Overcomplete Tensor Decomposition based on Sums-of-Squares Optimisation

Alexander Taveira Blomenhofer

In this thesis, a new class of algorithms based on Sums of Squares Programming is developed. These allow to reduce a degree-$d$ homogeneous polynomial $T = \sum_{i = 1}^m \langle a…