Computing Eigenvalues of Large Scale Sparse Tensors Arising from a Hypergraph
From MaRDI portal
Publication:2833535
DOI10.1137/16M1060224zbMath1350.05109arXiv1603.07350OpenAlexW2963583288MaRDI QIDQ2833535
Jingya Chang, Liqun Qi, Yannan Chen
Publication date: 18 November 2016
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1603.07350
hypergrapheigenvalueŁojasiewicz inequalityL-BFGSLaplacian tensorspherical optimizationlarge scale tensorsparse tensor
Programming involving graphs or networks (90C35) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical mathematical programming methods (65K05) Methods of quasi-Newton type (90C53) Hypergraphs (05C65) Eigenvalues, singular values, and eigenvectors (15A18) Multilinear algebra, tensor calculus (15A69)
Related Items
A trust region algorithm for computing extreme eigenvalues of tensors ⋮ Riemannian conjugate gradient methods for computing the extreme eigenvalues of symmetric tensors ⋮ Computing all Laplacian H-eigenvalues for a uniform loose path of length three ⋮ A combinatorial method for computing characteristic polynomials of starlike hypergraphs ⋮ A tensor optimization algorithm for computing Lagrangians of hypergraphs ⋮ Even order uniform hypergraph via the Einstein product ⋮ The Fiedler Vector of a Laplacian Tensor for Hypergraph Partitioning ⋮ An adaptive cubic regularization algorithm for computing H- and Z-eigenvalues of real even-order supersymmetric tensors ⋮ A family of gradient methods using Householder transformation with application to hypergraph partitioning ⋮ Eigenvalue bounds of third-order tensors via the minimax eigenvalue of symmetric matrices ⋮ \(H\)-eigenvalue inclusion sets for sparse tensors ⋮ Hyperspectral super-resolution via low rank tensor triple decomposition ⋮ Hypergraph Clustering Using a New Laplacian Tensor with Applications in Image Processing ⋮ Finding all H-Eigenvalues of Signless Laplacian Tensor for a Uniform Loose Path of Length Three ⋮ Computing the \(p\)-spectral radii of uniform hypergraphs with applications ⋮ Computing the largest H-eigenvalue of large-scale tensors generated from directed hypergraphs ⋮ A derivative-free algorithm for spherically constrained optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A feasible method for optimization with orthogonality constraints
- The \(H\)-spectra of a class of generalized power hypergraphs
- An unconstrained optimization approach for finding real eigenvalues of even order symmetric tensors
- Spectra of uniform hypergraphs
- \(H^{+}\)-eigenvalues of Laplacian and signless Laplacian tensors
- Laplacian and signless Laplacian Z-eigenvalues of uniform hypergraphs
- Spectral clustering and the high-dimensional stochastic blockmodel
- An always convergent algorithm for the largest eigenvalue of an irreducible nonnegative tensor
- On spectral hypergraph theory of the adjacency tensor
- On the limited memory BFGS method for large scale optimization
- On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
- Z-eigenvalue methods for a global polynomial optimization problem
- Perron-Frobenius theorem for nonnegative multilinear forms and extensions
- Efficient algorithms for computing the largest eigenvalue of a nonnegative tensor
- Consistency of spectral clustering in stochastic block models
- A quadratically convergent algorithm for finding the largest eigenvalue of a nonnegative homogeneous polynomial map
- Computing extreme eigenvalues of large scale Hankel tensors
- \(M\)-tensors and nonsingular \(M\)-tensors
- Eigenvalues of a real supersymmetric tensor
- On eigenvalue problems of real symmetric tensors
- Computing Tensor Eigenvalues via Homotopy Methods
- A Block Coordinate Descent Method for Regularized Multiconvex Optimization with Applications to Nonnegative Tensor Factorization and Completion
- Partitioning Hypergraphs in Scientific Computing Applications through Vertex Separators on Graphs
- $M$-Tensors and Some Applications
- On the largest eigenvalue of a symmetric nonnegative tensor
- A sequential subspace projection method for extreme Z-eigenvalues of supersymmetric tensors
- Primitivity, the Convergence of the NQZ Method, and the Largest Eigenvalue for Nonnegative Tensors
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- Shifted Power Method for Computing Tensor Eigenpairs
- Some spectral properties and characterizations of connected odd-bipartite uniform hypergraphs
- Multilinear PageRank
- Finding the Largest Eigenvalue of a Nonnegative Tensor
- Two-Point Step Size Gradient Methods
- Updating Quasi-Newton Matrices with Limited Storage
- An Adaptive Shifted Power Method for Computing Generalized Tensor Eigenpairs
- All Real Eigenvalues of Symmetric Tensors
- Adaptive Hypergraph Learning and its Application in Image Classification
- 3-D Object Retrieval and Recognition With Hypergraph Analysis
- Approximate Hypergraph Partitioning and Applications
- Most Tensor Problems Are NP-Hard
- The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
- Convergence of the Iterates of Descent Methods for Analytic Cost Functions
- Generalized Tensor Eigenvalue Problems
