{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:23:48Z","timestamp":1773347028945,"version":"3.50.1"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2013,7,31]],"date-time":"2013-07-31T00:00:00Z","timestamp":1375228800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2014,5]]},"DOI":"10.1007\/s10898-013-0090-x","type":"journal-article","created":{"date-parts":[[2013,7,30]],"date-time":"2013-07-30T12:42:50Z","timestamp":1375188170000},"page":"81-99","source":"Crossref","is-referenced-by-count":24,"title":["A full-Newton step feasible interior-point algorithm for $$P_*(\\kappa )$$ P \u2217 ( \u03ba ) -linear complementarity problems"],"prefix":"10.1007","volume":"59","author":[{"given":"G. Q.","family":"Wang","sequence":"first","affiliation":[]},{"given":"C. J.","family":"Yu","sequence":"additional","affiliation":[]},{"given":"K. L.","family":"Teo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,7,31]]},"reference":[{"issue":"1","key":"90_CR1","first-page":"19","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 )$$ P \u2217 ( \u03ba ) linear complementarity problems. Pac. J. Optim. 4(1), 19\u201341 (2008)","journal-title":"Pac. J. Optim."},{"issue":"1","key":"90_CR2","doi-asserted-by":"crossref","first-page":"1169","DOI":"10.1016\/j.amc.2006.04.060","volume":"182","author":"G Cho","year":"2006","unstructured":"Cho, G., Kim, M.: A new large-update interior point algorithm for $$P_*(\\kappa )$$ P \u2217 ( \u03ba ) -LCPs based on kernel functions. Appl. Math. Comput. 182(1), 1169\u20131183 (2006)","journal-title":"Appl. Math. Comput."},{"key":"90_CR3","unstructured":"Cottle, R.W., Pang, J.-S., Stone, R.E.: The Linear Complementarity Problem. Academic Press, Boston (1992)"},{"key":"90_CR4","doi-asserted-by":"crossref","unstructured":"de Klerk, E.: Aspects of Semidefinite Programming: Interior Point Algorithms and Selected Applications. Kluwer, Dordrecht (2002)","DOI":"10.1007\/b105286"},{"issue":"1","key":"90_CR5","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1007\/BF01588254","volume":"17","author":"Y Fathi","year":"1979","unstructured":"Fathi, Y.: Computational complexity of LCPs associated with positive definite matrices. Math. Program. 17(1), 335\u2013344 (1979)","journal-title":"Math. Program."},{"issue":"3","key":"90_CR6","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1007\/s10589-009-9263-4","volume":"48","author":"F Gurtuna","year":"2011","unstructured":"Gurtuna, F., Petra, C., Potra, F.A., Olena Shevchenko, O., Vancea, A.: Corrector-predictor methods for sufficient linear complementarity problems. Comput. Optim. Appl. 48(3), 453\u2013485 (2011)","journal-title":"Comput. Optim. Appl."},{"issue":"3","key":"90_CR7","doi-asserted-by":"crossref","first-page":"1097","DOI":"10.1016\/j.ejor.2005.08.031","volume":"181","author":"T Ill\u00e9s","year":"2007","unstructured":"Ill\u00e9s, T., Nagy, M.: A Mizuno-Todd-Ye type predictor corrector algorithm for sufficient linear complementarity problems. Eur. J. Oper. Res. 181(3), 1097\u20131111 (2007)","journal-title":"Eur. J. Oper. Res."},{"key":"90_CR8","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-54509-3","volume-title":"A Unified Approach to Interior Point Algorithms for Linear Complementarity problems. Lecture Notes in Computer Science 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. Lecture Notes in Computer Science 538. Springer, New York (1991)"},{"issue":"6","key":"90_CR9","doi-asserted-by":"crossref","first-page":"3014","DOI":"10.1137\/090766735","volume":"20","author":"G Lesaja","year":"2010","unstructured":"Lesaja, G., Roos, C.: Unified analysis of kernel-based interior-point methods for $$P_*(\\kappa )$$ P \u2217 ( \u03ba ) -linear complementarity problems. SIAM J. Optim. 20(6), 3014\u20133039 (2010)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"90_CR10","doi-asserted-by":"crossref","first-page":"871","DOI":"10.1137\/050623723","volume":"17","author":"X Liu","year":"2006","unstructured":"Liu, X., Potra, F.A.: Corrector-predictor methods for sufficient linear complementarity problems in a wide neighborhood of the central path. SIAM J. Optim. 17(3), 871\u2013890 (2006)","journal-title":"SIAM J. Optim."},{"issue":"12","key":"90_CR11","doi-asserted-by":"crossref","first-page":"1685","DOI":"10.1016\/j.apnum.2012.05.009","volume":"62","author":"HW Liu","year":"2012","unstructured":"Liu, H.W., Liu, X.Z., Liu, C.H.: Mehrotra-type predictor-corrector algorithms for sufficient linear complementarity problem. Appl. Numer. Math. 62(12), 1685\u20131700 (2012)","journal-title":"Appl. Numer. Math."},{"issue":"1\u20133","key":"90_CR12","first-page":"355","volume":"69","author":"J Miao","year":"1995","unstructured":"Miao, J.: A quadratically convergent $$O((1+\\kappa )\\sqrt{n}L)$$ O ( ( 1 + \u03ba ) n L ) -iteration algorithm for the $$P_*(\\kappa )$$ P \u2217 ( \u03ba ) -matrix linear complementarity problem. Math. Program. 69(1\u20133), 355\u2013368 (1995)","journal-title":"Math. Program."},{"key":"90_CR13","unstructured":"Murty, K.G.: Linear Complementarity, Linear and Nonlinear Programming. Helderman-Verlag, Berlin (1988)"},{"key":"90_CR14","unstructured":"Peng, J., Roos, C., Terlaky, T.: Self-regular proximities and new search directions for nonlinear $$P_*$$ P \u2217 complementarity problems. Technical Report, Faculty of Technical Mathematics and Informatics, Delft University of Technology, The Netherlands (2000)"},{"issue":"1","key":"90_CR15","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1007\/BF02614385","volume":"76","author":"FA Potra","year":"1996","unstructured":"Potra, F.A., Sheng, R.Q.: Predictor-corrector algorithms for solving $$P_*(\\kappa )$$ P \u2217 ( \u03ba ) -matrix LCP from arbitrary positive starting points. Math. Program. 76(1), 223\u2013244 (1996)","journal-title":"Math. Program."},{"issue":"2","key":"90_CR16","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1137\/S1052623495279359","volume":"7","author":"FA Potra","year":"1997","unstructured":"Potra, F.A., Sheng, R.Q.: A large-step infeasible-interior-point method for the $$P_*$$ P \u2217 -matrix LCP. SIAM J. Optim. 7(2), 318\u2013335 (1997)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"90_CR17","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1080\/10556780512331318038","volume":"20","author":"FA Potra","year":"2005","unstructured":"Potra, F.A., Liu, X.: Predictor-corrector methods for sufficient linear complementarity problems in a wide neighborhood of the central path. Optim. Methods Softw. 20(1), 145\u2013168 (2005)","journal-title":"Optim. Methods Softw."},{"issue":"3","key":"90_CR18","doi-asserted-by":"crossref","first-page":"1333","DOI":"10.1137\/080716979","volume":"20","author":"FA Potra","year":"2009","unstructured":"Potra, F.A., Stoer, J.: On a class of superlinearly convergent polynomial time interior point methods for sufficient LCP. SIAM J. Optim. 20(3), 1333\u20131363 (2009)","journal-title":"SIAM J. Optim."},{"key":"90_CR19","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)"},{"issue":"4","key":"90_CR20","doi-asserted-by":"crossref","first-page":"1110","DOI":"10.1137\/050623917","volume":"16","author":"C Roos","year":"2006","unstructured":"Roos, C.: A full-Newton step $$O(n)$$ O ( n ) infeasible interior-point algorithm for linear optimization. SIAM J. Optim. 16(4), 1110\u20131136 (2006)","journal-title":"SIAM J. Optim."},{"key":"90_CR21","first-page":"103","volume":"239","author":"H Vliaho","year":"1996","unstructured":"Vliaho, H.: $$P_*$$ P \u2217 -matrices are just sufficient. Linear Algebra Appl. 239, 103\u2013108 (1996)","journal-title":"Linear Algebra Appl."},{"issue":"2","key":"90_CR22","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1016\/j.cam.2009.07.014","volume":"233","author":"GQ Wang","year":"2009","unstructured":"Wang, G.Q., Bai, Y.Q.: Polynomial interior-point algorithms for $$P_*(\\kappa )$$ P \u2217 ( \u03ba ) horizontal linear complementarity problem. J. Comput. Appl. Math. 233(2), 248\u2013263 (2009)","journal-title":"J. Comput. Appl. Math."},{"issue":"1","key":"90_CR23","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1137\/0317004","volume":"17","author":"LT Watson","year":"1979","unstructured":"Watson, L.T.: Solving the nonlinear complementarity problem by a homotopy method. SIAM J. Optim. 17(1), 36\u201346 (1979)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"90_CR24","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1007\/BF02614384","volume":"76","author":"Y Ye","year":"1997","unstructured":"Ye, Y.: On homogeneous and self-dual algorithm for LCP. Math. Program. 76(1), 211\u2013222 (1997)","journal-title":"Math. Program."},{"key":"90_CR25","doi-asserted-by":"crossref","DOI":"10.1002\/9781118032701","volume-title":"Interior Point Algorithms, Theory and Analysis","author":"Y Ye","year":"1997","unstructured":"Ye, Y.: Interior Point Algorithms, Theory and Analysis. Wiley, Chichester (1997)"},{"key":"90_CR26","unstructured":"Zhao, Y.B., Han, J.Y.: Two interior-point methods for nonlinear $$P_*(\\tau )$$ P \u2217 ( \u03c4 ) -complementarity problems. J. Optim. Theory Appl. 102(3), 659\u2013679 (1999)"},{"issue":"4","key":"90_CR27","doi-asserted-by":"crossref","first-page":"1195","DOI":"10.1137\/S1052623401384151","volume":"13","author":"YB Zhao","year":"2003","unstructured":"Zhao, Y.B., Li, D.: A globally and locally convergent non-interior-point algorithm for $$P_0$$ P 0 LCPs. SIAM J. Optim. 13(4), 1195\u20131221 (2003)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"90_CR28","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/s10589-005-3905-y","volume":"34","author":"YB Zhao","year":"2005","unstructured":"Zhao, Y.B.: A new path-following algorithm for nonlinear $$P_*$$ P \u2217 complementarity problems. Comput. Optim. Appl. 34(2), 183\u2013214 (2005)","journal-title":"Comput. Optim. Appl."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-013-0090-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-013-0090-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-013-0090-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:59:05Z","timestamp":1559278745000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-013-0090-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,7,31]]},"references-count":28,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2014,5]]}},"alternative-id":["90"],"URL":"https:\/\/doi.org\/10.1007\/s10898-013-0090-x","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,7,31]]}}}