{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T20:09:56Z","timestamp":1648757396361},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"1-3","license":[{"start":{"date-parts":[[1995,10,1]],"date-time":"1995-10-01T00:00:00Z","timestamp":812505600000},"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,10]]},"DOI":"10.1007\/bf01585931","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T09:15:15Z","timestamp":1114679715000},"page":"107-122","source":"Crossref","is-referenced-by-count":5,"title":["The curvature integral and the complexity of linear complementarity problems"],"prefix":"10.1007","volume":"70","author":[{"given":"Gongyun","family":"Zhao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jishan","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","volume-title":"\u201cA predictor\u2014corrector method for linear complementarity problems with polynomial complexity and superlinear convergence,\u201d Report No. 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 Report No. 18, Department of Mathematics, The University of Iowa (Iowa City, IA, 1991)."},{"key":"CR2","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1090\/conm\/114\/1097865","volume-title":"Mathematical Developments Arising from Linear Programming, Contemporary Mathematics, Vol. 114","author":"N. Karmarkar","year":"1990","unstructured":"N. Karmarkar, \u201cRiemannian geometry underlying interior point methods for linear programming\u201d, in: J.C. Lagarias and M. Todd, eds.,Mathematical Developments Arising from Linear Programming, Contemporary Mathematics, Vol. 114 (American Mathematical Society, Providence, RI, 1990) pp. 51\u201375."},{"key":"CR3","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1002\/j.1538-7305.1989.tb00316.x","volume":"68","author":"N.K. Karmarkar","year":"1989","unstructured":"N.K. Karmarkar, J.C. Lagarias, L. Slutsman and P. Wang, \u201cPower series variants of Karmarkar-type algorithms,\u201dAT & T Technical Journal 68 (1989) 20\u201336.","journal-title":"AT & T Technical Journal"},{"key":"CR4","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, Vol. 538","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, Berlin, 1991)."},{"key":"CR5","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,\u201d Mathematical Programming 44 (1989) 1\u201326.","journal-title":"Mathematical Programming"},{"key":"CR6","volume-title":"\u201cAnticipated behaviour of path-following algorithm for linear programming,\u201d Technical Report No. 878","author":"S. Mizuno","year":"1989","unstructured":"S. Mizuno, M.J. Todd and Y. Ye, \u201cAnticipated behaviour of path-following algorithm for linear programming,\u201d Technical Report No. 878, School of Operations Research and Industrial Engineering, Cornell University (Ithaca, NY, 1989)."},{"key":"CR7","doi-asserted-by":"crossref","first-page":"964","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 algorithm for linear programming,\u201dMathematics of Operations Research 18 (1993) 964\u2013981.","journal-title":"Mathematics of Operations Research"},{"key":"CR8","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/BF01586056","volume":"54","author":"C. Roos","year":"1992","unstructured":"C. Roos and J.P. Vial, \u201cA polynomial method of approximate centers for linear programming,\u201dMathematical Programming 54 (1992) 295\u2013305.","journal-title":"Mathematical Programming"},{"key":"CR9","doi-asserted-by":"crossref","first-page":"527","DOI":"10.1007\/BF01582904","volume":"52","author":"G. Sonnevend","year":"1991","unstructured":"G. Sonnevend, J. Stoer and G. Zhao, \u201cOn the complexity of following the central path of linear programs by linear extrapolation II,\u201dMathematical Programming 52 (1991) 527\u2013553.","journal-title":"Mathematical Programming"},{"key":"CR10","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":"CR11","volume-title":"Estimating the complexity of path-following methods in linear programming by curvature integrals along the central trajectory","author":"G. Zhao","year":"1991","unstructured":"G. Zhao, \u201cEstimating the complexity of path-following methods in linear programming by curvature integrals along the central trajectory,\u201d Ph.D. Thesis, University of W\u00fcrzburg, Germany, 1991."},{"key":"CR12","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/BF01182599","volume":"27","author":"G. Zhao","year":"1993","unstructured":"G. Zhao and J. Stoer, \u201cEstimating the complexity of a class of path-following methods for solving linear programs by curvature integrals,\u201dApplied Mathematics Optimization 27 (1993) 85\u2013103.","journal-title":"Applied Mathematics Optimization"},{"key":"CR13","first-page":"359","volume":"36","author":"J. Zhu","year":"1993","unstructured":"J. Zhu, \u201cA path-following algorithm for a class of convex programming problems,\u201dZeitschrift f\u00fcr Operations Research 36 (1993) 359\u2013377.","journal-title":"Zeitschrift f\u00fcr Operations Research"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01585931.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01585931\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01585931","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T15:32:34Z","timestamp":1556897554000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01585931"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,10]]},"references-count":13,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1995,10]]}},"alternative-id":["BF01585931"],"URL":"https:\/\/doi.org\/10.1007\/bf01585931","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995,10]]}}}