Optimization-Based Algorithms for Tensor Decompositions: Canonical Polyadic Decomposition, Decomposition in Rank-$(L_r,L_r,1)$ Terms, and a New Generalization
From MaRDI portal
Publication:2848170
DOI10.1137/120868323zbMath1277.90073OpenAlexW1989811026MaRDI QIDQ2848170
Marc Van Barel, Lieven De Lathauwer, Laurent Sorber
Publication date: 25 September 2013
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://lirias.kuleuven.be/handle/123456789/342543
optimizationalgorithmsmultilinear algebracanonical polyadic decompositiontensor decompositionsblock term decomposition
Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Applications of mathematical programming (90C90) Methods of quasi-Newton type (90C53)
Related Items
Robust Eigenvectors of Symmetric Tensors, Tensor decomposition for learning Gaussian mixtures from moments, Spherical optimization with complex variables for computing US-eigenpairs, The Optimization Landscape for Fitting a Rank-2 Tensor with a Rank-1 Tensor, Generic Uniqueness Conditions for the Canonical Polyadic Decomposition and INDSCAL, SOTT: Greedy Approximation of a Tensor as a Sum of Tensor Trains, Canonical polyadic decomposition of third-order tensors: relaxed uniqueness conditions and algebraic algorithm, New Uniqueness Conditions for the Canonical Polyadic Decomposition of Third-Order Tensors, Computing the unique CANDECOMP/PARAFAC decomposition of unbalanced tensors by homotopy method, $(L_r,L_r,1)$-Decompositions, Sparse Component Analysis, and the Blind Separation of Sums of Exponentials, Condition numbers for the tensor rank decomposition, Greedy low-rank algorithm for spatial connectome regression, The condition number of many tensor decompositions is invariant under Tucker compression, Alternating Mahalanobis Distance Minimization for Accurate and Well-Conditioned CP Decomposition, Low Rank Symmetric Tensor Approximations, A Fast Algorithm for Computing Macaulay Null Spaces of Bivariate Polynomial Systems, Accelerated doubly stochastic gradient descent for tensor CP decomposition, SNS: A Solution-Based Nonlinear Subspace Method for Time-Dependent Model Order Reduction, Symmetric Hermitian decomposability criterion, decomposition, and its applications, On global convergence of alternating least squares for tensor approximation, A randomized singular value decomposition for third-order oriented tensors, On Orthogonal Tensors and Best Rank-One Approximation Ratio, Iterative \(p\)-shrinkage thresholding algorithm for low Tucker rank tensor recovery, A Riemannian Trust Region Method for the Canonical Tensor Rank Approximation Problem, Face Representations via Tensorfaces of Various Complexities, Exploiting Efficient Representations in Large-Scale Tensor Decompositions, Hermitian Tensor Decompositions, Characterizing Real-Valued Multivariate Complex Polynomials and Their Symmetric Tensor Representations, Structuring data with block term decomposition: decomposition of joint tensors and variational block term decomposition as a parametrized mixture distribution model, On identifiability of higher order block term tensor decompositions of rank Lr⊗ rank-1, Complex and quaternionic optimization, Pencil-Based Algorithms for Tensor Rank Decomposition are not Stable, From Computation to Comparison of Tensor Decompositions, Riemannian Newton optimization methods for the symmetric tensor approximation problem, The Dynamics of Swamps in the Canonical Tensor Approximation Problem, Incremental CP Tensor Decomposition by Alternating Minimization Method, Systems of Polynomial Equations, Higher-order Tensor Decompositions, and Multidimensional Harmonic Retrieval: A Unifying Framework. Part I: The Canonical Polyadic Decomposition, Systems of Polynomial Equations, Higher-Order Tensor Decompositions, and Multidimensional Harmonic Retrieval: A Unifying Framework. Part II: The Block Term Decomposition, Coupled Canonical Polyadic Decompositions and (Coupled) Decompositions in Multilinear Rank- $(L_{r,n},L_{r,n},1)$ Terms---Part II: Algorithms, Unnamed Item, Comparison of Accuracy and Scalability of Gauss--Newton and Alternating Least Squares for CANDECOMC/PARAFAC Decomposition, Computing the Gradient in Optimization Algorithms for the CP Decomposition in Constant Memory through Tensor Blocking, New Riemannian Preconditioned Algorithms for Tensor Completion via Polyadic Decomposition, Decoupling Multivariate Polynomials Using First-Order Information and Tensor Decompositions, Inertial accelerated SGD algorithms for solving large-scale lower-rank tensor CP decomposition problems
Uses Software
