Copositive tensor detection and its applications in physics and hypergraphs
From MaRDI portal
Publication:683337
DOI10.1007/S10589-017-9938-1zbMATH Open1383.65061arXiv1609.07919OpenAlexW2557886673MaRDI QIDQ683337FDOQ683337
Authors: Zhenghai Huang, Liqun Qi, Haibin Chen 
Publication date: 6 February 2018
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Abstract: Copositivity of tensors plays an important role in vacuum stability of a general scalar potential, polynomial optimization, tensor complementarity problem and tensor generalized eigenvalue complementarity problem. In this paper, we propose a new algorithm for testing copositivity of high order tensors, and then present applications of the algorithm in physics and hypergraphs. For this purpose, we first give several new conditions for copositivity of tensors based on the representative matrix of a simplex. Then a new algorithm is proposed with the help of a proper convex subcone of the copositive tensor cone, which is defined via the copositivity of Z-tensors. Furthermore, by considering a sum-of-squares program problem, we define two new subsets of the copositive tensor cone and discuss their convexity. As an application of the proposed algorithm, we prove that the coclique number of a uniform hypergraph is equivalent with an optimization problem over the completely positive tensor cone, which implies that the proposed algorithm can be applied to compute an upper bound of the coclique number of a uniform hypergraph. Then we study another application of the proposed algorithm on particle physics in testing copositivity of some potential fields. At last, various numerical examples are given to show the performance of the algorithm.
Full work available at URL: https://arxiv.org/abs/1609.07919
Recommendations
- Copositivity detection of tensors: theory and algorithm
- A complete semidefinite algorithm for detecting copositive matrices and tensors
- Test of copositive tensors
- Hypergraph characterizations of copositive tensors
- A semidefinite program approach for computing the maximum eigenvalue of a class of structured tensors and its applications in hypergraphs and copositivity test.
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Hypergraphs (05C65)
Cites Work
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Some NP-complete problems in quadratic and nonlinear programming
- Eigenvalues of a real supersymmetric tensor
- Most tensor problems are NP-hard
- Criterions for the positive definiteness of real supersymmetric tensors
- Some properties of strong \(\mathcal{H}\)-tensors and general \(\mathcal{H}\)-tensors
- \(M\)-tensors and some applications
- Spectra of uniform hypergraphs
- \(H^{+}\)-eigenvalues of Laplacian and signless Laplacian tensors
- \(MB\)-tensors and \(MB_0\)-tensors
- Positive-definite tensors to nonlinear complementarity problems
- Eigenvalue analysis of constrained minimization problem for homogeneous polynomial
- Necessary and sufficient conditions for copositive tensors
- Symmetric nonnegative tensors and copositive tensors
- Pre- and Post-Processing Sum-of-Squares Programs in Practice
- On the cone eigenvalue complementarity problem for higher-order tensors
- An even order symmetric \(B\) tensor is positive definite
- Completely positive reformulations for polynomial optimization
- Positive definiteness and semi-definiteness of even order symmetric Cauchy tensors
- A general product of tensors with applications
- On the computational complexity of membership problems for the completely positive cone and its dual
- Exceptionally regular tensors and tensor complementarity problems
- Tensor complementarity problem and semi-positive tensors
- Global uniqueness and solvability for tensor complementarity problems
- Algorithmic copositivity detection by simplicial partition
- SOS tensor decomposition: theory and applications
- An improved algorithm to test copositivity
- Double \(B\)-tensors and quasi-double \(B\)-tensors
- Nonnegative tensor factorization, completely positive tensors, and a hierarchical elimination algorithm
- Numerical optimization for symmetric tensor decomposition
- Completely positive tensors: properties, easily checkable subclasses, and tractable relaxations
- Formulating an \(n\)-person noncooperative game as a tensor complementarity problem
- An algorithm for determining copositive matrices
- Copositivity detection of tensors: theory and algorithm
- Strictly semi-positive tensors and the boundedness of tensor complementarity problems
Cited In (38)
- Tensor complementarity problems. I: Basic theory
- Tensor complementarity problems. III: Applications
- Structured rectangular tensors and rectangular tensor complementarity problems
- Pseudospectra localization sets of tensors with applications
- Hypergraph characterizations of copositive tensors
- Copositivity for 3rd-order symmetric tensors and applications
- A complete semidefinite algorithm for detecting copositive matrices and tensors
- An SDP method for copositivity of partially symmetric tensors
- A semidefinite program approach for computing the maximum eigenvalue of a class of structured tensors and its applications in hypergraphs and copositivity test.
- Copositivity detection of tensors: theory and algorithm
- C-eigenvalue inclusion theorems for piezoelectric-type tensors
- A potential reduction method for tensor complementarity problems
- Test of copositive tensors
- Pareto eigenvalue inclusion theorems and copositive tensors
- High-order sum-of-squares structured tensors: theory and applications
- On computing minimal \(H\)-eigenvalue of sign-structured tensors
- On the M-eigenvalue estimation of fourth-order partially symmetric tensors
- Analytical expressions of copositivity for fourth-order symmetric tensors
- On copositiveness identification of partially symmetric rectangular tensors
- Geometry of the copositive tensor cone and its dual
- Further results on eigenvalues of symmetric decomposable tensors from multilinear dynamical systems
- αβΩ-inclusion sets for general C-eigenvalues of a general piezoelectric-type tensor
- A proximal alternating minimization algorithm for the largest C-eigenvalue of piezoelectric-type tensors
- Copositive tensor optimization problem and its applications to hypergraphs
- New M-eigenvalue intervals and application to the strong ellipticity of fourth-order partially symmetric tensors
- Solution structures of tensor complementarity problem
- High-order copositive tensors and its applications
- M-positive semi-definiteness and M-positive definiteness of fourth-order partially symmetric Cauchy tensors
- An efficient alternating minimization method for fourth degree polynomial optimization
- Copositivity of Three-Dimensional Symmetric Tensors
- Stability of solutions and continuity of solution maps of tensor complementarity problems
- Further results on sum-of-squares tensors
- \(\{0,1\}\) completely positive tensors and multi-hypergraphs
- A relaxed self-adaptive projection algorithm for solving the multiple-sets split equality problem
- Copositivity for a class of fourth-order symmetric tensors given by scalar dark matter
- Exclusion sets in the \(S\)-type eigenvalue localization sets for tensors
- New lower bounds for the minimum M-eigenvalue of elasticity M-tensors and applications
- Column sufficient tensors and tensor complementarity problems
Uses Software
This page was built for publication: Copositive tensor detection and its applications in physics and hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q683337)
