SOS-Hankel Tensors: Theory and Application
Guoyin Li, Liqun Qi, Yi Xu

TL;DR
This paper studies SOS-Hankel tensors, their properties, and their relation to positive semi-definiteness, providing theoretical insights and an ADMM algorithm for tensor completion with preliminary numerical results.
Contribution
It establishes relationships between Hankel tensor classes, explores the existence of non-SOS positive semi-definite Hankel tensors, and proposes an ADMM algorithm for tensor completion.
Findings
Complete Hankel tensors are strong Hankel tensors.
All known positive semi-definite Hankel tensors are SOS-Hankel tensors.
Preliminary results show the effectiveness of the ADMM algorithm for tensor completion.
Abstract
Hankel tensors arise from signal processing and some other applications. SOS (sum-of-squares) tensors are positive semi-definite symmetric tensors, but not vice versa. The problem for determining an even order symmetric tensor is an SOS tensor or not is equivalent to solving a semi-infinite linear programming problem, which can be done in polynomial time. On the other hand, the problem for determining an even order symmetric tensor is positive semi-definite or not is NP-hard. In this paper, we study SOS-Hankel tensors. Currently, there are two known positive semi-definite Hankel tensor classes: even order complete Hankel tensors and even order strong Hankel tensors. We show complete Hankel tensors are strong Hankel tensors, and even order strong Hankel tensors are SOS-Hankel tensors. We give several examples of positive semi-definite Hankel tensors, which are not strong Hankel tensors.…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsTensor decomposition and applications · Matrix Theory and Algorithms · Digital Filter Design and Implementation
