{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T23:27:06Z","timestamp":1648596426530},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1996,12,1]],"date-time":"1996-12-01T00:00:00Z","timestamp":849398400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[1996,12]]},"DOI":"10.1007\/bf02206830","type":"journal-article","created":{"date-parts":[[2005,10,6]],"date-time":"2005-10-06T04:32:15Z","timestamp":1128573135000},"page":"565-572","source":"Crossref","is-referenced-by-count":4,"title":["Identifying an optimal basis in linear programming"],"prefix":"10.1007","volume":"62","author":[{"given":"Stephen A.","family":"Vavasis","sequence":"first","affiliation":[]},{"given":"Yinyu","family":"Ye","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF02206830_CR1","first-page":"499","volume":"314","author":"D.A. Bayer","year":"1989","unstructured":"D.A. Bayer and J.C. Lagarias, The nonlinear geometry of linear programming, I. Affine and projective scaling trajectories, Transactions of the AMS 314(1989)499\u2013526.","journal-title":"Transactions of the AMS"},{"key":"BF02206830_CR2","first-page":"527","volume":"314","author":"D.A. Bayer","year":"1989","unstructured":"D.A. Bayer and J.C. Lagarias, The nonlinear geometry of linear programming. II. Legendre transform coordinates and central trajectories, Transactions of the AMS 314(1989)527\u2013581.","journal-title":"Transactions of the AMS"},{"key":"BF02206830_CR3","first-page":"193","volume":"320","author":"D.A. Bayer","year":"1990","unstructured":"D.A. Bayer and J.C. Lagarias, The nonlinear geometry of linear programming. III. Projective Legendre transform coordinates and Hilbert geometry, Transactions of the AMS 320(1990) 193\u2013225.","journal-title":"Transactions of the AMS"},{"key":"BF02206830_CR4","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/BF01580610","volume":"60","author":"O. G\u00fcler","year":"1993","unstructured":"O. G\u00fcler and Y. Ye, Convergence behavior of interior point algorithms, Mathematical Programming 60(1993)215\u2013228.","journal-title":"Mathematical Programming"},{"key":"BF02206830_CR5","doi-asserted-by":"crossref","first-page":"757","DOI":"10.1287\/mnsc.39.6.757","volume":"39","author":"J.A. Kaliski","year":"1993","unstructured":"J.A. Kaliski and Y. Ye, A short-cut potential reduction algorithm for linear programming, Management Science 39(1993)757\u2013773.","journal-title":"Management Science"},{"key":"BF02206830_CR6","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":"BF02206830_CR7","first-page":"1093","volume":"244","author":"L.G. Khachiyan","year":"1979","unstructured":"L.G. Khachiyan, A polynomial algorithm in linear programming, Dokl. Akad. Nauk SSSR 244(1979)1093\u20131086, translated in: Soviet Math. Dokl. 20(1979)191\u2013194.","journal-title":"Dokl. Akad. Nauk SSSR"},{"key":"BF02206830_CR8","doi-asserted-by":"crossref","first-page":"101","DOI":"10.2140\/pjm.1980.88.101","volume":"88","author":"L. McLinden","year":"1980","unstructured":"L. McLinden, An analogue of Moreau's proximation theorem, with applications to the nonlinear complementarity problem, Pacific Journal of Mathematics 88(1980)101\u2013161.","journal-title":"Pacific Journal of Mathematics"},{"key":"BF02206830_CR9","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/978-1-4613-9617-8_8","volume-title":"Progress in Mathematical Programming: Interior Point and Related Method","author":"N. Megiddo","year":"1989","unstructured":"N. Megiddo, Pathways to the optimal set in linear programming, in:Progress in Mathematical Programming: Interior Point and Related Method, ed. N. Megiddo (Springer, New York, 1989) pp. 131\u2013158."},{"key":"BF02206830_CR10","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/0024-3795(90)90056-I","volume":"132","author":"D.P. O'Leary","year":"1990","unstructured":"D.P. O'Leary, On bounds for scaled projections and pseudoinverses, Linear Algebra and its Applications 132(1990)115\u2013117.","journal-title":"Linear Algebra and its Applications"},{"key":"BF02206830_CR11","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/BF01580724","volume":"40","author":"J. Renegar","year":"1988","unstructured":"J. Renegar, A polynomial-time algorithm based on Newton's method for linear programming, Mathematical Programming 40(1988)59\u201394.","journal-title":"Mathematical Programming"},{"key":"BF02206830_CR12","first-page":"866","volume-title":"Lecture Notes in Control and Information Sciences","author":"G. Sonnevend","year":"1985","unstructured":"G. Sonnevend, An analytical center for polyhedrons and new classes of global algorithms for linear (smooth, convex) programming, in:Lecture Notes in Control and Information Sciences 84 (Springer, New York, 1985) pp. 866\u2013876."},{"key":"BF02206830_CR13","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":"BF02206830_CR14","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":"BF02206830_CR15","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1007\/BF01581252","volume":"59","author":"K. Tone","year":"1993","unstructured":"K. Tone, An active-set strategy in an interior point method for linear programming, Mathematical Programming 59(1993)345\u2013360.","journal-title":"Mathematical Programming"},{"key":"BF02206830_CR16","doi-asserted-by":"crossref","unstructured":"S.A. Vavasis and Y. Ye, A primal-dual interior point method whose running time depends only on the constraint matrix, Mathematical Programming (1996), to appear.","DOI":"10.1007\/BF02592148"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02206830.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02206830\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02206830","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,14]],"date-time":"2019-05-14T18:35:27Z","timestamp":1557858927000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02206830"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,12]]},"references-count":16,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1996,12]]}},"alternative-id":["BF02206830"],"URL":"https:\/\/doi.org\/10.1007\/bf02206830","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996,12]]}}}