Bilinear factorizations subject to monomial equality constraints via tensor decompositions
From MaRDI portal
Publication:2020714
DOI10.1016/j.laa.2021.03.022zbMath1472.15037OpenAlexW3136689115WikidataQ114152039 ScholiaQ114152039MaRDI QIDQ2020714
Nicholaos D. Sidiropoulos, Mikael Sørensen, Lieven De Lathauwer
Publication date: 24 April 2021
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://lirias.kuleuven.be/handle/123456789/672776
tensoruniquenessmonomialcanonical polyadic decompositioneigenvalue decompositionblock term decompositioncoupled decomposition
Cites Work
- Unnamed Item
- Canonical polyadic decomposition of third-order tensors: relaxed uniqueness conditions and algebraic algorithm
- Refined methods for the identifiability of tensors
- On the relation between the determinant and the permanent
- On Kruskal's uniqueness condition for the Candecomp/Parafac decomposition
- Mixed discriminants of positive semidefinite matrices
- Identifiability of parameters in latent structure models with many observed variables
- Three-way arrays: rank and uniqueness of trilinear decompositions, with application to arithmetic complexity and statistics
- Analysis of individual differences in multidimensional scaling via an \(n\)-way generalization of ``Eckart-Young decomposition
- On the Uniqueness of the Canonical Polyadic Decomposition of Third-Order Tensors---Part I: Basic Results and Uniqueness of One Factor Matrix
- On the Uniqueness of the Canonical Polyadic Decomposition of Third-Order Tensors---Part II: Uniqueness of the Overall Decomposition
- Canonical Polyadic Decomposition of Third-Order Tensors: Reduction to Generalized Eigenvalue Decomposition
- A Decomposition for Three-Way Arrays
- Multidimensional Harmonic Retrieval via Coupled Canonical Polyadic Decomposition—Part I: Model and Identifiability
- Multidimensional Harmonic Retrieval via Coupled Canonical Polyadic Decomposition—Part II: Algorithm and Multirate Sampling
- Blind Multichannel Deconvolution and Convolutive Extensions of Canonical Polyadic and Block Term Decompositions
- Coupled Canonical Polyadic Decompositions and Multiple Shift Invariance in Array Processing
- Tensors, Learning, and “Kolmogorov Extension” for Finite-Alphabet Random Vectors
- Tensor Decomposition for Signal Processing and Machine Learning
- Coupled Canonical Polyadic Decompositions and (Coupled) Decompositions in Multilinear Rank-$(L_r,n,L_r,n,1)$ Terms---Part I: Uniqueness
- A Link between the Canonical Decomposition in Multilinear Algebra and Simultaneous Matrix Diagonalization
- Decompositions of a Higher-Order Tensor in Block Terms—Part II: Definitions and Uniqueness
- Symmetric Tensors and Symmetric Tensor Rank
- Identifiability of an X-Rank Decomposition of Polynomial Maps
- Kruskal's Permutation Lemma and the Identification of CANDECOMP/PARAFAC and Bilinear Models with Constant Modulus Constraints
- Coupled Canonical Polyadic Decompositions and (Coupled) Decompositions in Multilinear Rank- $(L_{r,n},L_{r,n},1)$ Terms---Part II: Algorithms
- Permanents
