A trust region algorithm for computing extreme eigenvalues of tensors
From MaRDI portal
Publication:827572
DOI10.3934/naco.2020046zbMath1456.65030OpenAlexW3089870299MaRDI QIDQ827572
Publication date: 13 January 2021
Published in: Numerical Algebra, Control and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/naco.2020046
Nonlinear programming (90C30) Eigenvalues, singular values, and eigenvectors (15A18) Multilinear algebra, tensor calculus (15A69) Numerical linear algebra (65F99)
Related Items (1)
Uses Software
Cites Work
- An unconstrained optimization approach for finding real eigenvalues of even order symmetric tensors
- Spectra of uniform hypergraphs
- Nonmonotone trust region method for solving optimization problems
- Computing extreme eigenvalues of large scale Hankel tensors
- A modified trust region method with beale's PCG technique for optimization
- Infinite and finite dimensional Hilbert tensors
- Eigenvalues of a real supersymmetric tensor
- Numerical multilinear algebra and its applications
- Computing Tensor Eigenvalues via Homotopy Methods
- Computing Eigenvalues of Large Scale Sparse Tensors Arising from a Hypergraph
- Positive Semidefinite Generalized Diffusion Tensor Imaging via Quadratic Semidefinite Programming
- Shifted Power Method for Computing Tensor Eigenpairs
- The Fiedler Vector of a Laplacian Tensor for Hypergraph Partitioning
- Octupolar tensors for liquid crystals
- An Adaptive Shifted Power Method for Computing Generalized Tensor Eigenpairs
- All Real Eigenvalues of Symmetric Tensors
- Tensor Analysis
- On the limiting probability distribution of a transition probability tensor
This page was built for publication: A trust region algorithm for computing extreme eigenvalues of tensors
