{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,28]],"date-time":"2026-07-28T18:11:51Z","timestamp":1785262311078,"version":"3.55.0"},"reference-count":63,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2019,8,16]],"date-time":"2019-08-16T00:00:00Z","timestamp":1565913600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,8,16]],"date-time":"2019-08-16T00:00:00Z","timestamp":1565913600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"the Hong Kong Research Grant Council","award":["PolyU 15302114"],"award-info":[{"award-number":["PolyU 15302114"]}]},{"name":"the Hong Kong Research Grant Council","award":["15300715"],"award-info":[{"award-number":["15300715"]}]},{"name":"the Hong Kong Research Grant Council","award":["15301716"],"award-info":[{"award-number":["15301716"]}]},{"name":"the Hong Kong Research Grant Council","award":["15300717"],"award-info":[{"award-number":["15300717"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["11431002"],"award-info":[{"award-number":["11431002"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["11871051"],"award-info":[{"award-number":["11871051"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Optim Theory Appl"],"published-print":{"date-parts":[[2019,11,1]]},"DOI":"10.1007\/s10957-019-01568-x","type":"journal-article","created":{"date-parts":[[2019,8,16]],"date-time":"2019-08-16T05:03:01Z","timestamp":1565931781000},"page":"365-385","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":70,"title":["Tensor Complementarity Problems\u2014Part II: Solution Methods"],"prefix":"10.1007","volume":"183","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1112-5250","authenticated-orcid":false,"given":"Liqun","family":"Qi","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zheng-Hai","family":"Huang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2019,8,16]]},"reference":[{"key":"1568_CR1","doi-asserted-by":"crossref","unstructured":"Huang, Z.H., Qi, L.: Tensor complementarity problems\u2014part I: basic theory. J. Optim. Theory Appl. (2019). https:\/\/doi.org\/10.1007\/s10957-019-01566-z","DOI":"10.1007\/s10957-019-01566-z"},{"issue":"3","key":"1568_CR2","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1007\/s11590-016-1013-9","volume":"11","author":"Z Luo","year":"2017","unstructured":"Luo, Z., Qi, L., Xiu, N.: The sparsest solutions to $$Z$$-tensor complementarity problems. Optim. Lett. 11(3), 471\u2013482 (2017)","journal-title":"Optim. Lett."},{"issue":"4","key":"1568_CR3","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1007\/s11590-018-1268-4","volume":"13","author":"HR Xu","year":"2019","unstructured":"Xu, H.R., Li, D.H., Xie, S.L.: An equivalent tensor equation to the tensor complementarity problem with positive semi-definite $$Z$$-tensor. Optim. Lett. 13(4), 685\u2013694 (2019)","journal-title":"Optim. Lett."},{"key":"1568_CR4","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/s10957-017-1157-5","volume":"175","author":"SL Xie","year":"2017","unstructured":"Xie, S.L., Li, D.H., Xu, H.R.: An iterative method for finding the least solution to the tensor complementarity problem. J. Optim. Theory Appl. 175, 119\u2013136 (2017)","journal-title":"J. Optim. Theory Appl."},{"key":"1568_CR5","doi-asserted-by":"publisher","DOI":"10.1002\/9781118032701","volume-title":"Interior Point Algorithms: Theory and Analysis","author":"YY Ye","year":"1997","unstructured":"Ye, Y.Y.: Interior Point Algorithms: Theory and Analysis. Wiley, New York (1997)"},{"key":"1568_CR6","doi-asserted-by":"publisher","first-page":"949","DOI":"10.1007\/s10957-018-1422-2","volume":"180","author":"L Han","year":"2019","unstructured":"Han, L.: A continuation method for tensor complementarity problems. J. Optim. Theory Appl. 180, 949\u2013963 (2019)","journal-title":"J. Optim. Theory Appl."},{"issue":"2","key":"1568_CR7","doi-asserted-by":"crossref","first-page":"429","DOI":"10.3934\/jimo.2018049","volume":"15","author":"KL Zhang","year":"2019","unstructured":"Zhang, K.L., Chen, H.B., Zhao, P.F.: A potential reduction method for tensor complementarity problems. J. Ind. Manag. Optim. 15(2), 429\u2013443 (2019)","journal-title":"J. Ind. Manag. Optim."},{"issue":"3","key":"1568_CR8","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1007\/s10589-016-9872-7","volume":"66","author":"ZH Huang","year":"2017","unstructured":"Huang, Z.H., Qi, L.: Formulating an $$n$$-person noncooperative game as a tensor complementarity problem. Comput. Optim. Appl. 66(3), 557\u2013576 (2017)","journal-title":"Comput. Optim. Appl."},{"issue":"9","key":"1568_CR9","doi-asserted-by":"publisher","first-page":"1726","DOI":"10.1080\/03081087.2017.1369929","volume":"66","author":"D Liu","year":"2018","unstructured":"Liu, D., Li, W., Vong, S.W.: Tensor complementarity problems: the GUS-property and an algorithm. Linear Multilinear Algebra 66(9), 1726\u20131749 (2018)","journal-title":"Linear Multilinear Algebra"},{"key":"1568_CR10","doi-asserted-by":"publisher","first-page":"789","DOI":"10.1007\/s10898-018-00731-4","volume":"73","author":"S Du","year":"2019","unstructured":"Du, S., Zhang, L.: A mixed integer programming approach to the tensor complementarity problem. J. Glob. Optim. 73, 789\u2013800 (2019)","journal-title":"J. Glob. Optim."},{"issue":"4","key":"1568_CR11","doi-asserted-by":"publisher","first-page":"758","DOI":"10.1080\/10556788.2018.1439489","volume":"34","author":"X Zhao","year":"2019","unstructured":"Zhao, X., Fan, J.: A semidefinite method for tensor complementarity problems. Optim. Method Softw. 34(4), 758\u2013769 (2019)","journal-title":"Optim. Method Softw."},{"key":"1568_CR12","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1007\/BF01498415","volume":"89","author":"H Rademacher","year":"1919","unstructured":"Rademacher, H.: \u00dcber partielle und totale Differenzierbarkeit I. Math. Ann. 89, 340\u2013359 (1919)","journal-title":"Math. Ann."},{"key":"1568_CR13","doi-asserted-by":"crossref","first-page":"337","DOI":"10.21136\/CPM.1988.118346","volume":"113","author":"A Nekvinda","year":"1988","unstructured":"Nekvinda, A., Zaj\u0301\u01d0cek, L.: A simple proof of Rademacher theorem. \u010casopis P\u011bst. Mat. 113, 337\u2013341 (1988)","journal-title":"\u010casopis P\u011bst. Mat."},{"key":"1568_CR14","volume-title":"Optimization and Nonsmooth Analysis","author":"F Clarke","year":"1983","unstructured":"Clarke, F.: Optimization and Nonsmooth Analysis. Wiley, New York (1983)"},{"issue":"6","key":"1568_CR15","doi-asserted-by":"publisher","first-page":"959","DOI":"10.1137\/0315061","volume":"15","author":"R Mifflin","year":"1977","unstructured":"Mifflin, R.: Semismooth and semiconvex functions in constrained optimization. SIAM J. Control Optim. 15(6), 959\u2013972 (1977)","journal-title":"SIAM J. Control Optim."},{"key":"1568_CR16","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/BF01581275","volume":"58","author":"L Qi","year":"1993","unstructured":"Qi, L., Sun, J.: A nonsmooth version of Newton\u2019s method. Math. Program. 58, 353\u2013367 (1993)","journal-title":"Math. Program."},{"key":"1568_CR17","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1287\/moor.18.1.227","volume":"18","author":"L Qi","year":"1993","unstructured":"Qi, L.: Convergence analysis of some algorithms for solving nonsmooth equations. Math. Oper. Res. 18, 227\u2013244 (1993)","journal-title":"Math. Oper. Res."},{"issue":"2","key":"1568_CR18","doi-asserted-by":"publisher","first-page":"689","DOI":"10.1007\/s10915-015-0156-7","volume":"68","author":"W Ding","year":"2016","unstructured":"Ding, W., Wei, Y.: Solving multi-linear systems with $$M$$-mensors. J. Sci. Comput. 68(2), 689\u2013715 (2016)","journal-title":"J. Sci. Comput."},{"issue":"3","key":"1568_CR19","doi-asserted-by":"publisher","first-page":"649","DOI":"10.1007\/s11464-014-0377-3","volume":"10","author":"X Li","year":"2015","unstructured":"Li, X., Ng, M.K.: Solving sparse non-negative tensor equations: algorithms and applications. Front. Math. China 10(3), 649\u2013680 (2015)","journal-title":"Front. Math. China"},{"key":"1568_CR20","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/j.aml.2017.01.019","volume":"69","author":"L Han","year":"2017","unstructured":"Han, L.: A homotopy method for solving multilinear systems with $$M$$-tensors. Appl. Math. Lett. 69, 49\u201354 (2017)","journal-title":"Appl. Math. Lett."},{"issue":"9","key":"1568_CR21","doi-asserted-by":"publisher","first-page":"1894","DOI":"10.1080\/03081087.2016.1265060","volume":"65","author":"ZJ Xie","year":"2017","unstructured":"Xie, Z.J., Jin, X.Q., Wei, Y.: A fast algorithm for solving circulant tensor systems. Linear Multilinear Algebra 65(9), 1894\u20131904 (2017)","journal-title":"Linear Multilinear Algebra"},{"issue":"1","key":"1568_CR22","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1007\/s10915-017-0444-5","volume":"74","author":"ZJ Xie","year":"2018","unstructured":"Xie, Z.J., Jin, X.Q., Wei, Y.: Tensor methods for solving symmetric $${\\mathscr {M}}$$-tensor systems. J. Sci. Comput. 74(1), 412\u2013425 (2018)","journal-title":"J. Sci. Comput."},{"issue":"5","key":"1568_CR23","doi-asserted-by":"publisher","first-page":"e2102","DOI":"10.1002\/nla.2102","volume":"24","author":"DH Li","year":"2017","unstructured":"Li, D.H., Xie, S.L., Xu, H.R.: Splitting methods for tensor equations. Numer. Linear Algebra Appl. 24(5), e2102 (2017). https:\/\/doi.org\/10.1002\/nla.2102","journal-title":"Numer. Linear Algebra Appl."},{"issue":"1","key":"1568_CR24","first-page":"75","volume":"330","author":"DD Liu","year":"2017","unstructured":"Liu, D.D., Li, W., Vong, S.: The tensor splitting with application to solve multi-linear systems. J. Comput. Appl. Math. 330(1), 75\u201394 (2017)","journal-title":"J. Comput. Appl. Math."},{"key":"1568_CR25","doi-asserted-by":"publisher","first-page":"1718","DOI":"10.1007\/s10915-018-0689-7","volume":"76","author":"H He","year":"2018","unstructured":"He, H., Ling, C., Qi, L., Zhou, G.: A globally and quadratically convergent algorithm for solving multilinear systems with $$M$$-tensors. J. Sci. Comput. 76, 1718\u20131741 (2018)","journal-title":"J. Sci. Comput."},{"key":"1568_CR26","unstructured":"Bai, X.L., He, H., Ling, C., Zhou, G.: An efficient nonnegativity preserving algorithm for multilinear systems with nonsingular $$M$$-tensors (2018). arXiv:1811.09917"},{"key":"1568_CR27","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/j.aml.2019.05.046","volume":"98","author":"X Wang","year":"2019","unstructured":"Wang, X., Che, M., Wei, Y.: Existence and uniqueness of positive solution for $${\\mathscr {H}}^{+}$$-tensor equations. Appl. Math. Lett. 98, 191\u2013198 (2019)","journal-title":"Appl. Math. Lett."},{"key":"1568_CR28","first-page":"3","volume":"76","author":"MJ Todd","year":"1996","unstructured":"Todd, M.J.: Potential-reduction methods in mathematical programming. Math. Program. 76, 3\u201345 (1996)","journal-title":"Math. Program."},{"issue":"2","key":"1568_CR29","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1007\/s10957-015-0773-1","volume":"168","author":"M Che","year":"2016","unstructured":"Che, M., Qi, L., Wei, Y.: Positive-definite tensors to nonlinear complementarity problems. J. Optim. Theory Appl. 168(2), 475\u2013487 (2016)","journal-title":"J. Optim. Theory Appl."},{"key":"1568_CR30","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/BF01581689","volume":"65","author":"M Kojima","year":"1994","unstructured":"Kojima, M., Noma, T., Yoshise, A.: Global convergence in infeasible-interior-point algorithms. Math. Program. 65, 43\u201372 (1994)","journal-title":"Math. Program."},{"key":"1568_CR31","doi-asserted-by":"publisher","first-page":"508","DOI":"10.1287\/moor.15.3.508","volume":"15","author":"M Todd","year":"1990","unstructured":"Todd, M., Ye, Y.Y.: A centered projective algorithm for linear programming. Math. Oper. Res. 15, 508\u2013529 (1990)","journal-title":"Math. Oper. Res."},{"key":"1568_CR32","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/BF02592210","volume":"74","author":"T Wang","year":"1996","unstructured":"Wang, T., Monteiro, R., Pang, J.S.: An interior point potential reduction method for constrained equations. Math. Program. 74, 159\u2013195 (1996)","journal-title":"Math. Program."},{"key":"1568_CR33","doi-asserted-by":"publisher","first-page":"259","DOI":"10.3934\/jimo.2010.6.259","volume":"6","author":"FM Ma","year":"2010","unstructured":"Ma, F.M., Wang, Y.J., Zhao, H.: A potential reduction algorithm for generalized linear complementarity problem over a polyhedral cone. J. Ind. Manag. Optim. 6, 259\u2013267 (2010)","journal-title":"J. Ind. Manag. Optim."},{"key":"1568_CR34","first-page":"107","volume":"14","author":"M Kojima","year":"1989","unstructured":"Kojima, M., Mizuno, M., Noma, T.: A new continuation method for complementarity problems with uniform $$P$$-functions. Math. Oper. Res. 14, 107\u2013113 (1989)","journal-title":"Math. Oper. Res."},{"key":"1568_CR35","doi-asserted-by":"publisher","first-page":"754","DOI":"10.1287\/moor.16.4.754","volume":"16","author":"M Kojima","year":"1991","unstructured":"Kojima, M., Megiddo, N., Noma, T.: Homotopy continuation method for nonlinear complementarity problems. Math. Oper. Res. 16, 754\u2013774 (1991)","journal-title":"Math. Oper. Res."},{"key":"1568_CR36","doi-asserted-by":"publisher","first-page":"945","DOI":"10.1287\/moor.18.4.945","volume":"18","author":"M Kojima","year":"1993","unstructured":"Kojima, M., Megiddo, N., Mizuno, M.: A general framework of continuation methods for complementarity problems. Math. Oper. Res. 18, 945\u2013963 (1993)","journal-title":"Math. Oper. Res."},{"issue":"5","key":"1568_CR37","doi-asserted-by":"publisher","first-page":"681","DOI":"10.1080\/02331930802355317","volume":"57","author":"Q Xu","year":"2008","unstructured":"Xu, Q., Dang, C.: A new homotopy method for solving non-linear complementarity problems. Optimization 57(5), 681\u2013689 (2008)","journal-title":"Optimization"},{"key":"1568_CR38","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1287\/moor.26.1.119.10594","volume":"26","author":"YB Zhao","year":"2001","unstructured":"Zhao, Y.B., Li, D.: On a new homotopy continuation trajectory for nonlinear complementarity problems. Math. Oper. Res. 26, 119\u2013146 (2001)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"1568_CR39","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1137\/15M1010725","volume":"37","author":"L Chen","year":"2016","unstructured":"Chen, L., Han, L., Zhou, L.: Computing tensor eigenvalues via homotopy methods. SIAM J. Matrix Anal. Appl. 37(1), 290\u2013319 (2016)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"1568_CR40","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1023\/A:1008669226453","volume":"13","author":"D Sun","year":"1999","unstructured":"Sun, D., Qi, L.: On NCP-functions. Comput. Optim. Appl. 13, 201\u2013220 (1999)","journal-title":"Comput. Optim. Appl."},{"key":"1568_CR41","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/j.cam.2008.10.056","volume":"230","author":"S Hu","year":"2009","unstructured":"Hu, S., Huang, Z.H., Chen, J.-S.: Properties of a family of generalized NCP-functions and a derivative free algorithm for complementarity problems. J. Comput. Appl. Math. 230, 69\u201382 (2009)","journal-title":"J. Comput. Appl. Math."},{"key":"1568_CR42","doi-asserted-by":"publisher","first-page":"1168","DOI":"10.1137\/0614081","volume":"14","author":"B Chen","year":"1993","unstructured":"Chen, B., Harker, P.T.: A non-interior-point continuation method for linear complementarity problem. SIAM J. Matrix Anal. Appl. 14, 1168\u20131190 (1993)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"1568_CR43","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1090\/S0025-5718-98-00932-6","volume":"67","author":"X Chen","year":"1998","unstructured":"Chen, X., Qi, L., Sun, D.: Global and superlinear convergence of the smoothing Newton method and its application to general box constrained variational inequalities. Math. Comput. 67, 519\u2013540 (1998)","journal-title":"Math. Comput."},{"key":"1568_CR44","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s101079900127","volume":"87","author":"L Qi","year":"2000","unstructured":"Qi, L., Sun, D., Zhou, G.: A new look at smoothing Newton methods for nonlinear complementarity problems and box constrained variational inequality problems. Math. Program. 87, 1\u201335 (2000)","journal-title":"Math. Program."},{"key":"1568_CR45","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/s101079900111","volume":"87","author":"J Burke","year":"2000","unstructured":"Burke, J., Xu, S.: A non-interior predictor\u2013corrector path following algorithm for the monotone linear complementarity problem. Math. Program. 87, 113\u2013130 (2000)","journal-title":"Math. Program."},{"key":"1568_CR46","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1023\/A:1023648305969","volume":"117","author":"ZH Huang","year":"2003","unstructured":"Huang, Z.H., Han, J., Chen, Z.: A predictor\u2013corrector smoothing Newton algorithm, based on a new smoothing function, for solving the nonlinear complementarity problem with a $$P_0$$ function. J. Optim. Theory Appl. 117, 39\u201368 (2003)","journal-title":"J. Optim. Theory Appl."},{"key":"1568_CR47","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/s10107-003-0457-8","volume":"99","author":"ZH Huang","year":"2004","unstructured":"Huang, Z.H., Qi, L., Sun, D.: Sub-quadratic convergence of a smoothing Newton algorithm for the $$P_0$$- and monotone LCP. Math. Program. 99, 423\u2013441 (2004)","journal-title":"Math. Program."},{"key":"1568_CR48","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1007\/s10589-008-9180-y","volume":"45","author":"ZH Huang","year":"2010","unstructured":"Huang, Z.H., Ni, T.: Smoothing algorithms for complementarity problems over symmetric cones. Comput. Optim. Appl. 45, 557\u2013579 (2010)","journal-title":"Comput. Optim. Appl."},{"key":"1568_CR49","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1080\/02331939208843795","volume":"24","author":"A Fischer","year":"1992","unstructured":"Fischer, A.: A special Newton-type optimization method. Optimization 24, 269\u2013284 (1992)","journal-title":"Optimization"},{"key":"1568_CR50","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/s001860400384","volume":"61","author":"ZH Huang","year":"2005","unstructured":"Huang, Z.H.: Locating a maximally complementary solution of the monotone NCP by using noninterior-point smoothing algorithms. Math. Method Oper. Res. 61, 41\u201355 (2005)","journal-title":"Math. Method Oper. Res."},{"key":"1568_CR51","doi-asserted-by":"publisher","unstructured":"Wang, X., Che, M., Qi, L., Wei, Y.: Modified gradient dynamic approach to the tensor complementarity problem. Optim. Method Softw. (2019). https:\/\/doi.org\/10.1080\/10556788.2019.1578766","DOI":"10.1080\/10556788.2019.1578766"},{"key":"1568_CR52","volume-title":"Piecewise-Linear Modelling and Analysis","author":"W Van Bokhoven","year":"1981","unstructured":"Van Bokhoven, W.: Piecewise-Linear Modelling and Analysis. Proefschrift, Eindhoven (1981)"},{"key":"1568_CR53","volume-title":"Linear Complementarity, Linear and Nonlinear Programming","author":"KG Murty","year":"1988","unstructured":"Murty, K.G.: Linear Complementarity, Linear and Nonlinear Programming. Heldermann, Berlin (1988)"},{"key":"1568_CR54","doi-asserted-by":"publisher","first-page":"917","DOI":"10.1002\/nla.680","volume":"17","author":"ZZ Bai","year":"2010","unstructured":"Bai, Z.Z.: Modulus-based matrix splitting iteration methods for linear complementarity problems. Numer. Linear Algebra Appl. 17, 917\u2013933 (2010)","journal-title":"Numer. Linear Algebra Appl."},{"key":"1568_CR55","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1016\/j.cam.2015.04.006","volume":"288","author":"H Zheng","year":"2015","unstructured":"Zheng, H., Li, W.: The modulus-based nonsmooth Newton\u2019s method for solving linear complementarity problems. J. Comput. Appl. Math. 288, 116\u2013126 (2015)","journal-title":"J. Comput. Appl. Math."},{"key":"1568_CR56","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1080\/02331938808843365","volume":"19","author":"PM Pardalos","year":"1988","unstructured":"Pardalos, P.M.: Linear complementarity problems solvable by integer programming. Optimization 19, 467\u2013474 (1988)","journal-title":"Optimization"},{"key":"1568_CR57","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1137\/0909022","volume":"9","author":"PM Pardalos","year":"1988","unstructured":"Pardalos, P.M., Rosen, J.B.: Global optimization approach to the linear complementarity problems. SIAM J. Sci. Stat. Comput. 9, 341\u2013353 (1988)","journal-title":"SIAM J. Sci. Stat. Comput."},{"key":"1568_CR58","doi-asserted-by":"publisher","first-page":"796","DOI":"10.1137\/S1052623400366802","volume":"11","author":"JB Lasserre","year":"2001","unstructured":"Lasserre, J.B.: Global optimization with polynomials and the problem of moments. SIAM J. Optim. 11, 796\u2013817 (2001)","journal-title":"SIAM J. Optim."},{"key":"1568_CR59","doi-asserted-by":"publisher","first-page":"607","DOI":"10.1007\/s10208-007-9004-y","volume":"8","author":"JB Lasserre","year":"2008","unstructured":"Lasserre, J.B., Laurent, M., Rostalski, P.: Semidefinite characterization and computation of zero-dimensional real radical ideals. Found. Comput. Math. 8, 607\u2013647 (2008)","journal-title":"Found. Comput. Math."},{"key":"1568_CR60","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1007\/s10107-012-0589-9","volume":"142","author":"J Nie","year":"2013","unstructured":"Nie, J.: Certifying convergence of Lasserre\u2019s hierarchy via flat truncation. Math. Program. 142, 485\u2013510 (2013)","journal-title":"Math. Program."},{"key":"1568_CR61","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1007\/s10107-014-0845-2","volume":"151","author":"J Nie","year":"2015","unstructured":"Nie, J.: The hierarchy of local minimums in polynomial optimization. Math. Program. 151, 555\u2013583 (2015)","journal-title":"Math. Program."},{"key":"1568_CR62","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1016\/j.cam.2019.04.020","volume":"361","author":"S Hu","year":"2019","unstructured":"Hu, S., Wang, J., Huang, Z.H.: An inexact augmented Lagrangian multiplier method for solving quadratic complementary problems: an adapted algorithmic framework combining specific resolution techniques. J. Comput. Appl. Math. 361, 64\u201378 (2019)","journal-title":"J. Comput. Appl. Math."},{"key":"1568_CR63","doi-asserted-by":"publisher","unstructured":"Chen, C., Zhang, L.: Finding Nash equilibrium for a class of multi-person noncooperative games via solving tensor complementarity problem. Appl. Numer. Math. (2019). https:\/\/doi.org\/10.1016\/j.apnum.2019.05.013","DOI":"10.1016\/j.apnum.2019.05.013"}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-019-01568-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10957-019-01568-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-019-01568-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,25]],"date-time":"2022-09-25T19:17:41Z","timestamp":1664133461000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10957-019-01568-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,8,16]]},"references-count":63,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2019,11,1]]}},"alternative-id":["1568"],"URL":"https:\/\/doi.org\/10.1007\/s10957-019-01568-x","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"value":"0022-3239","type":"print"},{"value":"1573-2878","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,8,16]]},"assertion":[{"value":"11 February 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 July 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 August 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}