SDP relaxation algorithms for \(\mathbf{P(P}_0)\)-tensor detection (Q2307706): Difference between revisions

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.