Bilinear factorizations subject to monomial equality constraints via tensor decompositions

• Published in: Linear algebra and its applications Vol. 621; pp. 296 - 333
• Main Authors: Sørensen, Mikael, De Lathauwer, Lieven, Sidiropoulos, Nicholaos D.
• Format: Journal Article
• Language: English
• Published: Amsterdam Elsevier Inc 15.07.2021; American Elsevier Company, Inc
• Subjects: Algorithms; Block term decomposition; Canonical polyadic decomposition; Coupled decomposition; Decomposition; Eigenvalue decomposition; Eigenvalues; Equality; Factorization; Linear algebra; Machine learning; Mathematical analysis; Monomial; Signal processing; Tensor; Tensors; Uniqueness; Canonical polyadic decomposition; Tensor; Coupled decomposition; 15A23; Uniqueness; Monomial; Eigenvalue decomposition; 15A15; Block term decomposition

The Canonical Polyadic Decomposition (CPD), which decomposes a tensor into a sum of rank one terms, plays an important role in signal processing and machine learning. In this paper we extend the CPD framework to the more general case of bilinear factorizations subject to monomial equality constraint...