Jacobi Algorithm for the Best Low Multilinear Rank Approximation of Symmetric Tensors
From MaRDI portal
Publication:2848628
DOI10.1137/11085743XzbMath1273.15031OpenAlexW1986782029MaRDI QIDQ2848628
Pierre-Antoine Absil, Mariya Ishteva, Paul Van Dooren
Publication date: 26 September 2013
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/11085743x
Related Items
Spherical optimization with complex variables for computing US-eigenpairs ⋮ SVD-Based Algorithms for the Best Rank-1 Approximation of a Symmetric Tensor ⋮ Convergence analysis of an SVD-based algorithm for the best rank-1 tensor approximation ⋮ Finding the closest normal structured matrix ⋮ Linear convergence of an alternating polar decomposition method for low rank orthogonal tensor approximations ⋮ Jacobi-type algorithms for homogeneous polynomial optimization on Stiefel manifolds with applications to tensor approximations ⋮ Convergence of Gradient-Based Block Coordinate Descent Algorithms for Nonorthogonal Joint Approximate Diagonalization of Matrices ⋮ Randomized Joint Diagonalization of Symmetric Matrices ⋮ Recompression of Hadamard Products of Tensors in Tucker Format ⋮ Structure-Preserving Low Multilinear Rank Approximation of Antisymmetric Tensors ⋮ Trace maximization algorithm for the approximate tensor diagonalization ⋮ Approximate Matrix and Tensor Diagonalization by Unitary Transformations: Convergence of Jacobi-Type Algorithms ⋮ The Epsilon-Alternating Least Squares for Orthogonal Low-Rank Tensor Approximation and Its Global Convergence ⋮ Iterative algorithms for computing US- and U-eigenpairs of complex tensors ⋮ Nonlinear Power-Like and SVD-Like Iterative Schemes with Applications to Entangled Bipartite Rank-1 Approximation ⋮ Real eigenvalues of nonsymmetric tensors ⋮ On approximate diagonalization of third order symmetric tensors by orthogonal transformations ⋮ Symmetric tensor decomposition by an iterative eigendecomposition algorithm ⋮ An inexact augmented Lagrangian method for computing strongly orthogonal decompositions of tensors ⋮ A Riemannian gradient ascent algorithm with applications to orthogonal approximation problems of symmetric tensors ⋮ Nonlinear Power-Like and SVD-Like Iterative Schemes with Applications to Entangled Bipartite Rank-1 Approximation ⋮ Globally Convergent Jacobi-Type Algorithms for Simultaneous Orthogonal Symmetric Tensor Diagonalization ⋮ On the Uniqueness and Perturbation to the Best Rank-One Approximation of a Tensor ⋮ Convergence of a Jacobi-type method for the approximate orthogonal tensor diagonalization ⋮ Numerical optimization for symmetric tensor decomposition ⋮ Rank-1 approximation for entangled multipartite real systems ⋮ Hybrid CUR-type decomposition of tensors in the Tucker format
