The Z -eigenvalues of a symmetric tensor and its application to spectral hypergraph theory
Publication:2936746
DOI10.1002/NLA.1877zbMath1313.65081OpenAlexW1944315015WikidataQ59241514 ScholiaQ59241514MaRDI QIDQ2936746
Guoyin Li, Gaohang Yu, Liqun Qi
Publication date: 6 January 2015
Published in: Numerical Linear Algebra with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nla.1877
hypergraphnumerical examplessymmetric tensorsemismoothnessspectral graph theorypolynomial optimizationcharacteristic tensormaximum \(Z\)-eigenvalue
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Hypergraphs (05C65) Multilinear algebra, tensor calculus (15A69)
Related Items (70)
Uses Software
Cites Work
- Tensor Decompositions and Applications
- Finding the maximum eigenvalue of essentially nonnegative symmetric tensors via sum of squares programming
- Spectra of uniform hypergraphs
- Necessary global optimality conditions for nonlinear programming problems with polynomial constraints
- Laplace eigenvalues of graphs---a survey
- Error bound results for generalized D-gap functions of nonsmooth variational inequality problems
- Perron-Frobenius theorem for nonnegative tensors
- Error bounds for systems of lower semicontinuous functions in Asplund spaces
- Z-eigenvalue methods for a global polynomial optimization problem
- The Łojasiewicz exponent of an analytic function at an isolated zero
- Sensitivity analysis of the gratest eigenvalue of a symmetric matrix via the \(\epsilon\)-subdifferential of the associated convex quadratic form
- Multivariate polynomial minimization and its application in signal processing
- Nonsmooth analysis of eigenvalues
- Algebraic connectivity of an even uniform hypergraph
- Semismoothness of the maximum eigenvalue function of a symmetric tensor and its application
- Global error bounds for piecewise convex polynomials
- A nonsmooth version of Newton's method
- Eigenvalues of a real supersymmetric tensor
- On eigenvalue problems of real symmetric tensors
- Global Optimization with Polynomials and the Problem of Moments
- On the Best Rank-1 Approximation of Higher-Order Supersymmetric Tensors
- A Newton-CG Augmented Lagrangian Method for Semidefinite Programming
- On the Asymptotically Well Behaved Functions and Global Error Bound for Convex Polynomials
- Nonsmooth Equations: Motivation and Algorithms
- Shifted Power Method for Computing Tensor Eigenpairs
- GloptiPoly 3: moments, optimization and semidefinite programming
- Error Bounds of Generalized D-Gap Functions for Nonsmooth and Nonmonotone Variational Inequality Problems
- Finding the Largest Eigenvalue of a Nonnegative Tensor
- Semismooth and Semiconvex Functions in Constrained Optimization
- On the Best Rank-1 and Rank-(R1 ,R2 ,. . .,RN) Approximation of Higher-Order Tensors
- An Eigenvalue Method for Testing Positive Definiteness of a Multivariate Form
- Pre- and Post-Processing Sum-of-Squares Programs in Practice
- Explicit bounds for the Łojasiewicz exponent in the gradient inequality for polynomials
- Second Order Sufficient Conditions for Weak and Strict Constrained Minima
- Semismooth Matrix-Valued Functions
- Higher Order Positive Semidefinite Diffusion Tensor Imaging
This page was built for publication: The Z -eigenvalues of a symmetric tensor and its application to spectral hypergraph theory