Abstract
In this paper, an SDP relaxation algorithm is proposed to test the copositivity of higher order tensors. By solving finitely many SDP relaxations, the proposed algorithm can determine the copositivity of higher order tensors. Furthermore, for any copositive but not strictly copositive tensor, the algorithm can also check it exactly. Some numerical results are reported to show the efficiency of the proposed algorithm.
| Original language | English |
|---|---|
| Pages (from-to) | 881-891 |
| Number of pages | 11 |
| Journal | Journal of Industrial and Management Optimization |
| Volume | 15 |
| Issue number | 2 |
| DOIs | |
| Publication status | Published - 1 Apr 2019 |
Keywords
- Polynomial optimization
- SDP relaxation
- Symmetric tensor
ASJC Scopus subject areas
- Business and International Management
- Strategy and Management
- Control and Optimization
- Applied Mathematics
Fingerprint
Dive into the research topics of 'Test of copositive tensors'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver