On identifiability of higher order block term tensor decompositions of rank Lr⊗ rank-1
From MaRDI portal
Publication:5210715
DOI10.1080/03081087.2018.1502251zbMath1429.15023OpenAlexW2885607575WikidataQ114641435 ScholiaQ114641435MaRDI QIDQ5210715
No author found.
Publication date: 21 January 2020
Published in: Linear and Multilinear Algebra (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/03081087.2018.1502251
Related Items (2)
$(L_r,L_r,1)$-Decompositions, Sparse Component Analysis, and the Blind Separation of Sums of Exponentials ⋮ Multiview Clustering of Images with Tensor Rank Minimization via Nonconvex Approach
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Characterization of extreme points of multi-stochastic tensors
- Multiarray signal processing: tensor decomposition meets compressed sensing
- Witness sets of projections
- Membership tests for images of algebraic sets by linear projections
- Optimization-Based Algorithms for Tensor Decompositions: Canonical Polyadic Decomposition, Decomposition in Rank-$(L_r,L_r,1)$ Terms, and a New Generalization
- An Algebraic Approach to Nonorthogonal General Joint Block Diagonalization
- Blind Separation of Exponential Polynomials and the Decomposition of a Tensor in Rank-$(L_r,L_r,1)$ Terms
- Multilinear PageRank
- On the ideals and singularities of secant varieties of Segre varieties
- On Generic Identifiability of 3-Tensors of Small Rank
- Decompositions of a Higher-Order Tensor in Block Terms—Part I: Lemmas for Partitioned Matrices
- Decompositions of a Higher-Order Tensor in Block Terms—Part II: Definitions and Uniqueness
- Decompositions of a Higher-Order Tensor in Block Terms—Part III: Alternating Least Squares Algorithms
- Blind Multilinear Identification
This page was built for publication: On identifiability of higher order block term tensor decompositions of rank Lr⊗ rank-1
