{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,10]],"date-time":"2026-07-10T06:48:42Z","timestamp":1783666122788,"version":"3.55.0"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"1-3","license":[{"start":{"date-parts":[[1995,7,1]],"date-time":"1995-07-01T00:00:00Z","timestamp":804556800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mathematical Programming"],"published-print":{"date-parts":[[1995,7]]},"DOI":"10.1007\/bf01585565","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T04:42:17Z","timestamp":1114663337000},"page":"355-368","source":"Crossref","is-referenced-by-count":18,"title":["A quadratically convergent $$O((\\kappa + 1)\\sqrt n L)$$ -iteration algorithm for theP *(\u03ba)-matrix linear complementarity problem"],"prefix":"10.1007","volume":"69","author":[{"given":"Jianming","family":"Miao","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"CR1","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, MA, 1992)."},{"key":"CR2","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1137\/0801007","volume":"1","author":"J. Ding","year":"1991","unstructured":"J. Ding and T.Y. Li, \u201cA polynomial-time predictor\u2014corrector algorithm for a class of linear complementarity problems,\u201dSIAM Journal on Optimization 1 (1991) 83\u201392.","journal-title":"SIAM Journal on Optimization"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"263","DOI":"10.6028\/jres.049.027","volume":"49","author":"A.J. Hoffman","year":"1952","unstructured":"A.J. Hoffman, \u201cOn approximate solutions of systems of linear inequalities,\u201dJournal of Research of the National Bureau of Standards 49 (1952) 263\u2013265.","journal-title":"Journal of Research of the National Bureau of Standards"},{"key":"CR4","volume-title":"\u201cA predictor\u2014corrector method for linear complementarity problems with polynomial complexity and superlinear convergence,\u201d Technical Report 18","author":"J. Ji","year":"1991","unstructured":"J. Ji, F. Potra and S. Huang, \u201cA predictor\u2014corrector method for linear complementarity problems with polynomial complexity and superlinear convergence,\u201d Technical Report 18, Department of Mathematics, University of Iowa, Iowa City, IA, 1991."},{"key":"CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-54509-3","volume-title":"A Unified Approach to Interior Point Algorithms for Linear Complementarity Problems","author":"M. Kojima","year":"1991","unstructured":"M. Kojima, N. Megiddo, T. Noma and A. Yoshise,A Unified Approach to Interior Point Algorithms for Linear Complementarity Problems, Lecture Notes in Computer Science, Vol. 538 (Springer, New York, 1991)."},{"key":"CR6","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1007\/BF01586054","volume":"54","author":"M. Kojima","year":"1992","unstructured":"M. Kojima, N. Megiddo and Y. Ye \u201cAn interior point potential reduction algorithm for the linear complementarity problems,\u201dMathematical Programming 54 (1992) 267\u2013279.","journal-title":"Mathematical Programming"},{"key":"CR7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01587074","volume":"44","author":"M. Kojima","year":"1989","unstructured":"M. Kojima, S. Mizuno and A. Yoshise, \u201cA primal\u2014dual algorithm for a class of linear complementarity problems,\u201dMathematical Programming 44 (1989) 1\u201326.","journal-title":"Mathematical Programming"},{"key":"CR8","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/BF01594942","volume":"50","author":"M. Kojima","year":"1991","unstructured":"M. Kojima, S. Mizuno and A. Yoshise, \u201cAn $$O(\\sqrt n L)$$ iteration potential reduction algorithm for linear complementarity problems,\u201dMathematical Programming 50 (1991) 331\u2013342.","journal-title":"Mathematical Programming"},{"key":"CR9","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/BF01580891","volume":"56","author":"S. Mizuno","year":"1992","unstructured":"S. Mizuno, \u201cA new polynomial time method for a linear complementarity problem,\u201dMathematical Programming 56 (1992) 31\u201343.","journal-title":"Mathematical Programming"},{"key":"CR10","doi-asserted-by":"crossref","first-page":"964","DOI":"10.1287\/moor.18.4.964","volume":"18","author":"S. Mizuno","year":"1992","unstructured":"S. Mizuno, M. Todd and Y. Ye, \u201cOn adaptive-step primal-dual interior-point algorithms for linear programming,\u201dMathematics of Operations Research 18 (1992) 964\u2013981.","journal-title":"Mathematics of Operations Research"},{"key":"CR11","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/BF01587076","volume":"44","author":"R.C. Monteiro","year":"1989","unstructured":"R.C. Monteiro and I. Adler, \u201cInterior path following primal-dual algorithms. Part II: Convex quadratic programming,\u201dMathematical Programming 44 (1989) 43\u201366.","journal-title":"Mathematical Programming"},{"key":"CR12","volume-title":"\u201cLocal convergence of interior-point algorithms for degenerate monotone LCP,\u201d Technical Report MCS-P357","author":"R.C. Monteiro","year":"1993","unstructured":"R.C. Monteiro and S. Wright, \u201cLocal convergence of interior-point algorithms for degenerate monotone LCP,\u201d Technical Report MCS-P357, Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, IL, 1993."},{"key":"CR13","first-page":"805","volume":"9","author":"H. Samelson","year":"1958","unstructured":"H. Samelson, R.M. Thrall and O. Wesler, \u201cA partition theorem for Euclideann-space,\u201dProceedings of the American Mathematical Society 9 (1958) 805\u2013807.","journal-title":"Proceedings of the American Mathematical Society"},{"key":"CR14","unstructured":"Y. Ye, \u201cA further result on the potential reduction algorithm for theP-matrix linear complementarity problem,\u201dAdvances in Optimization and Parallel Computing (1992) 310\u2013316."},{"key":"CR15","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(\\sqrt n L)$$ convergence of a predictor\u2014corrector algorithm for LCP,\u201dMathematical Programming 62 (1993) 537\u2013551.","journal-title":"Mathematical Programming"},{"key":"CR16","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/BF01581242","volume":"59","author":"Y. Ye","year":"1993","unstructured":"Y. Ye, O. G\u00fcler, R.A. Tapia and Y. Zhang, \u201cA quadratically convergent $$O(\\sqrt n L)$$ -iteration algorithm for linear programming,\u201dMathematical Programming 59 (1993) 151\u2013162.","journal-title":"Mathematical Programming"},{"key":"CR17","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0024-3795(91)90264-W","volume":"152","author":"Y. Ye","year":"1991","unstructured":"Y. Ye and P.M. Pardalos, \u201cA class of linear complementarity problems solvable in polynomial time,\u201dLinear Algebra and its Applications 152 (1991) 3\u201317.","journal-title":"Linear Algebra and its Applications"},{"key":"CR18","doi-asserted-by":"crossref","DOI":"10.21236\/ADA452256","volume-title":"\u201cA superlinearly convergent $$O(\\sqrt n L)$$ -iteration algorithm for linear programming","author":"Y. Ye","year":"1991","unstructured":"Y. Ye, R. Tapia and Y. Zhang, \u201cA superlinearly convergent $$O(\\sqrt n L)$$ -iteration algorithm for linear programming,\u201d Technical Report TR91-22, Department of Mathematical Sciences, Rice University, Houston, TX, 1991."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01585565.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01585565\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01585565","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T11:32:29Z","timestamp":1556883149000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01585565"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,7]]},"references-count":18,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1995,7]]}},"alternative-id":["BF01585565"],"URL":"https:\/\/doi.org\/10.1007\/bf01585565","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995,7]]}}}