{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,7]],"date-time":"2026-04-07T10:33:59Z","timestamp":1775558039100,"version":"3.50.1"},"reference-count":8,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1987,9,1]],"date-time":"1987-09-01T00:00:00Z","timestamp":557452800000},"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":9451,"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":[[1987,9]]},"DOI":"10.1016\/0885-064x(87)90015-x","type":"journal-article","created":{"date-parts":[[2004,11,6]],"date-time":"2004-11-06T18:01:23Z","timestamp":1099764083000},"page":"258-269","source":"Crossref","is-referenced-by-count":4,"title":["On the asymptotic behavior of the projective rescaling algorithm for linear programming"],"prefix":"10.1016","volume":"3","author":[{"given":"Michael","family":"Shub","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0885-064X(87)90015-X_BIB1","series-title":"Linear Programming and the Newton Barrier Flow","author":"Anstreicher","year":"1987"},{"key":"10.1016\/0885-064X(87)90015-X_BIB2","article-title":"A Variation on Karmarkar's Algorithm for Solving Linear Programming Problems","author":"Barnes","year":"1985"},{"key":"10.1016\/0885-064X(87)90015-X_BIB3","doi-asserted-by":"crossref","DOI":"10.21236\/ADA158212","article-title":"On Projected Newton Barrier Methods for Linear Programming and an Equivalence to Karmarkar's Projective Method","author":"Gill","year":"1985"},{"key":"10.1016\/0885-064X(87)90015-X_BIB4","series-title":"Proceedings, 16th Annual ACM Symposium on Theory of Computing (1984)","first-page":"302","article-title":"A new polynomial-time algorithm for linear programming","author":"Karmarkar","year":"1984"},{"key":"10.1016\/0885-064X(87)90015-X_BIB8","unstructured":"revised version: Combinatorics4 373\u2013395."},{"key":"10.1016\/0885-064X(87)90015-X_BIB5","article-title":"Boundary Behavior of Interior Point Algorithms in Linear Programming","author":"Megiddo","year":"1986"},{"key":"10.1016\/0885-064X(87)90015-X_BIB6","article-title":"A Polynomial-Time Algorithm, Based on Newton's Method, for Linear Programming","author":"Renegar","year":"1986"},{"key":"10.1016\/0885-064X(87)90015-X_BIB7","series-title":"Global Stability of Dynamical Systems","author":"Shub","year":"1986"}],"container-title":["Journal of Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0885064X8790015X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0885064X8790015X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,2]],"date-time":"2019-02-02T09:23:14Z","timestamp":1549099394000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0885064X8790015X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,9]]},"references-count":8,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1987,9]]}},"alternative-id":["0885064X8790015X"],"URL":"https:\/\/doi.org\/10.1016\/0885-064x(87)90015-x","relation":{},"ISSN":["0885-064X"],"issn-type":[{"value":"0885-064X","type":"print"}],"subject":[],"published":{"date-parts":[[1987,9]]}}}