An adaptive gradient method for computing generalized tensor eigenpairs
From MaRDI portal
Abstract: High order tensor arises more and more often in signal processing,data analysis, higher-order statistics, as well as imaging sciences. In this paper, an adaptive gradient (AG) method is presented for generalized tensor eigenpairs. Global convergence and linear convergence rate are established under some suitable conditions. Numerical results are reported to illustrate the efficiency of the proposed method. Comparing with the GEAP method, an adaptive shifted power method proposed by Tamara G. Kolda and Jackson R. Mayo [SIAM J. Matrix Anal. Appl., 35 (2014), pp. 1563-1581], the AG method is much faster and could reach the largest eigenpair with a higher probability.
Recommendations
- An adaptive shifted power method for computing generalized tensor eigenpairs
- Computing tensor eigenvalues via homotopy methods
- Computing the generalized eigenvalues of weakly symmetric tensors
- An adaptive trust-region method for generalized eigenvalues of symmetric tensors
- Shifted power method for computing tensor eigenpairs
Cites work
- A feasible trust-region method for calculating extreme \(Z\)-eigenvalues of symmetric tensors
- A quadratically convergent algorithm for finding the largest eigenvalue of a nonnegative homogeneous polynomial map
- A sequential subspace projection method for extreme Z-eigenvalues of supersymmetric tensors.
- A survey on the spectral theory of nonnegative tensors.
- All real eigenvalues of symmetric tensors
- An Eigenvalue Method for Testing Positive Definiteness of a Multivariate Form
- An adaptive shifted power method for computing generalized tensor eigenpairs
- An unconstrained optimization approach for finding real eigenvalues of even order symmetric tensors
- Computing extreme eigenvalues of large scale Hankel tensors
- D-eigenvalues of diffusion kurtosis tensors
- Eigenvalues and invariants of tensors
- Eigenvalues of a real supersymmetric tensor
- Exponential data fitting using multilinear algebra: the single‐channel and multi‐channel case
- Finding the extreme \(Z\)-eigenvalues of tensors via a sequential semidefinite programming method.
- Finding the largest eigenvalue of a nonnegative tensor
- Finding the maximum eigenvalue of essentially nonnegative symmetric tensors via sum of squares programming
- Further Results for Perron–Frobenius Theorem for Nonnegative Tensors II
- Further results for Perron-Frobenius theorem for nonnegative tensors
- Generalized tensor eigenvalue problems
- Geometric measure of entanglement and U-eigenvalues of tensors
- Gradient skewness tensors and local illumination detection for images
- H-eigenvalues of signless Laplacian tensor for an even uniform hypergraph
- Higher order positive semidefinite diffusion tensor imaging
- Linear convergence of an algorithm for computing the largest eigenvalue of a nonnegative tensor.
- Linear convergence of the LZI algorithm for weakly positive tensors
- Most tensor problems are NP-hard
- Nonnegative diffusion orientation distribution function
- On eigenvalue problems of real symmetric tensors
- 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 limiting probability distribution of a transition probability tensor
- On the uniqueness and non-uniqueness of the positive \(\mathcal Z\)-eigenvector for transition probability tensors
- Perron-Frobenius theorem for nonnegative tensors
- Positive semidefinite generalized diffusion tensor imaging via quadratic semidefinite programming
- Primitivity, the Convergence of the NQZ Method, and the Largest Eigenvalue for Nonnegative Tensors
- Principal invariants and inherent parameters of diffusion kurtosis tensors
- Properties of solution set of tensor complementarity problem
- Properties of some classes of structured tensors
- Quasi-Newton method for computing \(Z\)-eigenpairs of a symmetric tensor
- Semidefinite relaxations for best rank-1 tensor approximations
- Semismoothness of the maximum eigenvalue function of a symmetric tensor and its application
- Shifted power method for computing tensor eigenpairs
- The \(Z\)-eigenvalues of a symmetric tensor and its application to spectral hypergraph theory.
- Z-eigenvalue methods for a global polynomial optimization problem
Cited in
(19)- An equi-directional generalization of adaptive cross approximation for higher-order tensors
- Calculating entanglement eigenvalues for nonsymmetric quantum pure states based on the Jacobian semidefinite programming relaxation method
- A family of gradient methods using Householder transformation with application to hypergraph partitioning
- A generalization of inverse power method for computing eigenpairs of symmetric tensors
- Direct methods of B(D)-eigenpairs of tensors and application in diffusion kurtosis imaging
- A hybrid second-order method for homogenous polynomial optimization over unit sphere
- An adaptive shifted power method for computing generalized tensor eigenpairs
- Spectral projected gradient methods for generalized tensor eigenvalue complementarity problems
- Linear homotopy method for computing generalized tensor eigenpairs
- Iterative methods for computing U-eigenvalues of non-symmetric complex tensors with application in quantum entanglement
- Computing the largest H-eigenvalue of large-scale tensors generated from directed hypergraphs
- Noda iteration for computing generalized tensor eigenpairs
- Riemannian conjugate gradient methods for computing the extreme eigenvalues of symmetric tensors
- Calculations for D-eigenvalues of a diffusion kurtosis tensor
- The multivariate eigenvalues of symmetric tensors
- A power-like method for finding the spectral radius of a weakly irreducible nonnegative symmetric tensor
- Feasible Newton methods for symmetric tensor Z-eigenvalue problems
- Computing the generalized eigenvalues of weakly symmetric tensors
- Local convergence analysis of inverse iteration algorithm for computing the H-spectral radius of a nonnegative weakly irreducible tensor
This page was built for publication: An adaptive gradient method for computing generalized tensor eigenpairs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2374369)
