{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,8,19]],"date-time":"2023-08-19T07:17:18Z","timestamp":1692429438911},"reference-count":15,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1988,6,1]],"date-time":"1988-06-01T00:00:00Z","timestamp":581126400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":9177,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Complexity"],"published-print":{"date-parts":[[1988,6]]},"DOI":"10.1016\/0885-064x(88)90025-8","type":"journal-article","created":{"date-parts":[[2004,9,8]],"date-time":"2004-09-08T14:41:18Z","timestamp":1094654478000},"page":"124-136","source":"Crossref","is-referenced-by-count":2,"title":["A new simple homotopy algorithm for linear programming I"],"prefix":"10.1016","volume":"4","author":[{"given":"Lenore","family":"Blum","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0885-064X(88)90025-8_BIB1","series-title":"invited talk at Workshop of Problems Relating Computer Science to Numerical Analysis","article-title":"Computational Complexity and the Condition of a Problem, with Examples from Linear Programming","author":"Blum","year":"1986"},{"issue":"No. 4","key":"10.1016\/0885-064X(88)90025-8_BIB2","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0020-0190(86)90134-1","article-title":"Towards an asymptotic analysis of Karmarkar's algorithm","volume":"23","author":"Blum","year":"1986","journal-title":"Inform. Process. Lett."},{"issue":"No. 2","key":"10.1016\/0885-064X(88)90025-8_BIB3","doi-asserted-by":"crossref","first-page":"384","DOI":"10.1137\/0215026","article-title":"Evaluating rational functions: Infinite precision is finite cost and tractable on average","volume":"15","author":"Blum","year":"1986","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0885-064X(88)90025-8_BIB4","series-title":"Programming in Math. of the Decision Sciences","first-page":"115","article-title":"Complementary pivot theory of Math","author":"Cottle","year":"1968"},{"key":"10.1016\/0885-064X(88)90025-8_BIB5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/moor.1.1.1","article-title":"The solution of systems of piecewise linear equations","volume":"1","author":"Eaves","year":"1976","journal-title":"Math. Oper. Res."},{"key":"10.1016\/0885-064X(88)90025-8_BIB6","series-title":"Foundations of Algebraic Topology","author":"Eilenberg","year":"1952"},{"key":"10.1016\/0885-064X(88)90025-8_BIB7","series-title":"Pathways to Solutions, Fixed Points and Equilibria","author":"Garcia","year":"1981"},{"key":"10.1016\/0885-064X(88)90025-8_BIB8","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1137\/0131009","article-title":"Equivalence of the complementarity problem to a system of nonlinear equations","volume":"31","author":"Mangasarian","year":"1976","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/0885-064X(88)90025-8_BIB9","series-title":"Methods of Operations Research 43, Proceedings of 6th Symposium uber Operations Research, Universitat Ausburg","first-page":"3","article-title":"A condition number for linear inequalities and linear programs","author":"Mangasarian","year":"1981"},{"key":"10.1016\/0885-064X(88)90025-8_BIB10","series-title":"Technical Report 599","article-title":"Lipschitz Continuity of Solutions of Linear Inequalities, Programs and Complementarity Problems","author":"Mangasarian","year":"1985"},{"key":"10.1016\/0885-064X(88)90025-8_BIB11","series-title":"Pathways to the optimal set in linear programming","author":"Megiddo","year":"1986"},{"key":"10.1016\/0885-064X(88)90025-8_BIB12","series-title":"Linear Complementarity, Linear and Nonlinear Programming","author":"Murty","year":"1985"},{"key":"10.1016\/0885-064X(88)90025-8_BIB13","series-title":"Homotopy techniques in linear programming","author":"Nazareth","year":"1986"},{"key":"10.1016\/0885-064X(88)90025-8_BIB14","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1007\/BF02591902","article-title":"On the average number of steps in the Simplex method of linear programming","volume":"27","author":"Smale","year":"1983","journal-title":"Math. Programming"},{"key":"10.1016\/0885-064X(88)90025-8_BIB15","series-title":"Algorithms for solving equations","author":"Smale","year":"1986"}],"container-title":["Journal of Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0885064X88900258?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0885064X88900258?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,3]],"date-time":"2019-02-03T20:58:32Z","timestamp":1549227512000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0885064X88900258"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,6]]},"references-count":15,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1988,6]]}},"alternative-id":["0885064X88900258"],"URL":"https:\/\/doi.org\/10.1016\/0885-064x(88)90025-8","relation":{},"ISSN":["0885-064X"],"issn-type":[{"value":"0885-064X","type":"print"}],"subject":[],"published":{"date-parts":[[1988,6]]}}}