An unconstrained optimization approach for finding real eigenvalues of even order symmetric tensors
From MaRDI portal
Publication:363541
Abstract: Let be a positive integer and be a positive even integer. Let be an order -dimensional real weakly symmetric tensor and be a real weakly symmetric positive definite tensor of the same size. is called a -eigenvalue of if for some . In this paper, we introduce two unconstrained optimization problems and obtain some variational characterizations for the minimum and maximum --eigenvalues of . Our results extend Auchmuty's unconstrained variational principles for eigenvalues of real symmetric matrices. This unconstrained optimization approach can be used to find a Z-, H-, or D-eigenvalue of an even order weakly symmetric tensor. We provide some numerical results to illustrate the effectiveness of this approach for finding a Z-eigenvalue and for determining the positive semidefiniteness of an even order symmetric tensor.
Recommendations
- On eigenvalue problems of real symmetric tensors
- A generalization of inverse power method for computing eigenpairs of symmetric tensors
- The location of \(H\)-eigenvalues of real even order symmetry tensors
- \(Z\)-eigenvalue localization sets for even order tensors and their applications
- All real eigenvalues of symmetric tensors
Cited in
(25)- A projection method based on discrete normalized dynamical system for computing C-eigenpairs
- Computing tensor Z-eigenvalues via shifted inverse power method
- Riemannian conjugate gradient methods for computing the extreme eigenvalues of symmetric tensors
- A trust region algorithm for computing extreme eigenvalues of tensors
- Computing extreme eigenvalues of large scale Hankel tensors
- Successive Rank-One Approximations for Nearly Orthogonally Decomposable Symmetric Tensors
- Computing geometric measure of entanglement for symmetric pure states via the Jacobian SDP relaxation technique
- Direct methods to compute all \(Z\)-eigenpairs of a tensor with dimension 2 or 3
- Computing eigenvalues of large scale sparse tensors arising from a hypergraph
- An adaptive cubic regularization algorithm for computing H- and Z-eigenvalues of real even-order supersymmetric tensors
- A generalization of inverse power method for computing eigenpairs of symmetric tensors
- A sequential subspace projection method for extreme Z-eigenvalues of supersymmetric tensors.
- Z-eigenvalue intervals of even-order tensors with application to judge the strong ellipticity of an elasticity tensor
- All real eigenvalues of symmetric tensors
- Greedy approaches to symmetric orthogonal tensor decomposition
- Computing the generalized eigenvalues of weakly symmetric tensors
- Computing tensor eigenvalues via homotopy methods
- Positive definiteness for 4th order symmetric tensors and applications
- A modified FR conjugate gradient method for computing \(Z\)-eigenpairs of symmetric tensors
- Numerical optimization for symmetric tensor decomposition
- An adaptive gradient method for computing generalized tensor eigenpairs
- Nonconvex homogeneous optimization: a general framework and optimality conditions of first and second-order
- Boundedness-below conditions for a general scalar potential of two real scalar fields and the Higgs boson
- Newton correction methods for computing real eigenpairs of symmetric tensors
- On eigenvalue problems of real symmetric tensors
This page was built for publication: An unconstrained optimization approach for finding real eigenvalues of even order symmetric tensors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q363541)