Jacobi algorithm for the best low multilinear rank approximation of symmetric tensors
From MaRDI portal
(Redirected from Publication:2848628)
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
(35)- Randomized Joint Diagonalization of Symmetric Matrices
- Structure-preserving low multilinear rank approximation of antisymmetric tensors
- Symmetric tensor decomposition by an iterative eigendecomposition algorithm
- Convergence of a Jacobi-type method for the approximate orthogonal tensor diagonalization
- Rank-1 approximation for entangled multipartite real systems
- Jacobi-type algorithms for homogeneous polynomial optimization on Stiefel manifolds with applications to tensor approximations
- 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 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
- Numerical optimization for symmetric tensor decomposition
- A sparse optimization approach for simultaneous orthogonal tensor diagonalization
- Real eigenvalues of nonsymmetric tensors
- Convergence and worst-case complexity of adaptive Riemannian trust-region methods for optimization on manifolds
- CP decomposition and low-rank approximation of antisymmetric tensors
- A Jacobi-Type Method for Computing Orthogonal Tensor Decompositions
- Polar decomposition-based algorithms on the product of Stiefel manifolds with applications in tensor approximation
- Convergence of Gradient-Based Block Coordinate Descent Algorithms for Nonorthogonal Joint Approximate Diagonalization of Matrices
- Convergence analysis of an SVD-based algorithm for the best rank-1 tensor approximation
- Scalable symmetric Tucker tensor decomposition
- SVD-based algorithms for the best rank-1 approximation of a symmetric tensor
- Trace maximization algorithm for the approximate tensor diagonalization
- The epsilon-alternating least squares for orthogonal low-rank tensor approximation and its global convergence
- 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
- A locally convergent Jacobi iteration for the tensor singular value problem
- _1-norm simultaneous approximate diagonalization and a proximal alternating maximization method
- Linear convergence of an alternating polar decomposition method for low rank orthogonal tensor approximations
- Spherical optimization with complex variables for computing US-eigenpairs
- Iterative algorithms for computing US- and U-eigenpairs of complex tensors
- Approximate matrix and tensor diagonalization by unitary transformations: convergence of Jacobi-type algorithms
- 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
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)
