Jacobi algorithm for the best low multilinear rank approximation of symmetric tensors
From MaRDI portal
Publication:2848628
DOI10.1137/11085743XzbMATH Open1273.15031OpenAlexW1986782029MaRDI QIDQ2848628FDOQ2848628
P.-A. 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
Recommendations
- Structure-preserving low multilinear rank approximation of antisymmetric tensors
- Symmetric rank-1 approximation of symmetric high-order tensors
- SVD-based algorithms for the best rank-1 approximation of a symmetric tensor
- On the best rank-1 approximation of higher-order supersymmetric tensors
- The best rank-1 approximation of a symmetric tensor and related spherical optimization problems
Cited In (30)
- Symmetric tensor decomposition by an iterative eigendecomposition algorithm
- Convergence of a Jacobi-type method for the approximate orthogonal tensor diagonalization
- Jacobi-type algorithms for homogeneous polynomial optimization on Stiefel manifolds with applications to tensor approximations
- Rank-1 approximation for entangled multipartite real systems
- Nonlinear Power-Like and SVD-Like Iterative Schemes with Applications to Entangled Bipartite Rank-1 Approximation
- On approximate diagonalization of third order symmetric tensors by orthogonal transformations
- Hybrid CUR-type decomposition of tensors in the Tucker format
- Finding the closest normal structured matrix
- The Epsilon-Alternating Least Squares for Orthogonal Low-Rank Tensor Approximation and Its Global Convergence
- Numerical optimization for symmetric tensor decomposition
- Real eigenvalues of nonsymmetric tensors
- Convergence and worst-case complexity of adaptive Riemannian trust-region methods for optimization on manifolds
- A Jacobi-Type Method for Computing Orthogonal Tensor Decompositions
- Convergence of Gradient-Based Block Coordinate Descent Algorithms for Nonorthogonal Joint Approximate Diagonalization of Matrices
- Globally Convergent Jacobi-Type Algorithms for Simultaneous Orthogonal Symmetric Tensor Diagonalization
- Convergence analysis of an SVD-based algorithm for the best rank-1 tensor approximation
- Scalable symmetric Tucker tensor decomposition
- Approximate Matrix and Tensor Diagonalization by Unitary Transformations: Convergence of Jacobi-Type Algorithms
- Trace maximization algorithm for the approximate tensor diagonalization
- Recompression of Hadamard Products of Tensors in Tucker Format
- Nonlinear Power-Like and SVD-Like Iterative Schemes with Applications to Entangled Bipartite Rank-1 Approximation
- Structure-Preserving Low Multilinear Rank Approximation of Antisymmetric Tensors
- Linear convergence of an alternating polar decomposition method for low rank orthogonal tensor approximations
- SVD-Based Algorithms for the Best Rank-1 Approximation of a Symmetric Tensor
- Spherical optimization with complex variables for computing US-eigenpairs
- Iterative algorithms for computing US- and U-eigenpairs of complex tensors
- A Riemannian gradient ascent algorithm with applications to orthogonal approximation problems of symmetric tensors
- On the Uniqueness and Perturbation to the Best Rank-One Approximation of a Tensor
- An inexact augmented Lagrangian method for computing strongly orthogonal decompositions of tensors
- Randomized Joint Diagonalization of Symmetric Matrices
This page was built for publication: Jacobi algorithm for the best low multilinear rank approximation of symmetric tensors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2848628)
