Monotonically convergent algorithms for symmetric tensor approximation
From MaRDI portal
Publication:1931773
DOI10.1016/j.laa.2011.10.033zbMath1261.65043OpenAlexW2115139877MaRDI QIDQ1931773
Publication date: 16 January 2013
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2011.10.033
stabilization methodpolar decompositiontensor approximationTucker productmonotonic convergencepower methodsconvex gradient inequality
Related Items
Time integration of symmetric and anti-symmetric low-rank matrices and Tucker tensors, An equi-directional generalization of adaptive cross approximation for higher-order tensors, Random Projections for Low Multilinear Rank Tensors, Symmetric tensor decomposition by an iterative eigendecomposition algorithm, Numerical Computation for Orthogonal Low-Rank Approximation of Tensors, A Riemannian gradient ascent algorithm with applications to orthogonal approximation problems of symmetric tensors, Numerical optimization for symmetric tensor decomposition
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Tensor Decompositions and Applications
- Generic and typical ranks of multi-way arrays
- Global properties of tensor rank
- A parallel algorithm for computing the polar decomposition
- The ubiquitous Kronecker product
- The number of eigenvalues of a tensor
- The typical rank of tall three-way arrays
- Dykstras algorithm with bregman projections: A convergence proof
- Orthogonal Tensor Decompositions
- Rank-One Approximation to High Order Tensors
- On the Best Rank-1 Approximation of Higher-Order Supersymmetric Tensors
- Generalized power method for sparse principal component analysis
- Optimizing Halley's Iteration for Computing the Matrix Polar Decomposition
- Fast low rank approximations of matrices and tensors
- Tensor rank is NP-complete
- Shifted Power Method for Computing Tensor Eigenpairs
- Maximal Rank of $m\times n\times(mn-k)$ Tensors
- New criteria for blind deconvolution of nonminimum phase systems (channels)
- Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
- On the history of the kronecker product
- Computing the Polar Decomposition—with Applications
- The vec-permutation matrix, the vec operator and Kronecker products: a review
- A Multilinear Singular Value Decomposition
- On the Best Rank-1 and Rank-(R1 ,R2 ,. . .,RN) Approximation of Higher-Order Tensors
- Fourth-Order Cumulant-Based Blind Identification of Underdetermined Mixtures
- On the Convergence of ICA Algorithms With Symmetric Orthogonalization
- Computing the Polar Decomposition and the Matrix Sign Decomposition in Matrix Groups
- Tensor Rank and the Ill-Posedness of the Best Low-Rank Approximation Problem
- Symmetric Tensors and Symmetric Tensor Rank
- Properties of some blind equalization criteria in noisy multiuser environments
- Most Tensor Problems Are NP-Hard
