Feasible Newton methods for symmetric tensor Z-eigenvalue problems
From MaRDI portal
Publication:6175563
Abstract: Finding a Z-eigenpair of a symmetric tensor is equivalent to finding a KKT point of a sphere constrained minimization problem. Based on this equivalency, in this paper, we first propose a class of iterative methods to get a Z-eigenpair of a symmetric tensor. Each method can generate a sequence of feasible points such that the sequence of function evaluations is decreasing. These methods can be regarded as extensions of the descent methods for unconstrained optimization problems. We pay particular attention to the Newton's method. We show that under appropriate conditions, the Newton's method is globally and quadratically convergent. Moreover, after finitely many iterations, the unit steplength will always be accepted. We also propose a nonlinear equations based Newton's method and establish its global and quadratic convergence. In the end, we do several numerical experiments to test the proposed Newton's methods. The results show that both Newton's methods are very efficient.
Recommendations
- Quasi-Newton method for computing Z-eigenpairs of a symmetric tensor
- A locally and cubically convergent algorithm for computing šµāeigenpairs of symmetric tensors
- A feasible trust-region method for calculating extreme Z-eigenvalues of symmetric tensors
- A convergent Newton algorithm for computing Z-eigenvalues of an almost nonnegative irreducible tensor
- Newton correction methods for computing real eigenpairs of symmetric tensors
Cites work
- A convergent Newton algorithm for computing Z-eigenvalues of an almost nonnegative irreducible tensor
- A feasible trust-region method for calculating extreme Z-eigenvalues of symmetric tensors
- A modified Newton iteration for finding nonnegative \(Z\)-eigenpairs of a nonnegative tensor
- A sequential subspace projection method for extreme Z-eigenvalues of supersymmetric tensors.
- All real eigenvalues of symmetric tensors
- An adaptive gradient method for computing generalized tensor eigenpairs
- An adaptive shifted power method for computing generalized tensor eigenpairs
- D-eigenvalues of diffusion kurtosis tensors
- Eigenvalues of a real supersymmetric tensor
- Finding the extreme Z-eigenvalues of tensors via a sequential semidefinite programming method.
- Generalized tensor eigenvalue problems
- Geometric measure of entanglement and U-eigenvalues of tensors
- scientific article; zbMATH DE number 7156555 (Why is no real title available?)
- Most tensor problems are NP-hard
- Newton correction methods for computing real eigenpairs of symmetric tensors
- 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
- Semidefinite relaxations for best rank-1 tensor approximations
- Shifted power method for computing tensor eigenpairs
- Tensor analysis. Spectral theory and special tensors
- Tensor eigenvalues and their applications
- Z-eigenvalue methods for a global polynomial optimization problem
Cited in
(4)- A locally and cubically convergent algorithm for computing šµāeigenpairs of symmetric tensors
- A convergent Newton algorithm for computing Z-eigenvalues of an almost nonnegative irreducible tensor
- A feasible conjugate gradient method for calculating \(\mathcal{B}\)-eigenpairs of symmetric tensors
- Positive definiteness and differential results for generalized Hilbert tensors
This page was built for publication: Feasible Newton methods for symmetric tensor Z-eigenvalue problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6175563)
