{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,20]],"date-time":"2024-06-20T22:31:49Z","timestamp":1718922709216},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1998,8,1]],"date-time":"1998-08-01T00:00:00Z","timestamp":901929600000},"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":[[1998,8]]},"DOI":"10.1007\/bf01580074","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T04:57:53Z","timestamp":1114664273000},"page":"339-355","source":"Crossref","is-referenced-by-count":11,"title":["A modified layered-step interior-point algorithm for linear programming"],"prefix":"10.1007","volume":"82","author":[{"given":"Nimrod","family":"Megiddo","sequence":"first","affiliation":[]},{"given":"Shinji","family":"Mizuno","sequence":"additional","affiliation":[]},{"given":"Takashi","family":"Tsuchiya","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/BF02579150","volume":"4","author":"N. Karmarkar","year":"1984","unstructured":"N. Karmarkar, A new polynomial-time algorithm for linear programming, Combinatorica 4 (1984) 373\u2013395.","journal-title":"Combinatorica"},{"key":"CR2","first-page":"79","volume":"74","author":"S. Vavasis","year":"1996","unstructured":"S. Vavasis, Y. Ye, A primal-dual accelerated interior point method whose running time depends only onA, Mathematical Programming 74 (1996) 79\u2013120.","journal-title":"Mathematical Programming"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1287\/opre.34.2.250","volume":"34","author":"\u00c9. Tardos","year":"1986","unstructured":"\u00c9. Tardos, A strongly polynomial algorithm to solve combinatorial linear programs, Operations Research 34 (1986) 250\u2013256.","journal-title":"Operations Research"},{"key":"CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01587074","volume":"44","author":"M. Kojima","year":"1989","unstructured":"M. Kojima, S. Mizuno, A. Yoshise, A polynomial-time algorithm for a class of linear complementary problems, Mathematical Programming 44 (1989) 1\u201326.","journal-title":"Mathematical Programming"},{"key":"CR5","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/BF01587075","volume":"44","author":"R.D.C. Monteiro","year":"1989","unstructured":"R.D.C. Monteiro, I. Adler, Interior path following primal-dual algorithms. Part I: Linear programming, Mathematical Programming 44 (1989) 27\u201341.","journal-title":"Mathematical Programming"},{"key":"CR6","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, Y. Ye, On adaptive-step primal-dual interior-point algorithms for linear programming, Mathematics of Operations Research 18 (1993) 964\u2013981.","journal-title":"Mathematics of Operations Research"},{"key":"CR7","volume-title":"Iterative Solution of Mathematical Programming Problems: Algorithms for the Method of Interior Points","author":"I.I. Dikin","year":"1980","unstructured":"I.I. Dikin, V.I. Zorkalcev, Iterative Solution of Mathematical Programming Problems: Algorithms for the Method of Interior Points (in Russian), Nauka, Novosibirsk, USSR, 1980."},{"key":"CR8","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1090\/conm\/114\/1097868","volume":"114","author":"R.J. Vanderbei","year":"1990","unstructured":"R.J. Vanderbei, J.C. Lagarias, I.I. Dikin's convergence result for the affine-scaling algorithm, Contemporary Mathematics 114 (1990) 109\u2013119.","journal-title":"Contemporary Mathematics"},{"key":"CR9","doi-asserted-by":"crossref","first-page":"1006","DOI":"10.1287\/opre.38.6.1006","volume":"38","author":"M.J. Todd","year":"1990","unstructured":"M.J. Todd, A Dantzig-Wolfe-like variant of Karmarkar's interior-point linear programming algorithm, Operations Research 38 (1990) 1006\u20131018.","journal-title":"Operations Research"},{"key":"CR10","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0024-3795(89)90594-6","volume":"112","author":"G.W. Stewart","year":"1989","unstructured":"G.W. Stewart, On scaled projections and pseudoinverses, Linear Algebra and its Applications 112 (1989) 189\u2013193.","journal-title":"Linear Algebra and its Applications"},{"key":"CR11","volume-title":"A simplification to a primal\u2014dual interior point method whose running time depends only on the constaint matrix, Technical Note","author":"S. Vavasis","year":"1997","unstructured":"S. Vavasis, Y. Ye, A simplification to a primal\u2014dual interior point method whose running time depends only on the constaint matrix, Technical Note, Department of Management Science, University of Iowa, Iowa City (1997)."},{"key":"CR12","doi-asserted-by":"crossref","first-page":"474","DOI":"10.1006\/jcom.1996.0028","volume":"12","author":"S. Mizuno","year":"1996","unstructured":"S. Mizuno, N. Megiddo, T. Tsuchiya, A linear programming instance with many crossover events, Journal of Complexity 12 (1996) 474\u2013479.","journal-title":"Journal of Complexity"},{"key":"CR13","doi-asserted-by":"crossref","first-page":"527","DOI":"10.1287\/moor.17.3.527","volume":"17","author":"T. Tsuchiya","year":"1992","unstructured":"T. Tsuchiya, Global convergence property of the affine scaling method for primal degenerate linear programming problems, Mathematics of Operations Research 17 (1992) 527\u2013557.","journal-title":"Mathematics of Operations Research"},{"key":"CR14","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1007\/BF01436076","volume":"7","author":"J.M. Bennett","year":"1965","unstructured":"J.M. Bennett, Triangular factors of modified matrices, Numerische Mathematik 7 (1965) 217\u2013221.","journal-title":"Numerische Mathematik"},{"key":"CR15","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1090\/S0025-5718-1974-0343558-6","volume":"28","author":"P.E. Gill","year":"1974","unstructured":"P.E. Gill, G.H. Golub, W. Murray, M.A. Saunders, Methods for modifying matrix factorization, Mathematics of Computation 28 (1974) 505\u2013535.","journal-title":"Mathematics of Computation"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01580074.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01580074\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01580074","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T11:09:13Z","timestamp":1556881753000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01580074"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,8]]},"references-count":15,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1998,8]]}},"alternative-id":["BF01580074"],"URL":"https:\/\/doi.org\/10.1007\/bf01580074","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1998,8]]}}}