A convergent Newton algorithm for computing Z-eigenvalues of an almost nonnegative irreducible tensor

DOI10.1080/10556788.2019.1647196MaRDI QIDQ5210744zbMATH OpenOpenAlexWikidataFDO

Authors Xin Zhang, Qin Ni, Zhili Ge

Publication date 21 January 2020

Published in Optimization Methods \& Software (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/10556788.2019.1647196

zbMATH Keywords

almost nonnegative irreducible tensoreigenvalueNewton method

Mathematics Subject Classification ID

Eigenvalues, singular values, and eigenvectors (15A18) Multilinear algebra, tensor calculus (15A69) Numerical computation of eigenvalues and eigenvectors of matrices (65F15)

Recommendations

• A new modified Newton iteration for computing nonnegative Z-eigenpairs of nonnegative tensors
• A modified Newton iteration for finding nonnegative \(Z\)-eigenpairs of a nonnegative tensor
• Feasible Newton methods for symmetric tensor Z-eigenvalue problems
• Quasi-Newton method for computing Z-eigenpairs of a symmetric tensor
• An always convergent algorithm for the largest eigenvalue of an irreducible nonnegative tensor
• Continuation methods for computing Z-/H-eigenpairs of nonnegative tensors
• A Newton-type algorithm for the tensor eigenvalue complementarity problem and some applications
• A locally and cubically convergent algorithm for computing 𝒵‐eigenpairs of symmetric tensors
• A modified FR conjugate gradient method for computing Z-eigenpairs of symmetric tensors
• A cubically convergent method for solving the largest eigenvalue of a nonnegative irreducible tensor

Cites work

• A cubically convergent method for solving the largest eigenvalue of a nonnegative irreducible tensor
• A quadratically convergent algorithm for finding the largest eigenvalue of a nonnegative homogeneous polynomial map
• An adaptive shifted power method for computing generalized tensor eigenpairs
• An Eigenvalue Method for Testing Positive Definiteness of a Multivariate Form
• Eigenvalues of a real supersymmetric tensor
• Finding the largest eigenvalue of a nonnegative tensor
• Higher order positive semidefinite diffusion tensor imaging
• Multivariate polynomial minimization and its application in signal processing
• New stopping criteria for detecting infeasibility in conic optimization
• Numerical Optimization
• On eigenvalue problems of real symmetric tensors
• On the Best Rank-1 and Rank-(R₁ ,R₂ ,. . .,R_N) Approximation of Higher-Order 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 tensors
• Quasi-Newton method for computing Z-eigenpairs of a symmetric tensor
• Quasi-Newton Methods, Motivation and Theory
• Shifted power method for computing tensor eigenpairs
• Some variational principles for \(Z\)-eigenvalues of nonnegative tensors
• The Z-eigenvalues of a symmetric tensor and its application to spectral hypergraph theory.
• Z-eigenvalue methods for a global polynomial optimization problem

Cited in

(20)

• Continuation methods for computing Z-/H-eigenpairs of nonnegative tensors
• A modified Newton iteration for finding nonnegative \(Z\)-eigenpairs of a nonnegative tensor
• Real eigenvalues of nonsymmetric tensors
• Computing tensor Z-eigenvalues via shifted inverse power method
• 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
• A new modified Newton iteration for computing nonnegative Z-eigenpairs of nonnegative tensors
• Computing the largest H-eigenvalue of large-scale tensors generated from directed hypergraphs
• Quasi-Newton method for computing Z-eigenpairs of a symmetric tensor
• A locally and cubically convergent algorithm for computing 𝒵‐eigenpairs of symmetric tensors
• Credibility verification of Z-eigenpairs of symmetric tensors based on inverse-free Newton's method
• Computing tensor Z-eigenvectors with dynamical systems
• A preconditioning iterative algorithm for eigenvalue problem of symmetric tensor
• A family of gradient methods using Householder transformation with application to hypergraph partitioning
• Feasible Newton methods for symmetric tensor Z-eigenvalue problems
• A power-like method for finding the spectral radius of a weakly irreducible nonnegative symmetric tensor
• Spliting iteration method for solving multilinear PageRank problem
• On computing minimal \(H\)-eigenvalue of sign-structured tensors
• Solving generalized tensor eigenvalue problem via spectral shifted inverse power methods
• Positive definiteness and differential results for generalized Hilbert tensors

Describes a project that uses

Uses Software

• TensorToolbox

This page was built for publication: A convergent Newton algorithm for computing Z-eigenvalues of an almost nonnegative irreducible tensor

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5210744)