On the Uniqueness of the Canonical Polyadic Decomposition of Third-Order Tensors---Part II: Uniqueness of the Overall Decomposition

From MaRDI portal
Publication:2866215

DOI10.1137/120877258zbMath1282.15020arXiv1301.4603OpenAlexW2070013413MaRDI QIDQ2866215

Lieven De Lathauwer, I. Yu. Domanov

Publication date: 13 December 2013

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1301.4603




Related Items (46)

Identifiability for the k-secant variety of the Segre-Veronese varietiesSeparability of Hermitian tensors and PSD decompositionsEstimating multivariate latent-structure modelsFinding the limit of diverging components in three-way Candecomp/Parafac -- a demonstration of its practical meritsSet evincing the ranks with respect to an embedded variety (symmetric tensor rank and tensor rank)A very brief introduction to nonnegative tensors from the geometric viewpointThe Optimization Landscape for Fitting a Rank-2 Tensor with a Rank-1 TensorGeneric Uniqueness Conditions for the Canonical Polyadic Decomposition and INDSCALSimultaneous component analysis by means of Tucker3An ATLD-ALS method for the trilinear decomposition of large third-order tensorsCanonical polyadic decomposition of third-order tensors: relaxed uniqueness conditions and algebraic algorithmNew Uniqueness Conditions for the Canonical Polyadic Decomposition of Third-Order TensorsComputing the unique CANDECOMP/PARAFAC decomposition of unbalanced tensors by homotopy methodLinearly dependent subsets of Segre varieties$(L_r,L_r,1)$-Decompositions, Sparse Component Analysis, and the Blind Separation of Sums of ExponentialsPartial orthogonal rank-one decomposition of complex symmetric tensors based on the Takagi factorizationEffective Criteria for Specific Identifiability of Tensors and FormsA generalization of Kruskal’s theorem on tensor decompositionAn Algebraic Approach to Nonorthogonal General Joint Block DiagonalizationFrom non-defectivity to identifiabilityOn Best Low Rank Approximation of Positive Definite TensorsOn Uniqueness and Computation of the Decomposition of a Tensor into Multilinear Rank-$(1,L_r,L_r)$ TermsThe Condition Number of Join DecompositionsOn generic identifiability of symmetric tensors of subgeneric rankA uniqueness result on the decompositions of a bi-homogeneous polynomialFactor uniqueness of the structural Parafac modelThe Power of Tensor-Based Approaches in Cardiac ApplicationsA robust Parafac model for compositional dataReal identifiability vs. complex identifiabilityBilinear factorizations subject to monomial equality constraints via tensor decompositionsUnnamed ItemPerturbation analysis for matrix joint block diagonalizationExact line and plane search for tensor optimizationPartially symmetric tensor rank: the description of the non-uniqueness case for low rankIdentifiability of rank-3 tensorsFiber Sampling Approach to Canonical Polyadic Decomposition and Application to Tensor CompletionDecoupling multivariate polynomials: interconnections between tensorizationsOn secant dimensions and identifiability of flag varietiesFrom Computation to Comparison of Tensor DecompositionsSemialgebraic Geometry of Nonnegative Tensor RankCoupled Canonical Polyadic Decompositions and (Coupled) Decompositions in Multilinear Rank-$(L_r,n,L_r,n,1)$ Terms---Part I: UniquenessOn the Uniqueness and Perturbation to the Best Rank-One Approximation of a TensorComputing the Gradient in Optimization Algorithms for the CP Decomposition in Constant Memory through Tensor BlockingOn secant defectiveness and identifiability of Segre-Veronese varietiesDecoupling Multivariate Polynomials Using First-Order Information and Tensor DecompositionsIdentifiability of Complete Dictionary Learning




This page was built for publication: On the Uniqueness of the Canonical Polyadic Decomposition of Third-Order Tensors---Part II: Uniqueness of the Overall Decomposition