{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,2,1]],"date-time":"2023-02-01T06:11:58Z","timestamp":1675231918626},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"1-3","license":[{"start":{"date-parts":[[1991,5,1]],"date-time":"1991-05-01T00:00:00Z","timestamp":673056000000},"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":[[1991,5]]},"DOI":"10.1007\/bf01582906","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T08:35:11Z","timestamp":1114677311000},"page":"587-595","source":"Crossref","is-referenced-by-count":9,"title":["An O(n 3 L) adaptive path following algorithm for a linear complementarity problem"],"prefix":"10.1007","volume":"52","author":[{"given":"Shinji","family":"Mizuno","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael J.","family":"Todd","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","unstructured":"K.M. Anstreicher and R.A. Bosch, \u201cLong steps in an O(n 3 L) algorithm for linear programming,\u201d to appear in:Mathematical Programming (1992).","DOI":"10.1007\/BF01586053"},{"key":"CR2","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/0024-3795(68)90052-9","volume":"1","author":"R.W. Cottle","year":"1968","unstructured":"R.W. Cottle and G.B. Dantzig, \u201cComplementary pivot theory of mathematical programming,\u201dLinear Algebra and its Applications 1 (1968) 103\u2013125.","journal-title":"Linear Algebra and its Applications"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1007\/BF01586933","volume":"51","author":"R.M. Freund","year":"1991","unstructured":"R.M. Freund, \u201cPolynomial-time algorithms for linear programming based only on primal scaling and projected gradients of a potential function,\u201dMathematical Programming 51 (1991) 203\u2013222.","journal-title":"Mathematical Programming"},{"key":"CR4","first-page":"1","volume-title":"Progress in Mathematical Programming, Interior Point and Related Methods","author":"C.C. Gonzaga","year":"1988","unstructured":"C.C. Gonzaga, \u201cAn algorithm for solving linear programming programs in O(n 3 L) operations,\u201d in: N. Megiddo, ed.,Progress in Mathematical Programming, Interior Point and Related Methods (Springer, New York, 1988) pp. 1\u201328."},{"key":"CR5","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/BF02579150","volume":"4","author":"N. Karmarkar","year":"1984","unstructured":"N. Karmarkar, \u201cA new polynomial-time algorithm for linear programming,\u201dCombinatorica 4 (1984) 373\u2013395.","journal-title":"Combinatorica"},{"key":"CR6","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":"CR7","first-page":"29","volume-title":"Progress in Mathematical Programming, Interior Point and Related Methods","author":"M. Kojima","year":"1989","unstructured":"M. Kojima, S. Mizuno and A. Yoshise, \u201cA primal\u2014dual interior point algorithm for linear programming,\u201d in: N. Megiddo, ed.,Progress in Mathematical Programming, Interior Point and Related Methods (Springer, New York, 1989) pp. 29\u201347."},{"key":"CR8","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":"CR9","doi-asserted-by":"crossref","first-page":"681","DOI":"10.1287\/mnsc.11.7.681","volume":"11","author":"C.E. Lemke","year":"1965","unstructured":"C.E. Lemke, \u201cBimatrix equilibrium points and mathematical programming,\u201dManagement Science 11 (1965) 681\u2013689.","journal-title":"Management Science"},{"key":"CR10","first-page":"131","volume-title":"Progress in Mathematical Programming, Interior Point and Related Methods","author":"N. Megiddo","year":"1988","unstructured":"N. Megiddo, \u201cPathways to the optimal set in linear programming,\u201d in: N. Megiddo, ed.,Progress in Mathematical Programming, Interior Point and Related Methods (Springer, New York, 1988) pp. 131\u2013158."},{"key":"CR11","doi-asserted-by":"crossref","first-page":"75","DOI":"10.15807\/jorsj.32.75","volume":"32","author":"S. Mizuno","year":"1989","unstructured":"S. Mizuno, A. Yoshise and T. Kikuchi, \u201cPractical polynomial time algorithms for linear complementarity problems,\u201dJournal of the Operations Research Society of Japan 32 (1989) 75\u201392.","journal-title":"Journal of the Operations Research Society of Japan"},{"key":"CR12","doi-asserted-by":"crossref","unstructured":"S. Mizuno, \u201cA new polynomial time method for a linear complementarity problem,\u201d to appear in:Mathematical Programming (1992).","DOI":"10.1007\/BF01580891"},{"key":"CR13","doi-asserted-by":"crossref","first-page":"66","DOI":"10.15807\/jorsj.33.66","volume":"33","author":"S. Mizuno","year":"1990","unstructured":"S. Mizuno, \u201cAn O(n 3 L) algorithm using a sequence for a linear complementarity problem,\u201dJournal of the Operations Research Society of Japan 33 (1990) 66\u201375.","journal-title":"Journal of the Operations Research Society of Japan"},{"key":"CR14","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/0024-3795(91)90273-Y","volume":"152","author":"S. Mizuno","year":"1991","unstructured":"S. Mizuno, \u201cO(n \u03c1 L) iteration O(n 3 L) potential reduction algorithms for linear programming,\u201dLinear Algebra and its Applications 152 (1991) 155\u2013168.","journal-title":"Linear Algebra and its Applications"},{"key":"CR15","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/BF01587075","volume":"44","author":"R.C. Monteiro","year":"1989","unstructured":"R.C. Monteiro and I. Adler, \u201cInterior path following primal\u2014dual algorithms. Part I: Linear programming,\u201dMathematical Programming 44 (1989) 27\u201342.","journal-title":"Mathematical Programming"},{"key":"CR16","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\u2014dual algorithms. Part II: Convex quadratic programming,\u201dMathematical Programming 44 (1989) 43\u201366.","journal-title":"Mathematical Programming"},{"key":"CR17","volume-title":"Linear Complementarity, Linear and Nonlinear Programming","author":"K.G. Murty","year":"1988","unstructured":"K.G. Murty,Linear Complementarity, Linear and Nonlinear Programming (Heldermann, Berlin, 1988)."},{"key":"CR18","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/BF01580724","volume":"40","author":"J. Renegar","year":"1988","unstructured":"J. Renegar, \u201cA polynomial-time algorithm based on Newton's method for linear programming,\u201dMathematical Programming 40 (1988) 59\u201394.","journal-title":"Mathematical Programming"},{"key":"CR19","first-page":"109","volume-title":"Mathematical Programming","author":"M.J. Todd","year":"1989","unstructured":"M.J. Todd, \u201cRecent developments and new directions in linear programming,\u201d in: M. Iri and K. Tanabe, eds.,Mathematical Programming (Kluwer Academic Publishers, Dordrecht, 1989) pp. 109\u2013157."},{"key":"CR20","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/BF01580859","volume":"47","author":"P.M. Vaidya","year":"1990","unstructured":"P.M. Vaidya, \u201cAn algorithm for linear programming which requires O(((m+n)n 2 +(m+n) 1.5 n)L) arithmetic operations,\u201dMathematical Programming 47 (1990) 175\u2013201.","journal-title":"Mathematical Programming"},{"key":"CR21","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/BF01594937","volume":"50","author":"Y. Ye","year":"1991","unstructured":"Y. Ye, \u201cAn O(n 3 L) potential reduction algorithm for linear programming,\u201dMathematical Programming 50 (1991) 239\u2013258.","journal-title":"Mathematical Programming"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01582906.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01582906\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01582906","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T15:15:56Z","timestamp":1556896556000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01582906"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,5]]},"references-count":21,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1991,5]]}},"alternative-id":["BF01582906"],"URL":"https:\/\/doi.org\/10.1007\/bf01582906","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1991,5]]}}}