An unconstrained optimization approach for finding real eigenvalues of even order symmetric tensors

DOI10.3934/NACO.2013.3.583zbMATH Open1271.65064arXiv1203.5150OpenAlexW2007036852MaRDI QIDQ363541FDOQ363541

Authors: Lixing Han 

Publication date: 3 September 2013

Published in: Numerical Algebra, Control and Optimization (Search for Journal in Brave)

Abstract: Let $n$ be a positive integer and $m$ be a positive even integer. Let $mathcalA$ be an $m^{th}$ order $n$-dimensional real weakly symmetric tensor and $mathcalB$ be a real weakly symmetric positive definite tensor of the same size. $lambdainR$ is called a ${mathcalB}_r$-eigenvalue of $mathcalA$ if $mathcalA{x}^{m-1}=lambdamathcalB{x}^{m-1}$ for some $$. In this paper, we introduce two unconstrained optimization problems and obtain some variational characterizations for the minimum and maximum ${mathcalB}_r$--eigenvalues of $mathcalA$. 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.

Full work available at URL: https://arxiv.org/abs/1203.5150

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

zbMATH Keywords

unconstrained optimizationeven orderpositive semi-definitenesstensor eigenvaluesweakly symmetric tensors

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Multilinear algebra, tensor calculus (15A69) Numerical computation of eigenvalues and eigenvectors of matrices (65F15)

Cited In (25)

• A trust region algorithm for computing extreme eigenvalues of tensors
• A generalization of inverse power method for computing eigenpairs of symmetric tensors
• Computing tensor eigenvalues via homotopy methods
• A projection method based on discrete normalized dynamical system for computing C-eigenpairs
• Computing geometric measure of entanglement for symmetric pure states via the Jacobian SDP relaxation technique
• Successive Rank-One Approximations for Nearly Orthogonally Decomposable Symmetric Tensors
• A sequential subspace projection method for extreme Z-eigenvalues of supersymmetric tensors.
• All real eigenvalues of symmetric tensors
• Numerical optimization for symmetric tensor decomposition
• Computing extreme eigenvalues of large scale Hankel tensors
• A modified FR conjugate gradient method for computing \(Z\)-eigenpairs of symmetric tensors
• An adaptive gradient method for computing generalized tensor eigenpairs
• Newton correction methods for computing real eigenpairs of symmetric tensors
• Computing tensor Z-eigenvalues via shifted inverse power method
• Computing eigenvalues of large scale sparse tensors arising from a hypergraph
• Riemannian conjugate gradient methods for computing the extreme eigenvalues of symmetric tensors
• 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
• On eigenvalue problems of real symmetric tensors
• Greedy approaches to symmetric orthogonal tensor decomposition
• An adaptive cubic regularization algorithm for computing H- and Z-eigenvalues of real even-order supersymmetric tensors
• Positive definiteness for 4th order symmetric tensors and applications
• Direct methods to compute all \(Z\)-eigenpairs of a tensor with dimension 2 or 3
• Z-eigenvalue intervals of even-order tensors with application to judge the strong ellipticity of an elasticity tensor
• Computing the generalized eigenvalues of weakly 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)