{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,13]],"date-time":"2025-07-13T03:40:03Z","timestamp":1752378003906,"version":"3.41.2"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1999,11,1]],"date-time":"1999-11-01T00:00:00Z","timestamp":941414400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1999,11,1]],"date-time":"1999-11-01T00:00:00Z","timestamp":941414400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computational Optimization and Applications"],"published-print":{"date-parts":[[1999,11]]},"DOI":"10.1023\/a:1026492106091","type":"journal-article","created":{"date-parts":[[2003,11,6]],"date-time":"2003-11-06T11:45:40Z","timestamp":1068119140000},"page":"293-307","source":"Crossref","is-referenced-by-count":12,"title":["On the Rate of Local Convergence of High-Order-Infeasible-Path-Following Algorithms for P*-Linear Complementarity Problems"],"prefix":"10.1007","volume":"14","author":[{"given":"Gongyun","family":"Zhao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jie","family":"Sun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"235041_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/moor.21.1.1","volume":"21","author":"J.F. Bonnans","year":"1996","unstructured":"J.F. Bonnans and C.C. Gonzaga, \u201cConvergence of interior point algorithms for the linear complementarity problem,\u201d Mathematics of Operations Research, vol. 21, pp. 1-25, 1996.","journal-title":"Mathematics of Operations Research"},{"key":"235041_CR2","volume-title":"The Linear Complementarity Problem","author":"R.W. Cottle","year":"1992","unstructured":"R.W. Cottle, J.-S. Pang, and R.E. Stone, The Linear Complementarity Problem, Academic Press: Boston, 1992."},{"key":"235041_CR3","first-page":"33","volume":"72","author":"M.S. Gowda","year":"1996","unstructured":"M.S. Gowda, \u201cOn the extended linear complementarity problem,\u201d Mathematical Programming, vol. 72, pp. 33-50, 1996.","journal-title":"Mathematical Programming"},{"key":"235041_CR4","doi-asserted-by":"crossref","first-page":"570","DOI":"10.1137\/S1052623494266869","volume":"6","author":"P. Hung","year":"1996","unstructured":"P. Hung and Y. Ye, \u201cAn asymptotical O(\n$$\\sqrt {nL} $$\n)-iteration path-following linear programming algorithm that uses long steps,\u201d SIAM Journal on Optimization, vol. 6, pp. 570-586, 1996.","journal-title":"SIAM Journal on Optimization"},{"key":"235041_CR5","volume-title":"A Unified Approach to Interior Point Algorithms for Linear Complementarity Problems","author":"M. Kojima","year":"1996","unstructured":"M. Kojima, N. Megiddo, T. Noma, and A. Yoshise, A Unified Approach to Interior Point Algorithms for Linear Complementarity Problems, Springer-Verlag: Berlin, 1996."},{"key":"235041_CR6","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1137\/0804014","volume":"4","author":"K. McShane","year":"1994","unstructured":"K. McShane, \u201cSuperlinearly convergent O(\n$$\\sqrt {nL} $$\n)-iteration interior point algorithms for LP and the monotone LCP,\u201d SIAM Journal on Optimization, vol. 4, pp. 247-261, 1994.","journal-title":"SIAM Journal on Optimization"},{"key":"235041_CR7","doi-asserted-by":"crossref","first-page":"382","DOI":"10.1287\/moor.21.2.382","volume":"2","author":"S. Mizuno","year":"1996","unstructured":"S. Mizuno, \u201cA superlinearly convergent infeasible-interior-point algorithm for geometrical LCPs without a strictly complementarity condition,\u201d Mathematics of Operations Research, vol. 2, pp. 382-400, 1996.","journal-title":"Mathematics of Operations Research"},{"key":"235041_CR8","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1007\/BF01204707","volume":"13","author":"S. Mizuno","year":"1996","unstructured":"S. Mizuno, F. Jarre, and J. Stoer, \u201cA unified approach to infeasible-interior-point algorithm via geometrical linear complementarity problems,\u201d J. Appl. Math. Opt., vol. 13, pp. 315-341, 1996.","journal-title":"J. Appl. Math. Opt."},{"key":"235041_CR9","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1287\/moor.15.2.191","volume":"15","author":"R. Monteiro","year":"1990","unstructured":"R. Monteiro, I. Adler, and M. Resende, \u201cA polynomial-time primal-dual affine scaling algorithm for linear and convex quadratic programming and its power series extension,\u201d Mathematics of Operations Research, vol. 15, pp. 191-214, 1990.","journal-title":"Mathematics of Operations Research"},{"key":"235041_CR10","doi-asserted-by":"crossref","first-page":"793","DOI":"10.1287\/moor.21.4.793","volume":"21","author":"R. Monteiro","year":"1996","unstructured":"R. Monteiro and T. Tsuchiya, \u201cLimiting behavior of the derivatives of certain trajectories associated with a monotone horizontal linear complementarity problem,\u201d Mathematics of Operations Research, vol. 21, pp. 793-814, 1996.","journal-title":"Mathematics of Operations Research"},{"key":"235041_CR11","series-title":"Technical Report","volume-title":"A superlinearly convergent infeasible-interior-point algorithm for degenerate LCP","author":"F.A. Potra","year":"1995","unstructured":"F.A. Potra and R. Sheng, \u201cA superlinearly convergent infeasible-interior-point algorithm for degenerate LCP,\u201d Technical Report, Dept. of Math., The University of Iowa, USA, 1995."},{"key":"235041_CR12","first-page":"407","volume":"83","author":"J. Stoer","year":"1998","unstructured":"J. Stoer and M. Wechs, \u201cInfeasible-interior-point paths for sufficient linear complementarity problems and their analyticity,\u201d Mathematical Programming, vol. 83, pp. 407-423, 1998.","journal-title":"Mathematical Programming"},{"key":"235041_CR13","doi-asserted-by":"crossref","first-page":"832","DOI":"10.1287\/moor.23.4.832","volume":"23","author":"J. Stoer","year":"1998","unstructured":"J. Stoer, M. Wechs, and S. Mizuno, \u201cHigh order infeasible-interior-point methods for solving sufficient linear complementarity problems,\u201d Mathematics of Operations Research, vol. 23, pp. 832-862, 1998.","journal-title":"Mathematics of Operations Research"},{"key":"235041_CR14","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1287\/moor.24.1.72","volume":"24","author":"J.F. Sturm","year":"1999","unstructured":"J.F. Sturm, \u201cSuperlinear convergence of an algorithm for monotone linear complementarity problems, when no strictly complementary solution exists,\u201d Mathematics of Operations Research, vol. 24, pp. 72-94, 1999.","journal-title":"Mathematics of Operations Research"},{"key":"235041_CR15","first-page":"103","volume":"239","author":"H. V\u00e4liaho","year":"1996","unstructured":"H. V\u00e4liaho, \u201cP*-matrices are just sufficient,\u201d Linear Algebra and Its Applications, vol. 239, pp. 103-108, 1996.","journal-title":"Linear Algebra and Its Applications"},{"key":"235041_CR16","first-page":"269","volume":"73","author":"S.J. Wright","year":"1996","unstructured":"S.J. Wright and Y. Zhang, \u201cA superquadratic infeasible-interior-point method for linear complementarity problems,\u201d Mathematical Programming, vol. 73, pp. 269-289, 1996.","journal-title":"Mathematical Programming"},{"key":"235041_CR17","doi-asserted-by":"crossref","first-page":"537","DOI":"10.1007\/BF01585182","volume":"62","author":"Y. Ye","year":"1993","unstructured":"Y. Ye and K. Anstreicher, \u201cOn quadratic and O(\n$$\\sqrt {nL} $$\n) convergence of a predictor-corrector algorithm for LCP,\u201d Mathematical Programming, vol. 62, pp. 537-551, 1993.","journal-title":"Mathematical Programming"},{"key":"235041_CR18","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1137\/S1052623494275574","volume":"8","author":"G. Zhao","year":"1998","unstructured":"G. Zhao, \u201cInterior point algorithms for linear complementarity problems based on large neighborhoods of the central path,\u201d SIAM Journal on Optimization, vol. 8, pp. 397-413, 1998.","journal-title":"SIAM Journal on Optimization"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1026492106091.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1026492106091\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1026492106091.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,13]],"date-time":"2025-07-13T03:14:45Z","timestamp":1752376485000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1026492106091"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,11]]},"references-count":18,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1999,11]]}},"alternative-id":["235041"],"URL":"https:\/\/doi.org\/10.1023\/a:1026492106091","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"type":"print","value":"0926-6003"},{"type":"electronic","value":"1573-2894"}],"subject":[],"published":{"date-parts":[[1999,11]]}}}