Abstract
\(\mathbf {P}\)-tensor and \(\mathbf {P}_0\)-tensor are introduced in tensor complementarity problem, which have wide applications in game theory. In this paper, we establish SDP relaxation algorithms for detecting \(\mathbf {P}(\mathbf {P}_0)\)-tensor. We first reformulate \(\mathbf {P}(\mathbf {P}_0)\)-tensor detection problem as polynomial optimization problems. Then we propose the SDP relaxation algorithms for solving the reformulated polynomial optimization problems. Numerical examples are reported to show the efficiency of the proposed algorithms.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bochnak, J., Coste, M., Roy, M.-F.: Real Algebraic Geometry. Springer, Berlin (1998)
Berman, A., Plemmons, R.J.: Nonnegative Matrices in the Mathematical Sciences. SIAM Press, PA (1994)
Coxson, G.E.: The P-matrix problem is co-NP-complete. Math. Program. 64(1–3), 173–178 (1994)
Cui, C., Dai, Y., Nie, J.: All real eigenvalues of symmetric tensors. SIAM J. Matrix Anal. Appl. 35(4), 1582–1601 (2014)
Chen, H., Li, G., Qi, L.: SOS tensor decomposition: theory and applications. Commun. Math. Sci. 14(8), 2073–2100 (2016)
Cottle, R., Pang, J., Stone, R.: The linear Complementarity problem. Academic Press, Boston (1992)
Ding, W., Luo, Z., Qi, L.: \(P\)-tensor, \(P_0\)-tensor, and their applications. Linear Algebra Appl. 555, 336–354 (2018)
Facchinei, F., Pang, J.: Finite Dimensionl Variatioal Inequalities and Complementarity Problems. Springer, New York (2003)
Gharbia, I.B., Gilbert, J.C.H.: An algorithmic characterization of P-matricity. SIAM J. Matrix Anal. Appl. 34(3), 904–916 (2013)
Gartner, B., Sprecher, M.: A polynomial-time algorithm for the tridiagonal and Hessenberg P-matrix linear complementarity problem. Oper. Res. Lett. 40(6), 484–486 (2012)
Hillar, C.J., Lim, L.K.: Most tensor problems are NP-hard. J. ACM 60, 45 (2013)
Henrion, D., Lasserre, J., Lofberg, J.: GloptiPoly 3: moments, optimization and semidfinite programming. Optim. Methods Softw. 24(4–5), 761–779 (2009)
Huang, Z., Qi, L.: Formulating an n-person noncooperative game as a tensor complementarity problem. Comput. Optim. Appl. 66(3), 557–576 (2017)
Huang, Z., Qi, L.: “Tensor complementarity problems – part I: basic theory”. J. Optim. Theory Appl. 183(1), 1–23 (2019)
Huang, Z., Qi, L.:“Tensor complementarity problems—part III: applications. J. Optim. Theory Appl. (to appear)
Kolda, T., Mayo, J.: Shifted power method for computing tensor eigenpairs. SIAM J. Matrix Anal. Appl. 32(4), 1095–1124 (2011)
Lasserre, J.: Global optimization with polynomials and the problem of moments. SIAM J. Optim. 11(3), 796–817 (2001)
Lasserre, J.: Moments, Positive Polynomials and Their Applications. Imperial College Press, London (2009)
Laurent, M.: Sums of squares, moment matrices and optimization over polynomials. In: Putinar, M., Sullivant, S. (eds.)Emerging Applications of Algebraic Geometry, IMA Volumes in Mathematics and its Applications, vol. 149. Springer, pp. 157–270 (2009)
Li, L., Hattori, K.: An asymptotic approach for testing \(P_0\)-matrices. Electron. Notes Theor. Comput. Sci. 225, 195–200 (2009)
Nie, J.: Certifying convergence of lasserre’s hierarchy via flat truncation. Math. Program. 142, 485–510 (2013)
Nie, J., Yang, Z., Zhang, X.: A complete semidefinite algorithm for detecting copositive matrices and tensors. SIAM J. Optim. 28(4), 2902–2921 (2018)
Nie, J., Zhang, X.: Real eigenvalues of nonsymmetric tensors. Comput. Optim. Appl. 70, 1–32 (2018)
Qi, L.: Eigenvalues of a real supersymmetric tensor. J. Symbol. Comput. 40(6), 1302–1324 (2005)
Qi, L.: Eigenvalues and invariants of tensors. J. Math. Anal. Appl. 325(2), 1363–1377 (2007)
Qi, L.: The best rank-one approximation ratio of a tensor space. SIAM J. Matrix Anal. Appl. 32, 430–442 (2011)
Qi, L., Huang, Z.: Tensor complementarity problems—part II: solution methods. J. Optim. Theory Appl. 183(2), 365–385 (2019)
Qi, L., Wang, F., Wang, Y.: Z-eigenvalue methods for a global polynomial optimization problem. Math. Program. 118(2), 301–316 (2009)
Schweighofer, M.: Optimization of polynomials on compact semialgebraic sets. SIAM J. Optim. 3, 805–825 (2005)
Sturm, J.: Using SeDuMi 1.02: a matlab toolbox for optimizatoin over symmertic cones. Optim. Methods Softw. 11(1–4), 625–653 (1999)
Song, Y., Qi, L.: Properties of some classes of structured tensors. J. Optim. Theory Appl. 165(3), 854–873 (2015)
Tseng, P.: Co-NP-completeness of some matrix classification problems. Math. Program. 88, 183–192 (2000)
Tsatsomeros, M.J., Li, L.: A recursive test for \(P\)-matrices. BIT 40, 410–414 (2000)
Yuan, P., You, L.: Some remarks on \(P, P_0, B\) and \(B_0\)-tensors. Linear Algebra Appl. 459(3), 511–521 (2014)
Zhang, X., Qi, L., Ye, Y.: The cubic spherical optimization problems. Math. Comput. 81(81), 1513–1526 (2012)
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Xinzhen Zhang was partially supported by the National Natural Science Foundation of China (Grant No. 11871369). Guangming Zhou was partially supported by the National Natural Science Foundation of China (Grant No. 11671342).
Rights and permissions
About this article
Cite this article
Wang, X., Zhang, X. & Zhou, G. SDP relaxation algorithms for \(\mathbf {P}(\mathbf {P}_0)\)-tensor detection. Comput Optim Appl 75, 739–752 (2020). https://doi.org/10.1007/s10589-019-00145-2
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10589-019-00145-2