A self-adaptive trust region method for extreme B-eigenvalues of symmetric tensors
From MaRDI portal
Publication:2420148
Recommendations
- An adaptive trust-region method for generalized eigenvalues of symmetric tensors
- A feasible trust-region method for calculating extreme \(Z\)-eigenvalues of symmetric tensors
- A non-monotone adaptive trust region method for generalized eigenvalues of symmetric tensors
- A subspace modified Broyden-Fletcher-Goldfarb-Shanno method for \(\mathcal{B} \)-eigenvalues of symmetric tensors
- A trust region algorithm for computing extreme eigenvalues of tensors
Cites work
- scientific article; zbMATH DE number 1932417 (Why is no real title available?)
- A Newton-like trust region method for large-scale unconstrained nonconvex minimization
- A Note on Trust-Region Radius Update
- A feasible trust-region method for calculating extreme \(Z\)-eigenvalues of symmetric tensors
- A novel self-adaptive trust region algorithm for unconstrained optimization
- A sequential subspace projection method for extreme Z-eigenvalues of supersymmetric tensors.
- All real eigenvalues of symmetric tensors
- An adaptive shifted power method for computing generalized tensor eigenpairs
- D-eigenvalues of diffusion kurtosis tensors
- Eigenvalues and invariants of tensors
- Eigenvalues of a real supersymmetric tensor
- Finding the largest eigenvalue of a nonnegative tensor
- Linear convergence of an algorithm for computing the largest eigenvalue of a nonnegative tensor.
- Nonmonotone adaptive trust region method
- Numerical Optimization
- On eigenvalue problems of real 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
- Perron-Frobenius theorem for nonnegative multilinear forms and extensions
- Primitivity, the Convergence of the NQZ Method, and the Largest Eigenvalue for Nonnegative Tensors
- Rank and eigenvalues of a supersymmetric tensor, the multivariate homogeneous polynomial and the algebraic hypersurface it defines
- Semidefinite relaxations for best rank-1 tensor approximations
- Semismoothness of the maximum eigenvalue function of a symmetric tensor and its application
- Shifted power method for computing tensor eigenpairs
- Strictly nonnegative tensors and nonnegative tensor partition
- The \(Z\)-eigenvalues of a symmetric tensor and its application to spectral hypergraph theory.
- The degree of the E-characteristic polynomial of an even order tensor
- The sparsest solutions to \(Z\)-tensor complementarity problems
- Trust Region Methods
- Z-eigenvalue methods for a global polynomial optimization problem
Cited in
(8)- A non-monotone adaptive trust region method for generalized eigenvalues of symmetric tensors
- A trust region algorithm for computing extreme eigenvalues of tensors
- Direct methods of B(D)-eigenpairs of tensors and application in diffusion kurtosis imaging
- A feasible trust-region method for calculating extreme \(Z\)-eigenvalues of symmetric tensors
- An adaptive trust-region method for generalized eigenvalues of symmetric tensors
- A nonmonotone accelerated Levenberg–Marquardt method for the ‐eigenvalues of symmetric tensors
- An adaptive trust region method for solving \(\mathcal{D}\)-eigenvalues problem of diffusion kurtosis tensors
- A subspace modified Broyden-Fletcher-Goldfarb-Shanno method for \(\mathcal{B} \)-eigenvalues of symmetric tensors
This page was built for publication: A self-adaptive trust region method for extreme \(\mathcal {B}\)-eigenvalues of symmetric tensors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2420148)
