SDP relaxation algorithms for \(\mathbf{P(P}_0)\)-tensor detection (Q2307706): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: GloptiPoly / rank | |||
Normal rank | |||
Revision as of 13:31, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | SDP relaxation algorithms for \(\mathbf{P(P}_0)\)-tensor detection |
scientific article |
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
