An SDP relaxation method for Perron pairs of a nonnegative tensor
From MaRDI portal
Publication:2113709
DOI10.1016/J.AMC.2021.126866OpenAlexW4213379735WikidataQ114210942 ScholiaQ114210942MaRDI QIDQ2113709FDOQ2113709
Xinzhen Zhang, Xihong Yan, Li Li
Publication date: 14 March 2022
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2021.126866
Recommendations
- Tensor norm and maximal singular vectors of nonnegative tensors -- a Perron-Frobenius theorem, a Collatz-Wielandt characterization and a generalized power method
- SDP relaxation algorithms for \(\mathbf{P(P}_0)\)-tensor detection
- Continuation methods for computing Z-/H-eigenpairs of nonnegative tensors
- Newton-noda iteration for finding the Perron pair of a weakly irreducible nonnegative tensor
- Perron-Frobenius theory for some classes of nonnegative tensors in the max algebra
Cites Work
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Estimation and Modelling Repeated Patterns in High Order Markov Chains with the Mixture Transition Distribution Model
- Title not available (Why is that?)
- Global optimization with polynomials and the problem of moments
- Eigenvalues and invariants of tensors
- Primitivity, the Convergence of the NQZ Method, and the Largest Eigenvalue for Nonnegative Tensors
- GloptiPoly 3: moments, optimization and semidefinite programming
- Finding the Largest Eigenvalue of a Nonnegative Tensor
- On spectral hypergraph theory of the adjacency tensor
- Perron-Frobenius theorem for nonnegative tensors
- Semidefinite characterization and computation of zero-dimensional real radical ideals
- Convergence of a second order Markov chain
- On the limiting probability distribution of a transition probability tensor
- A survey on the spectral theory of nonnegative tensors
- Linear convergence of an algorithm for computing the largest eigenvalue of a nonnegative tensor
- On the uniqueness and non-uniqueness of the positive \(\mathcal Z\)-eigenvector for transition probability tensors
- A quadratically convergent algorithm for finding the largest eigenvalue of a nonnegative homogeneous polynomial map
- The Laplacian of a uniform hypergraph
- A Necessary and Sufficient Condition for Existence of a Positive Perron Vector
- A Positivity Preserving Inverse Iteration for Finding the Perron Pair of an Irreducible Nonnegative Third Order Tensor
- Certifying convergence of Lasserre's hierarchy via flat truncation
- The \(p\)-spectral radius of \(k\)-partite and \(k\)-chromatic uniform hypergraphs
- All Real Eigenvalues of Symmetric Tensors
- Multilinear PageRank
- Tensor absolute value equations
- Newton-noda iteration for finding the Perron pair of a weakly irreducible nonnegative tensor
- Eigenvalues of the adjacency tensor on products of hypergraphs
- Computing the \(p\)-spectral radii of uniform hypergraphs with applications
- Real eigenvalues of nonsymmetric tensors
- A Complete Semidefinite Algorithm for Detecting Copositive Matrices and Tensors
- Perron-based algorithms for the multilinear PageRank
- Stationary Probability Vectors of Higher-Order Two-Dimensional Symmetric Transition Probability Tensors
Cited In (1)
Uses Software
This page was built for publication: An SDP relaxation method for Perron pairs of a nonnegative tensor
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2113709)
