Finding the maximum eigenvalue of essentially nonnegative symmetric tensors via sum of squares programming
From MaRDI portal
(Redirected from Publication:378284)
Recommendations
- A semidefinite program approach for computing the maximum eigenvalue of a class of structured tensors and its applications in hypergraphs and copositivity test.
- The maximum tensor complementarity eigenvalues
- On the largest eigenvalue of a symmetric nonnegative tensor.
- Efficient algorithms for computing the largest eigenvalue of a nonnegative tensor
- On computing minimal \(H\)-eigenvalue of sign-structured tensors
Cites work
- scientific article; zbMATH DE number 1490041 (Why is no real title available?)
- Algebraic connectivity of an even uniform hypergraph
- Alternative theorems for quadratic inequality systems and global quadratic optimization
- An Eigenvalue Method for Testing Positive Definiteness of a Multivariate Form
- An always convergent algorithm for the largest eigenvalue of an irreducible nonnegative tensor
- Eigenvalues of a real supersymmetric tensor
- Exact SDP relaxations for classes of nonlinear semidefinite programming problems
- Finding the largest eigenvalue of a nonnegative tensor
- Further Results for Perron–Frobenius Theorem for Nonnegative Tensors II
- Further results for Perron-Frobenius theorem for nonnegative tensors
- Global error bounds for piecewise convex polynomials
- Global optimization with polynomials and the problem of moments
- Global quadratic minimization over bivalent constraints: necessary and sufficient global optimality condition
- Higher order positive semidefinite diffusion tensor imaging
- 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
- Necessary and sufficient conditions for S-lemma and~nonconvex quadratic optimization
- Necessary global optimality conditions for nonlinear programming problems with polynomial constraints
- On eigenvalue problems of real symmetric tensors
- On the Asymptotically Well Behaved Functions and Global Error Bound for Convex Polynomials
- On the Best Rank-1 and Rank-(R1 ,R2 ,. . .,RN) Approximation of Higher-Order Tensors
- On the best rank-1 approximation of higher-order supersymmetric tensors
- Perron-Frobenius theorem for nonnegative multilinear forms and extensions
- Perron-Frobenius theorem for nonnegative tensors
- Positive semidefinite diagonal minus tail forms are sums of squares
- Pre- and Post-Processing Sum-of-Squares Programs in Practice
- Primitivity, the Convergence of the NQZ Method, and the Largest Eigenvalue for Nonnegative Tensors
- Semidefinite Programming
- Semidefinite programming relaxations for semialgebraic problems
- Semismoothness of the maximum eigenvalue function of a symmetric tensor and its application
- Tensor Decompositions and Applications
- The \(Z\)-eigenvalues of a symmetric tensor and its application to spectral hypergraph theory.
- The dominant eigenvalue of an essentially nonnegative tensor.
Cited in
(24)- A note on Banach's results concerning homogeneous polynomials associated with nonnegative tensors
- New iterative criteria for strong \(\mathcal{H}\)-tensors and an application
- A tensor analogy of Yuan's theorem of the alternative and polynomial optimization with sign structure
- Pseudo-spectra theory of tensors and tensor polynomial eigenvalue problems
- A semidefinite program approach for computing the maximum eigenvalue of a class of structured tensors and its applications in hypergraphs and copositivity test.
- Approximation algorithms for nonnegative polynomial optimization problems over unit spheres
- On computing minimal \(H\)-eigenvalue of sign-structured tensors
- An adaptive gradient method for computing generalized tensor eigenpairs
- A modified FR conjugate gradient method for computing \(Z\)-eigenpairs of symmetric tensors
- The \(Z\)-eigenvalues of a symmetric tensor and its application to spectral hypergraph theory.
- Computing the dominant eigenpair of an essentially nonnegative tensor via a homotopy method
- On computing maximum/minimum singular values of a generalized tensor sum
- Basic positive semi-definite Hankel tensors
- Nonconvex homogeneous optimization: a general framework and optimality conditions of first and second-order
- Boundedness-below conditions for a general scalar potential of two real scalar fields and the Higgs boson
- The location of \(H\)-eigenvalues of real even order symmetry tensors
- A survey on the spectral theory of nonnegative tensors.
- On the uniqueness of the positive Z-eigenvector for nonnegative tensors
- \(p\)-norm \(B\)-tensors and \(p\)-norm \(B_0\)-tensors
- Positive definiteness for 4th order symmetric tensors and applications
- Further results on Cauchy tensors and Hankel tensors
- The Laplacian of a uniform hypergraph
- Computing the generalized eigenvalues of weakly symmetric tensors
- An efficient algorithm for finding the maximal eigenvalue of zero symmetric nonnegative matrices
This page was built for publication: Finding the maximum eigenvalue of essentially nonnegative symmetric tensors via sum of squares programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q378284)
