SDP relaxation algorithms for \(\mathbf{P(P}_0)\)-tensor detection (Q2307706)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: SDP relaxation algorithms for \(\mathbf{P(P}_0)\)-tensor detection |
scientific article; zbMATH DE number 7181819
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | SDP relaxation algorithms for \(\mathbf{P(P}_0)\)-tensor detection |
scientific article; zbMATH DE number 7181819 |
Statements
SDP relaxation algorithms for \(\mathbf{P(P}_0)\)-tensor detection (English)
0 references
25 March 2020
0 references
The authors address the problems of detecting \(\mathbf{P}\)-tensors and \(\mathbf{P(P}_0)\)-tensors in tensor complementarity problems. These are first reformulated as polynomial optimization problems, for the solving of which SDP relaxation algorithms are proposed. The efficiency of the proposed numerical methods is tested by means of numerical experiments.
0 references
tensor
0 references
Lasserre's hierarchy
0 references
semidefinite program
0 references
0 references
