A modified FR conjugate gradient method for computing Z-eigenpairs of symmetric tensors
From MaRDI portal
Publication:2976271
Recommendations
- Riemannian conjugate gradient methods for computing the extreme eigenvalues of symmetric tensors
- Quasi-Newton method for computing \(Z\)-eigenpairs of a symmetric tensor
- A locally and cubically convergent algorithm for computing šµāeigenpairs of symmetric tensors
- A generalization of inverse power method for computing eigenpairs of symmetric tensors
- Shifted power method and conjugate gradient method for extension eigenvalues of tensor
Cites work
- A Globally and Superlinearly Convergent Gauss--Newton-Based BFGS Method for Symmetric Nonlinear Equations
- A modified Fletcher-Reeves-type derivative-free method for symmetric nonlinear equations
- A quadratically convergent algorithm for finding the largest eigenvalue of a nonnegative homogeneous polynomial map
- Algebraic connectivity of an even uniform hypergraph
- 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 inexact PRP conjugate gradient method for symmetric nonlinear equations
- An unconstrained optimization approach for finding real eigenvalues of even order symmetric tensors
- D-eigenvalues of diffusion kurtosis tensors
- Descent Directions of Quasi-Newton Methods for Symmetric Nonlinear Equations
- Eigenvalues of a real supersymmetric tensor
- Finding the extreme \(Z\)-eigenvalues of tensors via a sequential semidefinite programming method.
- Finding the maximum eigenvalue of essentially nonnegative symmetric tensors via sum of squares programming
- GloptiPoly 3: moments, optimization and semidefinite programming
- Higher order positive semidefinite diffusion tensor imaging
- On the best rank-1 approximation of higher-order supersymmetric tensors
- On the uniqueness and non-uniqueness of the positive \(\mathcal Z\)-eigenvector for transition probability tensors
- Rank and eigenvalues of a supersymmetric tensor, the multivariate homogeneous polynomial and the algebraic hypersurface it defines
- Shifted power method for computing tensor eigenpairs
- Spectra of uniform hypergraphs
- 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
(6)- Computing tensor \(Z\)-eigenvectors with dynamical systems
- A convergent Newton algorithm for computing Z-eigenvalues of an almost nonnegative irreducible tensor
- Riemannian conjugate gradient methods for computing the extreme eigenvalues of symmetric tensors
- A subspace modified Broyden-Fletcher-Goldfarb-Shanno method for \(\mathcal{B} \)-eigenvalues of symmetric tensors
- Quasi-Newton method for computing \(Z\)-eigenpairs of a symmetric tensor
- A locally and cubically convergent algorithm for computing šµāeigenpairs of symmetric tensors
This page was built for publication: A modified FR conjugate gradient method for computing \(Z\)-eigenpairs of symmetric tensors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2976271)