A semidefinite program approach for computing the maximum eigenvalue of a class of structured tensors and its applications in hypergraphs and copositivity test

DOI10.1002/nla.2125zbMath1438.65060OpenAlexW2766794278WikidataQ114235433 ScholiaQ114235433MaRDI QIDQ4637394

Guoyin Li, Liqun Qi, Yannan Chen, Hai-Bin Chen

Publication date: 18 April 2018

Published in: Numerical Linear Algebra with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nla.2125

zbMATH Keywords

eigenvalue copositivity Laplacian tensor sum-of-squares polynomials semidefinite program structured tensors spectral hypergraph

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Multilinear algebra, tensor calculus (15A69)

Related Items (36)

An iterative scheme for testing the positive definiteness of multivariate homogeneous forms ⋮ A linearly convergent algorithm for sparse signal reconstruction ⋮ Some inequalities for the Fan product of \(M\)-tensors ⋮ Further results on sum-of-squares tensors ⋮ The iterative solution of a class of tensor equations via Einstein product with a tensor inequality constraint ⋮ Further study on tensor absolute value equations ⋮ Further results on eigenvalues of symmetric decomposable tensors from multilinear dynamical systems ⋮ New M-eigenvalue intervals and application to the strong ellipticity of fourth-order partially symmetric tensors ⋮ High-order sum-of-squares structured tensors: theory and applications ⋮ A relaxed self-adaptive projection algorithm for solving the multiple-sets split equality problem ⋮ A proximal alternating minimization algorithm for the largest C-eigenvalue of piezoelectric-type tensors ⋮ \(Z\)-eigenvalue exclusion theorems for tensors ⋮ Copositive tensor optimization problem and its applications to hypergraphs ⋮ Solving shifted linear systems with restarted GMRES augmented with error approximations ⋮ The general two-sweep modulus-based matrix splitting iteration method for solving linear complementarity problems ⋮ Multiple-try simulated annealing algorithm for global optimization ⋮ An iterative algorithm to solve the generalized Sylvester tensor equations ⋮ C-eigenvalue inclusion theorems for piezoelectric-type tensors ⋮ On Smoothingl₁Exact Penalty Function for Constrained Optimization Problems ⋮ HIGH-ORDER COPOSITIVE TENSORS AND ITS APPLICATIONS ⋮ Geometry of the Copositive Tensor Cone and its Dual ⋮ An alternative extragradient projection method for quasi-equilibrium problems ⋮ An iterative scheme for identifying the positive semi-definiteness of even-order real symmetric H-tensor ⋮ Column sufficient tensors and tensor complementarity problems ⋮ A globally and quadratically convergent algorithm for solving multilinear systems with \(\mathcal {M}\)-tensors ⋮ The tensor Padé-type approximant with application in computing tensor exponential function ⋮ \(M\)-eigenvalues-based sufficient conditions for the positive definiteness of fourth-order partially symmetric tensors ⋮ A potential reduction method for tensor complementarity problems ⋮ Test of copositive tensors ⋮ M-positive semi-definiteness and M-positive definiteness of fourth-order partially symmetric Cauchy tensors ⋮ New lower bounds for the minimum M-eigenvalue of elasticity M-tensors and applications ⋮ An efficient alternating minimization method for fourth degree polynomial optimization ⋮ Unconstrained minimization of block-circulant polynomials via semidefinite program in third-order tensor space ⋮ Birkhoff-von Neumann theorem and decomposition for doubly stochastic tensors ⋮ On the M-eigenvalue estimation of fourth-order partially symmetric tensors ⋮ α_βΩ-inclusion sets for general C-eigenvalues of a general piezoelectric-type tensor

Uses Software

This page was built for publication: A semidefinite program approach for computing the maximum eigenvalue of a class of structured tensors and its applications in hypergraphs and copositivity test