A quadratically convergent algorithm for finding the largest eigenvalue of a nonnegative homogeneous polynomial map
From MaRDI portal
Publication:2342946
Recommendations
- An algorithm for the largest eigenvalue of nonhomogeneous nonnegative polynomials
- An always convergent algorithm for the largest eigenvalue of an irreducible nonnegative tensor
- Efficient algorithms for computing the largest eigenvalue of a nonnegative tensor
- A homotopy method for computing the largest eigenvalue of an irreducible nonnegative tensor
- A cubically convergent method for solving the largest eigenvalue of a nonnegative irreducible tensor
Cites work
- Algebraic connectivity of an even uniform hypergraph
- An always convergent algorithm for the largest eigenvalue of an irreducible nonnegative tensor
- An Eigenvalue Method for Testing Positive Definiteness of a Multivariate Form
- D-eigenvalues of diffusion kurtosis tensors
- Eigenvalues of a real supersymmetric tensor
- Finding the largest eigenvalue of a nonnegative tensor
- Further results for Perron-Frobenius theorem for nonnegative tensors
- Higher order positive semidefinite diffusion tensor imaging
- scientific article; zbMATH DE number 7273682 (Why is no real title available?)
- Linear convergence of an algorithm for computing the largest eigenvalue of a nonnegative tensor.
- Linear convergence of the LZI algorithm for weakly positive tensors
- Multivariate polynomial minimization and its application in signal processing
- Numerical Optimization
- Perron-Frobenius theorem for nonnegative multilinear forms and extensions
- Perron-Frobenius theorem for nonnegative tensors
- Primitivity, the Convergence of the NQZ Method, and the Largest Eigenvalue for Nonnegative Tensors
- Quasi-Newton Methods, Motivation and Theory
Cited in
(50)- Continuation methods for computing Z-/H-eigenpairs of nonnegative tensors
- A modified Newton iteration for finding nonnegative \(Z\)-eigenpairs of a nonnegative tensor
- A continuation method for tensor complementarity problems
- Spectral projected gradient methods for generalized tensor eigenvalue complementarity problems
- A cubically convergent method for solving the largest eigenvalue of a nonnegative irreducible tensor
- Triangular decomposition of CP factors of a third-order tensor with application to solving nonlinear systems of equations
- Modified spectral PRP conjugate gradient method for solving tensor eigenvalue complementarity problems
- An SDP relaxation method for Perron pairs of a nonnegative tensor
- Stochastic tensor complementarity problem with discrete distribution
- Exact and inexact iterative methods for finding the largest eigenpair of a weakly irreducible nonnegative tensor
- A new smoothing spectral conjugate gradient method for solving tensor complementarity problems
- A new preconditioned SOR method for solving multi-linear systems with an \(\mathcal{M} \)-tensor
- New Brualdi-type eigenvalue inclusion sets for tensors
- An alternating direction method of multipliers for tensor complementarity problems
- Computing the largest H-eigenvalue of large-scale tensors generated from directed hypergraphs
- Finding Nash equilibrium for a class of multi-person noncooperative games via solving tensor complementarity problem
- A sufficient descent nonlinear conjugate gradient method for solving \(\mathcal{M} \)-tensor equations
- A subspace modified Broyden-Fletcher-Goldfarb-Shanno method for \(\mathcal{B} \)-eigenvalues of symmetric tensors
- An adaptive gradient method for computing generalized tensor eigenpairs
- Newton-noda iteration for finding the Perron pair of a weakly irreducible nonnegative tensor
- A homotopy method for computing the largest eigenvalue of an irreducible nonnegative tensor
- Local convergence analysis of inverse iteration algorithm for computing the H-spectral radius of a nonnegative weakly irreducible tensor
- An algorithm for the largest eigenvalue of nonhomogeneous nonnegative polynomials
- Computing eigenvalues of large scale sparse tensors arising from a hypergraph
- A modified FR conjugate gradient method for computing Z-eigenpairs of symmetric tensors
- A semismooth Newton method for tensor eigenvalue complementarity problem
- A Positivity Preserving Inverse Iteration for Finding the Perron Pair of an Irreducible Nonnegative Third Order Tensor
- Tensor complementarity problems: the GUS-property and an algorithm
- Higher-order power methods with momentum for solving the limiting probability distribution vector of higher-order Markov chains
- A Newton-type algorithm for the tensor eigenvalue complementarity problem and some applications
- High-order copositive tensors and its applications
- A convergent Newton algorithm for computing Z-eigenvalues of an almost nonnegative irreducible tensor
- Generalized tensor eigenvalue problems
- The relation between a tensor and its associated semi-symmetric form
- A generalization of inverse power method for computing eigenpairs of symmetric tensors
- Computing the extremal nonnegative solutions of the M-tensor equation with a nonnegative right-side vector
- Computing the dominant eigenpair of an essentially nonnegative tensor via a homotopy method
- A nonmonotone accelerated Levenberg–Marquardt method for the ‐eigenvalues of symmetric tensors
- Some properties concerning Perron vectors of weakly irreducible nonnegative tensors, and their application to rigorous enclosure
- A family of gradient methods using Householder transformation with application to hypergraph partitioning
- Calculations for D-eigenvalues of a diffusion kurtosis tensor
- A power-like method for finding the spectral radius of a weakly irreducible nonnegative symmetric tensor
- Restarted nonnegativity preserving tensor splitting methods via relaxed Anderson acceleration for solving multilinear systems
- An alternating minimization algorithm for the minimal H-eigenvalue of the M-tensor
- The projected Newton iteration approach for computing the nonnegative Z-eigenpairs of nonnegative tensors
- Positive definiteness of a class of cyclic symmetric tensors
- Column sufficient tensors and tensor complementarity problems
- On sparse solution of tensor complementarity problem
- A feasible conjugate gradient method for calculating \(\mathcal{B}\)-eigenpairs of symmetric tensors
- Positive definiteness and differential results for generalized Hilbert tensors
This page was built for publication: A quadratically convergent algorithm for finding the largest eigenvalue of a nonnegative homogeneous polynomial map
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2342946)
