{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,31]],"date-time":"2025-12-31T01:15:55Z","timestamp":1767143755115,"version":"build-2238731810"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2020,5,11]],"date-time":"2020-05-11T00:00:00Z","timestamp":1589155200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,5,11]],"date-time":"2020-05-11T00:00:00Z","timestamp":1589155200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["1217180"],"award-info":[{"award-number":["1217180"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J. Appl. Math. Comput."],"published-print":{"date-parts":[[2020,10]]},"DOI":"10.1007\/s12190-020-01356-1","type":"journal-article","created":{"date-parts":[[2020,5,11]],"date-time":"2020-05-11T05:02:51Z","timestamp":1589173371000},"page":"313-330","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A new full-Newton step interior-point method for $$P_{*}(\\kappa )$$-LCP based on a positive-asymptotic kernel function"],"prefix":"10.1007","volume":"64","author":[{"given":"Mingwang","family":"Zhang","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6728-347X","authenticated-orcid":false,"given":"Kun","family":"Huang","sequence":"additional","affiliation":[]},{"given":"Mengmeng","family":"Li","sequence":"additional","affiliation":[]},{"given":"Yanli","family":"Lv","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,5,11]]},"reference":[{"issue":"4","key":"1356_CR1","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/BF02579150","volume":"4","author":"N Karmarkar","year":"1984","unstructured":"Karmarkar, N.: A new polynomial-time algorithm for linear programming. Combinatorica 4(4), 373\u2013395 (1984)","journal-title":"Combinatorica"},{"key":"1356_CR2","volume-title":"Theory and Algorithms for Linear Optimization: An Interior Point Approach","author":"C Roos","year":"1997","unstructured":"Roos, C., Terlaky, T., Vial, J-Ph: Theory and Algorithms for Linear Optimization: An Interior Point Approach. Wiley, Chichester (1997)"},{"key":"1356_CR3","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611971453","volume-title":"Primal-Dual Interior-Point Methods","author":"SJ Wright","year":"1997","unstructured":"Wright, S.J.: Primal-Dual Interior-Point Methods. SIAM, Philadelphia (1997)"},{"key":"1356_CR4","volume-title":"The Linear Complementarity Problem","author":"RW Cottle","year":"1992","unstructured":"Cottle, R.W., Pang, J.S., Stone, R.E.: The Linear Complementarity Problem. Academic Press, New York (1992)"},{"issue":"1\u20133","key":"1356_CR5","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/BF01586056","volume":"54","author":"C Roos","year":"1992","unstructured":"Roos, C., Vial, J-Ph: A polynomial method of approximate centers for linear programming. Math. Program. 54(1\u20133), 295\u2013305 (1992)","journal-title":"Math. Program."},{"key":"1356_CR6","volume-title":"Interior-Point Ploynomial Methods in Convex Programming","author":"E NeterrovR","year":"1994","unstructured":"NeterrovR, E., Nemirovskii, A.S.: Interior-Point Ploynomial Methods in Convex Programming. SIAM, Philadelphia (1994)"},{"issue":"1","key":"1356_CR7","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/s101070200296","volume":"93","author":"JM Peng","year":"2001","unstructured":"Peng, J.M., Roos, C., Terlaky, T.: Self-regular functions and new search directions for linear and semidefinite optimization. Math. Program. 93(1), 129\u2013171 (2001)","journal-title":"Math. Program."},{"key":"1356_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-54509-3","volume-title":"A Unified Approach to Interior Point Algorithms for Linear Complementarity Problems, Volume 538","author":"M Kojima","year":"1991","unstructured":"Kojima, M., Megiddo, N., Noma, T., Yoshise, A.: A Unified Approach to Interior Point Algorithms for Linear Complementarity Problems, Volume 538. Springer, Berlin (1991)"},{"issue":"1\u20133","key":"1356_CR9","first-page":"355","volume":"69","author":"JM Miao","year":"1995","unstructured":"Miao, J.M.: A quadratically convergent $$O((1+\\kappa )\\sqrt{n}L)$$-iteration algorithm for the $$P_{*}(\\kappa )$$-matrix linear complementarity problem. Math. Program. 69(1\u20133), 355\u2013368 (1995)","journal-title":"Math. Program."},{"issue":"1","key":"1356_CR10","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/BF02614385","volume":"76","author":"FA Potra","year":"1996","unstructured":"Potra, F.A., Sheng, R.Q.: Predictor-corrector algorithm for solving $$P_{*}(\\kappa )$$-matrix lcp from arbitrary positive starting points. Math. Program. 76(1), 223\u2013244 (1996)","journal-title":"Math. Program."},{"issue":"2","key":"1356_CR11","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/s10957-008-9440-0","volume":"140","author":"T Illes","year":"2009","unstructured":"Illes, T., Nagy, M., Terlaky, T.: Ep theorem for dual linear complementarity problems. J. Optim. Theory Appl. 140(2), 233\u2013238 (2009)","journal-title":"J. Optim. Theory Appl."},{"issue":"3","key":"1356_CR12","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/s10898-008-9348-0","volume":"47","author":"T Illes","year":"2010","unstructured":"Illes, T., Nagy, M., Terlaky, T.: A polynomial path-following interior point algorithm for general linear complementarity problems. J. Global Optim. 47(3), 329\u2013342 (2010)","journal-title":"J. Global Optim."},{"key":"1356_CR13","unstructured":"Peng, J.M., Roos, C., Terlaky, T., Yoshise, A.: Self-regular proximities and new search directions for nonlinear $$P_{*}(\\kappa )$$ complementarity problems. Tech. Rep., Faculty of Tech. Math. and Inform., Delft Univ. of Tech., The Netherlands (2000)"},{"issue":"1","key":"1356_CR14","first-page":"248","volume":"4","author":"YQ Bai","year":"2008","unstructured":"Bai, Y.Q., Lesaja, G., Roos, C.: A new class of polynomial interior-point algorithms for $$P_{*}(\\kappa )$$-linear complementarity problems. Pac. J. Optim. 4(1), 248\u2013263 (2008)","journal-title":"Pac. J. Optim."},{"issue":"6","key":"1356_CR15","first-page":"3014","volume":"20","author":"G Lesaja","year":"2010","unstructured":"Lesaja, G., Roos, C.: Unified analysis of kernel-based interior-point methods for $$P_{*}(\\kappa )$$-linear complementarity problems. J. Optim. 20(6), 3014\u20133039 (2010)","journal-title":"J. Optim."},{"issue":"1","key":"1356_CR16","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/s10255-018-0729-y","volume":"34","author":"P Ji","year":"2018","unstructured":"Ji, P., Zhang, M.W., Li, X.: A primal-dual large-update interior-point algorithm for $$P_{*}(\\kappa )$$-LCP based on a new class of kernel functions. Acta Math. Appl. Sin. Engl. Ser. 34(1), 119\u2013134 (2018)","journal-title":"Acta Math. Appl. Sin. Engl. Ser."},{"issue":"1","key":"1356_CR17","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/s10898-013-0090-x","volume":"59","author":"GQ Wang","year":"2014","unstructured":"Wang, G.Q., Yu, C.J., Teo, K.L.: A full-newton step feasible interior-point algorithm for $$P_{*}(\\kappa )$$-linear complementarity problems. J. Global Optim. 59(1), 81\u201399 (2014)","journal-title":"J. Global Optim."},{"key":"1356_CR18","first-page":"15","volume":"47","author":"Z Darvay","year":"2002","unstructured":"Darvay, Z.: A new algorithm for solving self-dual linear optimization problems. Studia Univ. Babe s-Bolyai Ser. Informatica 47, 15\u201326 (2002)","journal-title":"Studia Univ. Babe s-Bolyai Ser. Informatica"},{"issue":"1","key":"1356_CR19","first-page":"51","volume":"5","author":"Z Darvay","year":"2003","unstructured":"Darvay, Z.: New interior-point algorithms in linear programming. Adv. Model. Optim. 5(1), 51\u201392 (2003)","journal-title":"Adv. Model. Optim."},{"issue":"1","key":"1356_CR20","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1590\/S0101-82052006000100005","volume":"25","author":"M Achache","year":"2006","unstructured":"Achache, M.: A new primal-dual path-following method for convex quadratic programming. Comput. Appl. Math. 25(1), 97\u2013110 (2006)","journal-title":"Comput. Appl. Math."},{"issue":"2","key":"1356_CR21","doi-asserted-by":"publisher","first-page":"277","DOI":"10.17535\/crorr.2016.0019","volume":"7","author":"B Kheirfam","year":"2016","unstructured":"Kheirfam, B., Haghighi, M.: A full-newton step feasible interior-point algorithm for $$P_{*}(\\kappa )$$-lcp based on a new search direction. Croatian Oper. Res. Rev. 7(2), 277\u2013290 (2016)","journal-title":"Croatian Oper. Res. Rev."},{"issue":"6","key":"1356_CR22","doi-asserted-by":"publisher","first-page":"1105","DOI":"10.1007\/s11590-014-0800-4","volume":"9","author":"GQ Wang","year":"2015","unstructured":"Wang, G.Q., Fan, X.J., Zhu, D.T., Wang, D.Z.: New complexity analysis of a full-newton step feasible interior-point algorithm for $$P_{*}(\\kappa )$$-LCP. Optim. Lett. 9(6), 1105\u20131119 (2015)","journal-title":"Optim. Lett."},{"issue":"1","key":"1356_CR23","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1016\/j.jmaa.2008.12.016","volume":"353","author":"GQ Wang","year":"2009","unstructured":"Wang, G.Q., Bai, Y.Q.: A new primal-dual path-following interior-point algorithm for semidefinite optimization. J. Math. Anal. Appl. 353(1), 339\u2013349 (2009)","journal-title":"J. Math. Anal. Appl."},{"issue":"3","key":"1356_CR24","doi-asserted-by":"publisher","first-page":"1047","DOI":"10.1016\/j.amc.2009.06.034","volume":"215","author":"GQ Wang","year":"2009","unstructured":"Wang, G.Q., Bai, Y.Q.: A primal-dual interior-point algorithm for second-order cone optimization with full nesterov-todd step. Appl. Math. Comput. 215(3), 1047\u20131061 (2009)","journal-title":"Appl. Math. Comput."},{"issue":"6","key":"1356_CR25","doi-asserted-by":"publisher","first-page":"889","DOI":"10.1080\/02331934.2018.1432610","volume":"67","author":"PR Takacs","year":"2018","unstructured":"Takacs, P.R., Darvay, Z.: A primal-dual interior-point algorithm for symmetric optimization based on a new method for finding search directions. Optimization 67(6), 889\u2013905 (2018)","journal-title":"Optimization"},{"issue":"5","key":"1356_CR26","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1016\/j.orl.2011.06.006","volume":"39","author":"L Zhang","year":"2011","unstructured":"Zhang, L., Xu, Y.H.: A full-newton step interior-point algorithm based on modified newton direction. Oper. Res. Lett. 39(5), 318\u2013322 (2011)","journal-title":"Oper. Res. Lett."},{"issue":"5","key":"1356_CR27","doi-asserted-by":"publisher","first-page":"1099","DOI":"10.1007\/s11590-017-1171-4","volume":"12","author":"Z Darvay","year":"2018","unstructured":"Darvay, Z., Takacs, P.R.: New method for determining search directions for interior-point algorithms in linear optimization. Optim. Lett. 12(5), 1099\u20131116 (2018)","journal-title":"Optim. Lett."},{"issue":"1","key":"1356_CR28","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/s10998-016-0119-2","volume":"73","author":"Z Darvay","year":"2016","unstructured":"Darvay, Z., Papp, I.M., Takacs, P.R.: Complexity analysis of a full-newton step interior-point method for linear optimization. Per. Math. Hungarica 73(1), 27\u201342 (2016)","journal-title":"Per. Math. Hungarica"},{"key":"1356_CR29","unstructured":"Darvay, Z., Takacs, P.R.: New interior-point algorithm for symmetric optimization based on a positive-asymptotic barrier function. Tech. Rep. Oper. Res. Report, Univ. of Sciences, Budapest (2016)"},{"issue":"1","key":"1356_CR30","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/s10898-013-0072-z","volume":"58","author":"YH Lee","year":"2013","unstructured":"Lee, Y.H., Cho, Y.Y., Cho, G.M.: Interior-point algorithms for $$P_{*}(\\kappa )$$-LCP based on a new class of kernel functions. J. Glob. Optim. 58(1), 137\u2013149 (2013)","journal-title":"J. Glob. Optim."},{"issue":"1","key":"1356_CR31","first-page":"265","volume":"26","author":"PT Harker","year":"1990","unstructured":"Harker, P.T., Pang, J.S.: A damped Newton method for linear complementarity problem. Lect. Appl. Math. 26(1), 265\u2013284 (1990)","journal-title":"Lect. Appl. Math."},{"issue":"1","key":"1356_CR32","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/j.cam.2007.05.007","volume":"216","author":"GM Cho","year":"2006","unstructured":"Cho, G.M.: A new large-update interior point algorithm for $$P_{*}(\\kappa )$$ linear complementarity problems. Appl. Math. Comput. 216(1), 265\u2013278 (2006)","journal-title":"Appl. Math. Comput."}],"updated-by":[{"DOI":"10.1007\/s12190-021-01505-0","type":"correction","label":"Correction","source":"publisher","updated":{"date-parts":[[2021,2,11]],"date-time":"2021-02-11T00:00:00Z","timestamp":1613001600000}}],"container-title":["Journal of Applied Mathematics and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12190-020-01356-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12190-020-01356-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12190-020-01356-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,11]],"date-time":"2021-05-11T10:37:21Z","timestamp":1620729441000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12190-020-01356-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,5,11]]},"references-count":32,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2020,10]]}},"alternative-id":["1356"],"URL":"https:\/\/doi.org\/10.1007\/s12190-020-01356-1","relation":{},"ISSN":["1598-5865","1865-2085"],"issn-type":[{"value":"1598-5865","type":"print"},{"value":"1865-2085","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,5,11]]},"assertion":[{"value":"23 December 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 May 2020","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 February 2021","order":3,"name":"change_date","label":"Change Date","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Correction","order":4,"name":"change_type","label":"Change Type","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"A Correction to this paper has been published:","order":5,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"https:\/\/doi.org\/10.1007\/s12190-021-01505-0","URL":"https:\/\/doi.org\/10.1007\/s12190-021-01505-0","order":6,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}}]}}