A subspace modified Broyden-Fletcher-Goldfarb-Shanno method for B -eigenvalues of symmetric tensors

DOI10.1007/S10957-019-01617-5MaRDI QIDQ2302750zbMATH OpenOpenAlexFDO

Authors Mingyuan Cao, Qingdao Huang, Chaoqian Li, Yueting Yang

Publication date 26 February 2020

Published in Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10957-019-01617-5

zbMATH Keywords

global convergencesymmetric tensorssubspace technique\( \mathcal{B} \)-eigenvaluesmodified Broyden-Fletcher-Goldfarb-Shanno

Mathematics Subject Classification ID

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)

Recommendations

• A self-adaptive trust region method for extreme \(\mathcal {B}\)-eigenvalues of symmetric tensors
• 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 modified FR conjugate gradient method for computing Z-eigenpairs of symmetric tensors
• A non-monotone adaptive trust region method for generalized eigenvalues of symmetric tensors

Cites work

• A cubically convergent method for solving the largest eigenvalue of a nonnegative irreducible tensor
• A feasible trust-region method for calculating extreme Z-eigenvalues of symmetric tensors
• A quadratically convergent algorithm for finding the largest eigenvalue of a nonnegative homogeneous polynomial map
• A self-adaptive trust region method for extreme \(\mathcal {B}\)-eigenvalues of symmetric tensors
• A sequential subspace projection method for extreme Z-eigenvalues of supersymmetric tensors.
• A subspace implementation of quasi-Newton trust region methods for unconstrained optimization
• A survey of quasi-Newton equations and quasi-Newton methods for optimization
• All real eigenvalues of symmetric tensors
• An adaptive shifted power method for computing generalized tensor eigenpairs
• Eigenvalues of a real supersymmetric tensor
• Finding the largest eigenvalue of a nonnegative tensor
• Multivariate polynomial minimization and its application in signal processing
• 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
• Primitivity, the Convergence of the NQZ Method, and the Largest Eigenvalue for Nonnegative Tensors
• 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 degree of the E-characteristic polynomial of an even order tensor

Cited in

(3)

• Direct methods of B(D)-eigenpairs of tensors and application in diffusion kurtosis imaging
• A self-adaptive trust region method for extreme \(\mathcal {B}\)-eigenvalues of symmetric tensors
• A descent cautious BFGS method for computing US-eigenvalues of symmetric complex tensors

This page was built for publication: A subspace modified Broyden-Fletcher-Goldfarb-Shanno method for \(\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 Q2302750)