{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,7]],"date-time":"2025-07-07T09:26:40Z","timestamp":1751880400627},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"1-3","license":[{"start":{"date-parts":[[1990,5,1]],"date-time":"1990-05-01T00:00:00Z","timestamp":641520000000},"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":[[1990,5]]},"DOI":"10.1007\/bf01580848","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T08:58:29Z","timestamp":1114678709000},"page":"1-9","source":"Crossref","is-referenced-by-count":15,"title":["Containing and shrinking ellipsoids in the path-following algorithm"],"prefix":"10.1007","volume":"47","author":[{"given":"Yinyu","family":"Ye","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael J.","family":"Todd","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","first-page":"499","volume":"314","author":"D. Bayer","year":"1989","unstructured":"D. Bayer and J.C. Lagarias, \u201cThe non-linear geometry of linear programming, I. Affine and projective scaling trajectories, II. Legendre transform coordinates and central trajectories,\u201dTransactions of the American Mathematical Society 314 (1989) 499\u2013581.","journal-title":"Transactions of the American Mathematical Society"},{"key":"CR2","doi-asserted-by":"crossref","first-page":"688","DOI":"10.1287\/moor.10.4.688","volume":"10","author":"B.P. Burrell","year":"1985","unstructured":"B.P. Burrell and M.J. Todd, \u201cThe ellipsoid method generates dual variables,\u201dMathematics of Operations Research 10 (1985) 688\u2013700.","journal-title":"Mathematics of Operations Research"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/0024-3795(68)90052-9","volume":"1","author":"R.W. Cottle","year":"1968","unstructured":"R.W. Cottle and G.B. Dantzig, \u201cComplementary pivot theory of mathematical programming\u201c,Linear Algebra and its Applications 1 (1968) 103\u2013125.","journal-title":"Linear Algebra and its Applications"},{"key":"CR4","volume-title":"Linear Programming and Extensions","author":"G.B. Dantzig","year":"1963","unstructured":"G.B. Dantzig,Linear Programming and Extensions (Princeton University Press, Princeton, NJ, 1963)."},{"key":"CR5","first-page":"1","volume-title":"Progress in Mathematical Programming","author":"C.C. Gonzaga","year":"1988","unstructured":"C.C. Gonzaga, \u201cAn algorithm for solving linear programming problems in O(n 3 L) operations,\u201d in: N. Megiddo, ed.,Progress in Mathematical Programming (Springer, New York, 1988) pp. 1\u201328."},{"key":"CR6","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/BF01582287","volume":"43","author":"C.C. Gonzaga","year":"1989","unstructured":"C.C. Gonzaga, \u201cConical projection algorithms for linear programming,\u201dMathematical Programming 43 (1989) 151\u2013173.","journal-title":"Mathematical Programming"},{"key":"CR7","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":"CR8","first-page":"1093","volume":"244","author":"L.G. Khachiyan","year":"1979","unstructured":"L.G. Khachiyan, \u201cA polynomial algorithm for linear programming,\u201dDoklady Akademii Nauk SSSR 244 (1979) 1093\u201396. [Translated in:Soviet Mathematics Doklady 20 (1979) 191\u201394.]","journal-title":"Doklady Akademii Nauk SSSR"},{"key":"CR9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01587074","volume":"44","author":"M. Kojima","year":"1989","unstructured":"M. Kojima, S. Mizuno and A. Yoshise, \u201cA polynomial-time algorithm for a class of linear complementarity problems,\u201dMathematical Programming 44 (1989) 1\u201326.","journal-title":"Mathematical Programming"},{"key":"CR10","first-page":"1051","volume":"5","author":"M.K. Kozlov","year":"1979","unstructured":"M.K. Kozlov, S.P. Tarasov and L.G. Khachiyan, \u201cPolynomial solvability of convex quadratic programming,\u201dDoklady Akademii Nauk SSSR 5 (1979) 1051\u20131053.","journal-title":"Doklady Akademii Nauk SSSR"},{"key":"CR11","doi-asserted-by":"crossref","unstructured":"N. Megiddo, \u201cPathways to the optimal set in linear programming,\u201dProceedings of the 6th Mathematical Programming Symposium of Japan (Nagoya, Japan, 1986) 1\u201335.","DOI":"10.1007\/BF01580886"},{"key":"CR12","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/BF01587076","volume":"44","author":"R.C. Monteiro","year":"1989","unstructured":"R.C. Monteiro and I. Adler, \u201cInterior path following primal-dual algorithms. Part II: Convex quadratic programming,\u201dMathematical Programming 44 (1989) 43\u201366.","journal-title":"Mathematical Programming"},{"key":"CR13","volume-title":"Combinatorial Optimization: Algorithms and Complexity","author":"C.H. Papadimitriou","year":"1982","unstructured":"C.H. Papadimitriou and K. Steiglitz,Combinatorial Optimization: Algorithms and Complexity (Prentice-Hall, Englewood Cliffs, NJ, 1982)."},{"key":"CR14","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":"CR15","unstructured":"G. Sonnevend, \u201cAn \u2018analytic center\u2019 for polyhedrons and new classes of global algorithms for linear (smooth, convex) programming,\u201dProceedings of the 12th IFIP Conference on System Modeling and Optimization (Budapest, 1985)."},{"key":"CR16","doi-asserted-by":"crossref","first-page":"650","DOI":"10.1287\/moor.13.4.650","volume":"13","author":"M.J. Todd","year":"1988","unstructured":"M.J. Todd, \u201cImproved bounds and containing ellipsoids in Karmarkar's linear programming algorithm,\u201dMathematics of Operations Research 13 (1988) 650\u2013659.","journal-title":"Mathematics of Operations Research"},{"key":"CR17","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/BF01580859","volume":"47","author":"P.M. Vaidya","year":"1990","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 to appear in:Mathematical Programming 47 (1990) 175\u2013201, next issue.","journal-title":"Mathematical Programming"},{"key":"CR18","volume-title":"Interior algorithms for linear, quadratic, and linearly constrained convex programming","author":"Y. Ye","year":"1987","unstructured":"Y. Ye, \u201cInterior algorithms for linear, quadratic, and linearly constrained convex programming,\u201d Ph.D. Thesis, Department of Engineering-Economic Systems, Stanford University (Stanford, CA, 1987)."},{"key":"CR19","doi-asserted-by":"crossref","unstructured":"Y. Ye, \u201cRecovering optimal basis in Karmarkar's polynomial algorithm for linear programming,\u201d to appear in:Mathematics of Operations Research (1990).","DOI":"10.1287\/moor.15.3.564"},{"key":"CR20","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/0167-6377(87)90016-2","volume":"4","author":"Y. Ye","year":"1987","unstructured":"Y. Ye, \u201cKarmarkar's algorithm and the ellipsoid method,\u201dOperations Research Letters 4 (1987) 177\u2013182.","journal-title":"Operations Research Letters"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01580848.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01580848\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01580848","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,3]],"date-time":"2023-05-03T02:37:10Z","timestamp":1683081430000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01580848"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,5]]},"references-count":20,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1990,5]]}},"alternative-id":["BF01580848"],"URL":"https:\/\/doi.org\/10.1007\/bf01580848","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1990,5]]}}}