{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,7]],"date-time":"2026-04-07T10:33:58Z","timestamp":1775558038829,"version":"3.50.1"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"1-3","license":[{"start":{"date-parts":[[1988,5,1]],"date-time":"1988-05-01T00:00:00Z","timestamp":578448000000},"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":[[1988,5]]},"DOI":"10.1007\/bf01580774","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T05:52:50Z","timestamp":1114667570000},"page":"367-373","source":"Crossref","is-referenced-by-count":8,"title":["Linear programming and the newton barrier flow"],"prefix":"10.1007","volume":"41","author":[{"given":"Kurt M.","family":"Anstreicher","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1007\/BF02592024","volume":"36","author":"E.R. Barnes","year":"1986","unstructured":"E.R. Barnes, \u201cA variation on Karmarkar's algorithm for solving linear programming problems,\u201dMathematical Programming 36 (1986) 174\u2013182.","journal-title":"Mathematical Programming"},{"key":"CR2","unstructured":"E.R. Barnes, S. Chopra and D. Jensen, manuscript in preparation, IBM Watson Research Center (Yorktown Heights, NY, 1987)."},{"key":"CR3","volume-title":"The nonlinear geometry of linear programming I. Affine and projective scaling trajectories","author":"D.A. Bayer","year":"1986","unstructured":"D.A. Bayer and J.C. Lagarias, \u201cThe nonlinear geometry of linear programming I. Affine and projective scaling trajectories,\u201d AT&T Bell Laboratories (Murray Hill, NJ, 1986)."},{"key":"CR4","volume-title":"The nonlinear geometry of linear programming II. Legendre transform coordinates","author":"D.A. Bayer","year":"1986","unstructured":"D.A. Bayer and J.C. Lagarias, \u201cThe nonlinear geometry of linear programming II. Legendre transform coordinates,\u201d AT&T Bell Laboratories (Murray Hill, NJ, 1986)."},{"key":"CR5","volume-title":"The nonlinear geometry of linear programming III. Central trajectories","author":"D.A. Bayer","year":"1986","unstructured":"D.A. Bayer and J.C. Lagarias, \u201cThe nonlinear geometry of linear programming III. Central trajectories,\u201d AT&T Bell Laboratories (Murray Hill, NJ, 1986)."},{"key":"CR6","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/BF02592025","volume":"36","author":"P.E. Gill","year":"1986","unstructured":"P.E. Gill, W. Murray, M.A. Saunders, J.A. Tomlin and M.H. Wright, \u201cOn projected Newton barrier methods for linear programming and an equivalence to Karmarkar's projective method,\u201dMathematical Programming 36 (1986) 183\u2013209.","journal-title":"Mathematical Programming"},{"key":"CR7","volume-title":"\u201cAn algorithm for solving linear programming problems in O(n 3 L) operations,\u201d Memorandum UCB\/ERL M87\/10","author":"C.C. Gonzaga","year":"1987","unstructured":"C.C. Gonzaga, \u201cAn algorithm for solving linear programming problems in O(n 3 L) operations,\u201d Memorandum UCB\/ERL M87\/10, University of California (Berkeley, CA, 1987)."},{"key":"CR8","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":"CR9","unstructured":"J.C. Lagarias, private communication (1986)."},{"key":"CR10","volume-title":"\u201cPathways to the optimal set in linear programming,\u201d Research Report RJ 5295","author":"N. Megiddo","year":"1986","unstructured":"N. Megiddo, \u201cPathways to the optimal set in linear programming,\u201d Research Report RJ 5295, IBM Almaden Research Center (San Jose, CA, 1986)."},{"key":"CR11","volume-title":"\u201cBoundary behavior of interior point algorithms in linear programming,\u201d Research report RJ 5319","author":"N. Megiddo","year":"1986","unstructured":"N. Megiddo and M. Shub, \u201cBoundary behavior of interior point algorithms in linear programming,\u201d Research report RJ 5319, IBM Watson Research Center (Yorktown Heights, NY, 1986)."},{"key":"CR12","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\u201393.","journal-title":"Mathematical Programming"},{"key":"CR13","unstructured":"G. Sonnevend, \u201cAn analytical centre for a polyhedron and new classes of global algorithms for linear (smooth, convex) programming,\u201d in:Proceedings of the 12th IFIP Conference on System Modeling (Budapest, 1985)."},{"key":"CR14","volume-title":"An algorithm for linear programming which requires O(((m+n)n 2+(m+n)1.5 n)L) arithmetic operations","author":"P.M. Vaidya","year":"1987","unstructured":"P.M. Vaidya, \u201cAn algorithm for linear programming which requires O(((m+n)n 2+(m+n)1.5 n)L) arithmetic operations,\u201d AT&T Bell Laboratories (Murray Hill, NJ, 1987)."},{"key":"CR15","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1007\/BF01840454","volume":"1","author":"R.J. Vanderbei","year":"1986","unstructured":"R.J. Vanderbei, M.J. Meketon and B.A. Freedman, \u201cA modification of Karmarkar's linear programming algorithm,\u201dAlgorithmica 1 (1986) 395\u2013407.","journal-title":"Algorithmica"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01580774.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01580774\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01580774","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T11:12:11Z","timestamp":1556881931000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01580774"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,5]]},"references-count":15,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1988,5]]}},"alternative-id":["BF01580774"],"URL":"https:\/\/doi.org\/10.1007\/bf01580774","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1988,5]]}}}