An SDP relaxation method for Perron pairs of a nonnegative tensor
From MaRDI portal
Publication:2113709
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
- scientific article; zbMATH DE number 3760340 (Why is no real title available?)
- A Positivity Preserving Inverse Iteration for Finding the Perron Pair of an Irreducible Nonnegative Third Order Tensor
- A complete semidefinite algorithm for detecting copositive matrices and tensors
- A necessary and sufficient condition for existence of a positive Perron vector
- A quadratically convergent algorithm for finding the largest eigenvalue of a nonnegative homogeneous polynomial map
- A survey on the spectral theory of nonnegative tensors.
- All real eigenvalues of symmetric tensors
- Certifying convergence of Lasserre's hierarchy via flat truncation
- Computing the \(p\)-spectral radii of uniform hypergraphs with applications
- Convergence of a second order Markov chain
- Eigenvalues and invariants of tensors
- Eigenvalues of the adjacency tensor on products of hypergraphs
- Estimation and Modelling Repeated Patterns in High Order Markov Chains with the Mixture Transition Distribution Model
- Finding the largest eigenvalue of a nonnegative tensor
- Global optimization with polynomials and the problem of moments
- GloptiPoly 3: moments, optimization and semidefinite programming
- Linear convergence of an algorithm for computing the largest eigenvalue of a nonnegative tensor.
- Multilinear PageRank
- Newton-noda iteration for finding the Perron pair of a weakly irreducible nonnegative tensor
- On spectral hypergraph theory of the adjacency tensor
- On the limiting probability distribution of a transition probability tensor
- On the uniqueness and non-uniqueness of the positive \(\mathcal Z\)-eigenvector for transition probability tensors
- Perron-Frobenius theorem for nonnegative tensors
- Perron-based algorithms for the multilinear PageRank
- Primitivity, the Convergence of the NQZ Method, and the Largest Eigenvalue for Nonnegative Tensors
- Real eigenvalues of nonsymmetric tensors
- Semidefinite characterization and computation of zero-dimensional real radical ideals
- Stationary probability vectors of higher-order two-dimensional symmetric transition probability tensors
- Tensor absolute value equations
- The Laplacian of a uniform hypergraph
- The \(p\)-spectral radius of \(k\)-partite and \(k\)-chromatic uniform hypergraphs
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
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)
