{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,4,2]],"date-time":"2023-04-02T11:33:13Z","timestamp":1680435193207},"reference-count":23,"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\/bf01585562","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T04:42:17Z","timestamp":1114663337000},"page":"311-333","source":"Crossref","is-referenced-by-count":2,"title":["Superlinear primal-dual affine scaling algorithms for LCP"],"prefix":"10.1007","volume":"69","author":[{"given":"R. D. C.","family":"Monteiro","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S. J.","family":"Wright","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","volume-title":"\u201cA predictor-corrector method for linear complementarity problems with polynomial complexity and superlinear convergence,\u201d Technical Report","author":"J. Ji","year":"1991","unstructured":"J. Ji, F. Potra and S. Huang, \u201cA predictor-corrector method for linear complementarity problems with polynomial complexity and superlinear convergence,\u201d Technical Report, Department of Mathematics, The University of Iowa, Iowa City, IA 52240, USA, August 1991."},{"key":"CR2","doi-asserted-by":"crossref","DOI":"10.21236\/ADA452257","volume-title":"\u201cAn interior-point method with polynomial complexity and superlinear convergence for linear complementarity problems,\u201d Technical Report TR-91-23","author":"J. Ji","year":"1991","unstructured":"J. Ji, F. Potra, R.A. Tapia and Y. Zhang, \u201cAn interior-point method with polynomial complexity and superlinear convergence for linear complementarity problems,\u201d Technical Report TR-91-23, Department of Mathematical Sciences, Rice University, Houston, TX 77251, USA, 1991."},{"key":"CR3","doi-asserted-by":"crossref","first-page":"398","DOI":"10.1137\/0803018","volume":"3","author":"M. Kojima","year":"1993","unstructured":"M. Kojima, Y. Kurita and S. Mizuno, \u201cLarge-step interior point algorithms for linear complementarity problems,\u201dSIAM Journal on Optimization 3 (1993) 398\u2013412.","journal-title":"SIAM Journal on Optimization"},{"key":"CR4","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. Meggido, T. Noma and A. Yoshise, \u201cA unified approach to interior-point algorithms for linear complementarity problems,\u201d Lecture Notes in Computer Science 538 (Springer, Berlin, 1991)."},{"key":"CR5","doi-asserted-by":"crossref","first-page":"754","DOI":"10.1287\/moor.16.4.754","volume":"16","author":"M. Kojima","year":"1991","unstructured":"M. Kojima, N. Megiddo and T. Noma, \u201cHomotopy continuation methods for nonlinear complementarity problems,\u201dMathematics of Operations Research 16 (1991) 754\u2013774.","journal-title":"Mathematics of Operations Research"},{"key":"CR6","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 polynomial-time algorithm for a class of linear complementarity problems,\u201dMathematical Programming 44 (1989) 1\u201326.","journal-title":"Mathematical Programming"},{"key":"CR7","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1137\/0804014","volume":"4","author":"K.A. McShane","year":"1994","unstructured":"K.A. McShane, \u201cA superlinearly convergent $$O(\\sqrt n L)$$ iteration primal-dual linear programming algorithm,\u201dSIAM Journal on Optimization 4 (1994) 247\u2013261.","journal-title":"SIAM Journal on Optimization"},{"key":"CR8","doi-asserted-by":"crossref","first-page":"741","DOI":"10.1287\/moor.18.3.741","volume":"18","author":"S. Mehrotra","year":"1993","unstructured":"S. Mehrotra, \u201cQuadratic convergence in a primal-dual method,\u201dMathematics of Operations Research 18 (1993) 741\u2013751.","journal-title":"Mathematics of Operations Research"},{"key":"CR9","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1007\/BF01585163","volume":"62","author":"S. Mizuno","year":"1993","unstructured":"S. Mizuno and A. Nagasawa, \u201cA primal-dual affine scaling potential reduction algorithm for linear programming,\u201dMathematical Programming 62 (1993) 119\u2013131.","journal-title":"Mathematical Programming"},{"key":"CR10","doi-asserted-by":"crossref","first-page":"945","DOI":"10.1287\/moor.18.4.964","volume":"18","author":"S. Mizuno","year":"1993","unstructured":"S. Mizuno, M.J. Todd and Y. Ye, \u201cOn adaptive step primal-dual interior-point algorithms for linear programming,\u201dMathematics of Operations Research 18 (1993) 945\u2013981.","journal-title":"Mathematics of Operations Research"},{"key":"CR11","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/BF01582568","volume":"64","author":"R.D.C. Monteiro","year":"1994","unstructured":"R.D.C. Monteiro, \u201cA globally convergent primal-dual interior point algorithm for convex programming,\u201dMathematical Programming 64 (1994) 123\u2013147.","journal-title":"Mathematical Programming"},{"key":"CR12","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/BF01587075","volume":"44","author":"R.D.C. Monteiro","year":"1989","unstructured":"R.D.C. Monteiro and I. Adler, \u201cInterior path-following primal-dual algorithms, Part I: Linear programming,\u201dMathematical Programming 44 (1989) 27\u201341.","journal-title":"Mathematical Programming"},{"key":"CR13","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1007\/BF02023109","volume":"47","author":"R.D.C. Monteiro","year":"1993","unstructured":"R.D.C. Monteiro, T. Tsuchiya and Y. Wang, \u201cA simplified global convergence proof of the affine scaling algorithm,\u201dAnnals of Operations Research 47 (1993) 443\u2013482.","journal-title":"Annals of Operations Research"},{"key":"CR14","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1007\/BF01580904","volume":"56","author":"P. Tseng","year":"1992","unstructured":"P. Tseng and Z.Q. Luo, \u201cOn the convergence of the affine-scaling algorithm,\u201dMathematical Programming 56 (1992) 301\u2013319.","journal-title":"Mathematical Programming"},{"key":"CR15","series-title":"Research Memorandum","volume-title":"Quadratic convergence of Iri and Imai's method for degenerate linear programming problems","author":"T. Tsuchiya","year":"1991","unstructured":"T. Tsuchiya, \u201cQuadratic convergence of Iri and Imai's method for degenerate linear programming problems,\u201d Research Memorandum 412, The Institute of Statistical Mathematics, 4-6-7 Minami-Azabu, Minato-ku, Tokyo 106, Japan, 1991."},{"key":"CR16","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/BF01581142","volume":"66","author":"L. Tun\u00e7el","year":"1994","unstructured":"L. Tun\u00e7el, \u201cConstant potential primal-dual algorithms: A framework,\u201dMathematical Programming 66 (1994) 145\u2013159.","journal-title":"Mathematical Programming"},{"key":"CR17","unstructured":"Y. Ye, \u201cOn the Q-order of convergence of interior-point algorithms for linear programming,\u201d in: W. Fang, ed.,Proceedings of the 1992 Symposium on Applied Mathematics, Institute of Applied Mathematics, Chinese Academy of Sciences, 1992, pp. 534\u2013543."},{"key":"CR18","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-corrector algorithm for LCP,\u201dMathematical Programming 62 (1993) 537\u2013551.","journal-title":"Mathematical Programming"},{"key":"CR19","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":"CR20","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1007\/BF00940179","volume":"73","author":"Y. Zhang","year":"1992","unstructured":"Y. Zhang and R.A. Tapia, \u201cSuperlinear and quadratic convergence of primal-dual interior-point methods for linear programming revisited,\u201dJournal of Optimization Theory and Applications 73 (1992) 229\u2013242.","journal-title":"Journal of Optimization Theory and Applications"},{"key":"CR21","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1137\/0803006","volume":"3","author":"Y. Zhang","year":"1993","unstructured":"Y. Zhang and R.A. Tapia, \u201cA superlinearly convergent polynomial primal-dual interior-point algorithm for linear programming,\u201dSIAM Journal on Optimization 3 (1993) 118\u2013133.","journal-title":"SIAM Journal on Optimization"},{"key":"CR22","doi-asserted-by":"crossref","first-page":"304","DOI":"10.1137\/0802015","volume":"2","author":"Y. Zhang","year":"1992","unstructured":"Y. Zhang, R.A. Tapia and J.E. Dennis, \u201cOn the superlinear and quadratic convergence of primal-dual interior point linear programming algorithms,\u201dSIAM Journal on Optimization 2 (1992) 304\u2013324.","journal-title":"SIAM Journal on Optimization"},{"key":"CR23","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1137\/0803019","volume":"3","author":"Y. Zhang","year":"1993","unstructured":"Y. Zhang, R.A. Tapia and F. Potra, \u201cOn the superlinear convergence of interior point algorithms for a general class of problems,\u201dSIAM Journal on Optimization 3 (1993) 413\u2013422.","journal-title":"SIAM Journal on Optimization"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01585562.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01585562\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01585562","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T11:32:28Z","timestamp":1556883148000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01585562"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,7]]},"references-count":23,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1995,7]]}},"alternative-id":["BF01585562"],"URL":"https:\/\/doi.org\/10.1007\/bf01585562","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995,7]]}}}