Monotonically convergent algorithms for symmetric tensor approximation
From MaRDI portal
The author considers the symmetric higher order power method for the rank-one approximation problem. In this respect, he presents extensions of these results to higher rank approximants of symmetric tensors, and establishes a simple stabilization method when a related functional is not convex.
Recommendations
- Symmetric rank-1 approximation of symmetric high-order tensors
- On the best rank-1 approximation of higher-order supersymmetric tensors
- A convergence analysis for an algorithm computing a symmetric low rank orthogonal approximation of a symmetric tensor
- The best rank-1 approximation of a symmetric tensor and related spherical optimization problems
- On the best rank-1 approximation to higher-order symmetric tensors
Cites work
- A Multilinear Singular Value Decomposition
- A parallel algorithm for computing the polar decomposition
- Computing the Polar Decomposition and the Matrix Sign Decomposition in Matrix Groups
- Computing the Polar Decomposition—with Applications
- Dykstras algorithm with bregman projections: A convergence proof
- Fast low rank approximations of matrices and tensors
- Fourth-Order Cumulant-Based Blind Identification of Underdetermined Mixtures
- Generalized power method for sparse principal component analysis
- Generic and typical ranks of multi-way arrays
- Global properties of tensor rank
- Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 1393068 (Why is no real title available?)
- scientific article; zbMATH DE number 3296905 (Why is no real title available?)
- scientific article; zbMATH DE number 3320765 (Why is no real title available?)
- Maximal Rank of m\times n\times(mn-k) Tensors
- Most tensor problems are NP-hard
- New criteria for blind deconvolution of nonminimum phase systems (channels)
- On the Best Rank-1 and Rank-(R1 ,R2 ,. . .,RN) Approximation of Higher-Order Tensors
- On the best rank-1 approximation of higher-order supersymmetric tensors
- On the Convergence of ICA Algorithms With Symmetric Orthogonalization
- On the history of the kronecker product
- Optimizing Halley's Iteration for Computing the Matrix Polar Decomposition
- Orthogonal tensor decompositions
- Properties of some blind equalization criteria in noisy multiuser environments
- Rank-one approximation to high order tensors
- Shifted power method for computing tensor eigenpairs
- Symmetric Tensors and Symmetric Tensor Rank
- Tensor approximation and signal processing applications
- Tensor Decompositions and Applications
- Tensor Rank and the Ill-Posedness of the Best Low-Rank Approximation Problem
- Tensor rank is NP-complete
- The number of eigenvalues of a tensor
- The typical rank of tall three-way arrays
- The ubiquitous Kronecker product
- The vec-permutation matrix, the vec operator and Kronecker products: a review
Cited in
(17)- A Riemannian gradient ascent algorithm with applications to orthogonal approximation problems of symmetric tensors
- Alternate algorithms to most referenced techniques of numerical optimization to solve the symmetric rank-\(R\) approximation problem of symmetric tensors
- Time integration of symmetric and anti-symmetric low-rank matrices and Tucker tensors
- Numerical optimization for symmetric tensor decomposition
- An equi-directional generalization of adaptive cross approximation for higher-order tensors
- On the best rank-1 approximation of higher-order supersymmetric tensors
- Random Projections for Low Multilinear Rank Tensors
- Greedy approaches to symmetric orthogonal tensor decomposition
- On the perturbation of rank-one symmetric tensors.
- A convergence analysis for an algorithm computing a symmetric low rank orthogonal approximation of a symmetric tensor
- Symmetric rank-1 approximation of symmetric high-order tensors
- Numerical computation for orthogonal low-rank approximation of tensors
- A Global Convergence Analysis for Computing a Symmetric Low-Rank Orthogonal Approximation
- On an algorithm converging to hyperstochastic tensors
- Scalable symmetric Tucker tensor decomposition
- Symmetric tensor decomposition by an iterative eigendecomposition algorithm
- A locally convergent Jacobi iteration for the tensor singular value problem
This page was built for publication: Monotonically convergent algorithms for symmetric tensor approximation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1931773)
