The Z-eigenvalues of a symmetric tensor and its application to spectral hypergraph theory.
From MaRDI portal
(Redirected from Publication:2936746)
The \(Z\)-eigenvalues of a symmetric tensor and its application to spectral hypergraph theory.
The \(Z\)-eigenvalues of a symmetric tensor and its application to spectral hypergraph theory.
Recommendations
- On the Z-eigenvalues of the signless Laplacian tensor for an even uniform hypergraph
- On spectral hypergraph theory of the adjacency tensor
- On the Z-eigenvalues of the adjacency tensors for uniform hypergraphs
- Spectral properties of odd-bipartite \(Z\)-tensors and their absolute tensors
- Computing eigenvalues of large scale sparse tensors arising from a hypergraph
Cites work
- A Newton-CG augmented Lagrangian method for semidefinite programming
- A nonsmooth version of Newton's method
- Algebraic connectivity of an even uniform hypergraph
- An Eigenvalue Method for Testing Positive Definiteness of a Multivariate Form
- Eigenvalues of a real supersymmetric tensor
- Error bound results for generalized D-gap functions of nonsmooth variational inequality problems
- Error bounds for systems of lower semicontinuous functions in Asplund spaces
- Error bounds of generalized D-gap functions for nonsmooth and nonmonotone variational inequality problems
- Explicit bounds for the Łojasiewicz exponent in the gradient inequality for polynomials
- Finding the largest eigenvalue of a nonnegative tensor
- Finding the maximum eigenvalue of essentially nonnegative symmetric tensors via sum of squares programming
- Global error bounds for piecewise convex polynomials
- Global optimization with polynomials and the problem of moments
- GloptiPoly 3: moments, optimization and semidefinite programming
- Higher order positive semidefinite diffusion tensor imaging
- Laplace eigenvalues of graphs---a survey
- Multivariate polynomial minimization and its application in signal processing
- Necessary global optimality conditions for nonlinear programming problems with polynomial constraints
- Nonsmooth Equations: Motivation and Algorithms
- Nonsmooth analysis of eigenvalues
- 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 tensors
- Pre- and Post-Processing Sum-of-Squares Programs in Practice
- Second Order Sufficient Conditions for Weak and Strict Constrained Minima
- Semismooth Matrix-Valued Functions
- Semismooth and Semiconvex Functions in Constrained Optimization
- Semismoothness of the maximum eigenvalue function of a symmetric tensor and its application
- Sensitivity analysis of the gratest eigenvalue of a symmetric matrix via the \(\epsilon\)-subdifferential of the associated convex quadratic form
- Shifted power method for computing tensor eigenpairs
- Spectra of uniform hypergraphs
- Tensor Decompositions and Applications
- The Łojasiewicz exponent of an analytic function at an isolated zero
- Z-eigenvalue methods for a global polynomial optimization problem
Cited in
(79)- The eigenvectors associated with the zero eigenvalues of the Laplacian and signless Laplacian tensors of a uniform hypergraph
- Distribution of the eigenvalues of a random system of homogeneous polynomials
- The adjacency and signless Laplacian spectra of cored hypergraphs and power hypergraphs
- New criteria for \(\mathcal{H}\)-tensors and an application
- Eigenconfigurations of tensors
- On the Z-eigenvalues of the signless Laplacian tensor for an even uniform hypergraph
- The largest Laplacian and signless Laplacian \(H\)-eigenvalues of a uniform hypergraph
- 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
- A family of gradient methods using Householder transformation with application to hypergraph partitioning
- The Expected Number of Eigenvalues of a Real Gaussian Tensor
- Finding the maximum eigenvalue of essentially nonnegative symmetric tensors via sum of squares programming
- Some criteria for identifying strong \(\mathcal{H}\)-tensors
- Computing tensor eigenvalues via homotopy methods
- Interval tensors and their application in solving multi-linear systems of equations
- On the iterative criterion for strong \(\mathcal{H}\)-tensors
- Pseudo-spectra theory of tensors and tensor polynomial eigenvalue problems
- Covariate regularized community detection in sparse graphs
- A semidefinite program approach for computing the maximum eigenvalue of a class of structured tensors and its applications in hypergraphs and copositivity test.
- Spectral projected gradient methods for generalized tensor eigenvalue complementarity problems
- Inverse Perron values and connectivity of a uniform hypergraph
- Sharp Z-eigenvalue inclusion set-based method for testing the positive definiteness of multivariate homogeneous forms
- Further results on \(B\)-tensors with application to location of real eigenvalues
- The Fiedler vector of a Laplacian tensor for hypergraph partitioning
- Primitive tensors and directed hypergraphs
- Spectra of general hypergraphs
- An adaptive gradient method for computing generalized tensor eigenpairs
- A modified FR conjugate gradient method for computing Z-eigenpairs of symmetric tensors
- On Best Low Rank Approximation of Positive Definite Tensors
- A hyper-distance-based method for hypernetwork comparison
- Note on \(Z \)-eigenvalue inclusion theorems for tensors
- On the spectral radius of uniform weighted hypergraph
- New practical criteria for H-tensors and its application
- scientific article; zbMATH DE number 7089053 (Why is no real title available?)
- Melonic dominance and the largest eigenvalue of a large random tensor
- Some inequalities for the Hadamard product of tensors
- Newton correction methods for computing real eigenpairs of symmetric tensors
- Generalized tensor eigenvalue problems
- Eigenvariety of nonnegative symmetric weakly irreducible tensors associated with spectral radius and its application to hypergraphs
- Hypergraph clustering using a new Laplacian tensor with applications in image processing
- Analytic methods for uniform hypergraphs
- A convergent Newton algorithm for computing Z-eigenvalues of an almost nonnegative irreducible tensor
- Riemannian conjugate gradient methods for computing the extreme eigenvalues of symmetric tensors
- Cored hypergraphs, power hypergraphs and their Laplacian H-eigenvalues
- Decomposition of completely symmetric states
- On spectral theory of a k-uniform directed hypergraph
- Properties of some classes of structured tensors
- The spectral theory of tensors and its applications
- Tensor logarithmic norm and its applications.
- The location of H-eigenvalues of real even order symmetry tensors
- An even order symmetric \(B\) tensor is positive definite
- Even order uniform hypergraph via the Einstein product
- Alternating Mahalanobis Distance Minimization for Accurate and Well-Conditioned CP Decomposition
- A survey on the spectral theory of nonnegative tensors.
- Convergence of a transition probability tensor of a higher-order Markov chain to the stationary probability vector.
- Computing all Laplacian H-eigenvalues for a uniform loose path of length three
- Accelerating the computation of tensor Z-eigenvalues
- An iterative algorithm based on strong \(\mathcal{H} \)-tensors for identifying positive definiteness of irreducible homogeneous polynomial forms
- On the spectrum of hypergraphs
- Spectral directed hypergraph theory via tensors
- Solving tensor E-eigenvalue problem faster
- Locally Optimal Eigenpairs of Orthogonally Decomposable Tensors: A Generalized Proof
- Extremal spectral radii of uniform supertrees
- Circulant tensors with applications to spectral hypergraph theory and stochastic process
- Finding all \(H\)-eigenvalues of signless Laplacian tensor for a uniform loose path of length three
- Spectral properties of odd-bipartite \(Z\)-tensors and their absolute tensors
- A self-adaptive trust region method for extreme \(\mathcal {B}\)-eigenvalues of symmetric tensors
- \(p\)-norm \(B\)-tensors and \(p\)-norm \(B_0\)-tensors
- Low-dimensional subspace regularization through structured tensor priors
- An adaptive cubic regularization algorithm for computing H- and Z-eigenvalues of real even-order supersymmetric tensors
- Further results on Cauchy tensors and Hankel tensors
- Computing hypermatrix spectra with the Poisson product formula
- Some new trace formulas of tensors with applications in spectral hypergraph theory
- The Laplacian of a uniform hypergraph
- Exceptionally regular tensors and tensor complementarity problems
- Further study on \(Z\)-eigenvalue localization set and positive definiteness of fourth-order tensors
- Computing the generalized eigenvalues of weakly symmetric tensors
- \(Z\)-eigenvalue inclusion theorems for tensors
- Largest adjacency, signless Laplacian, and Laplacian H-eigenvalues of loose paths
This page was built for publication: The \(Z\)-eigenvalues of a symmetric tensor and its application to spectral hypergraph theory.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2936746)
