A feasible trust-region method for calculating extreme Z-eigenvalues of symmetric tensors
zbMATH Open1325.65052MaRDI QIDQ2941671FDOQ2941671
Authors: Chunlin Hao, Chunfeng Cui, Yuhong Dai 
Publication date: 21 August 2015
Full work available at URL: http://www.yokohamapublishers.jp/online2/oppjo/vol11/p291.html
Recommendations
- A trust region algorithm for computing extreme eigenvalues of tensors
- A self-adaptive trust region method for extreme \(\mathcal {B}\)-eigenvalues of symmetric tensors
- Quasi-Newton method for computing \(Z\)-eigenpairs of a symmetric tensor
- An adaptive trust-region method for generalized eigenvalues of symmetric tensors
- A non-monotone adaptive trust region method for generalized eigenvalues of symmetric tensors
global convergencesymmetric tensorlocal quadratic convergenceextreme \(Z\)-eigenvaluefeasible trust region method
Numerical mathematical programming methods (65K05) Methods of successive quadratic programming type (90C55) Eigenvalues, singular values, and eigenvectors (15A18) Multilinear algebra, tensor calculus (15A69) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Interior-point methods (90C51)
Cited In (21)
- A non-monotone adaptive trust region method for generalized eigenvalues of symmetric tensors
- Credibility verification of \(Z\)-eigenpairs of symmetric tensors based on inverse-free Newton's method
- A trust region algorithm for computing extreme eigenvalues of tensors
- A sequential subspace projection method for extreme Z-eigenvalues of supersymmetric tensors.
- A hybrid second-order method for homogenous polynomial optimization over unit sphere
- Z-eigenvalue methods for a global polynomial optimization problem
- Spectral projected gradient methods for generalized tensor eigenvalue complementarity problems
- Computing extreme eigenvalues of large scale Hankel tensors
- An adaptive gradient method for computing generalized tensor eigenpairs
- An adaptive trust-region method for generalized eigenvalues of symmetric tensors
- A nonmonotone accelerated Levenberg–Marquardt method for the ‐eigenvalues of symmetric tensors
- Riemannian conjugate gradient methods for computing the extreme eigenvalues of symmetric tensors
- Boundedness-below conditions for a general scalar potential of two real scalar fields and the Higgs boson
- Decomposition of completely symmetric states
- Symmetric rank-1 approximation of symmetric high-order tensors
- Feasible Newton methods for symmetric tensor Z-eigenvalue problems
- 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 self-adaptive trust region method for extreme \(\mathcal {B}\)-eigenvalues of symmetric tensors
- Positive definiteness for 4th order symmetric tensors and applications
- Finding the extreme \(Z\)-eigenvalues of tensors via a sequential semidefinite programming method.
This page was built for publication: A feasible trust-region method for calculating extreme \(Z\)-eigenvalues of symmetric tensors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2941671)
