{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,12]],"date-time":"2026-10-12T22:27:37Z","timestamp":1791844057352,"version":"4.3.4"},"reference-count":23,"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\/bf02206829","type":"journal-article","created":{"date-parts":[[2005,10,6]],"date-time":"2005-10-06T04:32:15Z","timestamp":1128573135000},"page":"539-564","source":"Crossref","is-referenced-by-count":5,"title":["New complexity results for the Iri-Imai method"],"prefix":"10.1007","volume":"62","author":[{"given":"Jos F.","family":"Sturm","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shuzhong","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"BF02206829_CR1","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1007\/BF01582899","volume":"52","author":"K.M. Anstreicher","year":"1991","unstructured":"K.M. Anstreicher, A combined phase I-phase II scaled potential algorithm for linear programming, Mathematical Programming 52(1991)429\u2013439.","journal-title":"Mathematical Programming"},{"key":"BF02206829_CR2","first-page":"674","volume":"8","author":"I.I. Dikin","year":"1967","unstructured":"I.I. Dikin, Iterative solution of problems of linear and quadratic programming, Soviet Mathematics Doklady 8(1967)674\u2013675.","journal-title":"Soviet Mathematics Doklady"},{"key":"BF02206829_CR3","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1007\/BF01586933","volume":"51","author":"R.M. Freund","year":"1991","unstructured":"R.M. Freund, Polynomial-time algorithms for linear programming based only on primal scaling and projected gradients of a potential function, Mathematical Programming 51(1991)203\u2013222.","journal-title":"Mathematical Programming"},{"key":"BF02206829_CR4","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1007\/BF01582900","volume":"52","author":"R.M. Freund","year":"1991","unstructured":"R.M. Freund, A potential-function reduction algorithm for solving a linear program directly from an infeasible \u201cwarm start\u201d, Mathematical Programming 52(1991)441\u2013466.","journal-title":"Mathematical Programming"},{"key":"BF02206829_CR5","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1007\/BF01588776","volume":"49","author":"C.C. Gonzaga","year":"1990","unstructured":"C.C. Gonzaga, Polynomial affine algorithms for linear programming, Mathematical Programming 49(1990)7\u201321.","journal-title":"Mathematical Programming"},{"key":"BF02206829_CR6","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1007\/BF01582888","volume":"52","author":"C.C. Gonzaga","year":"1991","unstructured":"C.C. Gonzaga, Interior point algorithms for linear programming problems with inequality constraints, Mathematical Programming 52(1991)209\u2013226.","journal-title":"Mathematical Programming"},{"key":"BF02206829_CR7","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1137\/1034048","volume":"34","author":"C.C. Gonzaga","year":"1992","unstructured":"C.C. Gonzaga, Path-following methods for linear programming, SIAM Review 34(1992)167\u2013224.","journal-title":"SIAM Review"},{"key":"BF02206829_CR8","first-page":"207","volume-title":"Nonlinear Programming","author":"P. Huard","year":"1967","unstructured":"P. Huard, Resolution of mathematical programming with nonlinear constraints by the method of centres, in:Nonlinear Programming, ed. J. Abadie (North-Holland, Amsterdam, 1967) pp. 207\u2013219."},{"key":"BF02206829_CR9","first-page":"669","volume":"74","author":"H. Imai","year":"1991","unstructured":"H. Imai, On the polynomiality of the multiplicative penalty function method for linear programming and related inscribed ellipsoids, IEICE Transactions E74(1991)669\u2013671.","journal-title":"IEICE Transactions E"},{"key":"BF02206829_CR10","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1007\/BF01840457","volume":"1","author":"M. Iri","year":"1986","unstructured":"M. Iri and H. Imai, A multiplicative barrier function method for linear programming, Algorithmica 1(1986)455\u2013482.","journal-title":"Algorithmica"},{"key":"BF02206829_CR11","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1006\/jcom.1993.1018","volume":"9","author":"M. Iri","year":"1993","unstructured":"M. Iri, A Proof of the polynomiality of the Iri-Imai Method, Journal of Complexity 9(1993) 269\u2013290.","journal-title":"Journal of Complexity"},{"key":"BF02206829_CR12","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":"BF02206829_CR13","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\u201393.","journal-title":"Mathematical Programming"},{"key":"BF02206829_CR14","doi-asserted-by":"crossref","unstructured":"Gy. Sonnevend, An \u201canalytical centre\u201d for polyhedrons and new classes of global algorithms for linear (smooth, convex) programming, in:Lecture Notes in Control and Information Sciences 84, eds. A. Prekopa, J. Szelezsan and B. Strazicky (Springer, 1986) pp. 866\u2013875.","DOI":"10.1007\/BFb0043914"},{"key":"BF02206829_CR15","volume-title":"The scaling potential reduction method","author":"J.F. Sturm","year":"1993","unstructured":"J.F. Sturm, The scaling potential reduction method, Master's Thesis. Department of Econometrics, University of Groningen, The Netherlands (1993)."},{"key":"BF02206829_CR16","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1007\/BF02191742","volume":"84","author":"J.F. Sturm","year":"1995","unstructured":"J.F. Sturm and S. Zhang, Potential reduction method for harmonically convex programming. Journal of Optimization Theory and Applications 84(1995)181\u2013205.","journal-title":"Journal of Optimization Theory and Applications"},{"key":"BF02206829_CR17","unstructured":"K. Tanabe, Centered Newton method for mathematical programming, in:Proceedings of the 13th IFIP Conference, eds. M. Iri and K. Yajima, Tokyo (1987) pp. 197\u2013206."},{"key":"BF02206829_CR18","doi-asserted-by":"crossref","first-page":"508","DOI":"10.1287\/moor.15.3.508","volume":"15","author":"M.J. Todd","year":"1990","unstructured":"M.J. Todd and Y. Ye, A centered projective algorithm for linear programming, Mathematics of Operations Research 15(1990)508\u2013529.","journal-title":"Mathematics of Operations Research"},{"key":"BF02206829_CR19","series-title":"Research Memorandum","volume-title":"Global convergence of the long-step affine scaling algorithm for degenerate linear programming problems","author":"T. Tsuchiya","year":"1992","unstructured":"T. Tsuchiya and M. Muramutsu, Global convergence of the long-step affine scaling algorithm for degenerate linear programming problems, Research Memorandum 423, The Institute of Statistical Mathematics, Tokyo, Japan (1992)."},{"key":"BF02206829_CR20","volume-title":"A polynomially and quadratically convergent method for linear programming, Manuscript","author":"H. Yamashita","year":"1986","unstructured":"H. Yamashita, A polynomially and quadratically convergent method for linear programming, Manuscript, Mathematical Systems Institute, Inc., Tokyo, Japan (1986)."},{"key":"BF02206829_CR21","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/BF01594937","volume":"50","author":"Y. Ye","year":"1991","unstructured":"Y. Ye, AnO(n 3 L) potential reduction algorithm for linear programming, Mathematical Programming 50(1991)239\u2013258.","journal-title":"Mathematical Programming"},{"key":"BF02206829_CR22","first-page":"121","volume":"28","author":"S. Zhang","year":"1988","unstructured":"S. Zhang and M. Shi, On the polynomiality of Iri and Imai's new algorithm for linear programming, Journal of Qinhua University 28(1988)121\u2013126.","journal-title":"Journal of Qinhua University"},{"key":"BF02206829_CR23","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/BF02191783","volume":"82","author":"S. Zhang","year":"1994","unstructured":"S. Zhang, Convergence property of the Iri-Imai algorithm for some smooth convex programming problems, Journal of Optimization Theory and Applications 82(1994)121\u2013138.","journal-title":"Journal of Optimization Theory and Applications"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02206829.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02206829\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02206829","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\/BF02206829"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,12]]},"references-count":23,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1996,12]]}},"alternative-id":["BF02206829"],"URL":"https:\/\/doi.org\/10.1007\/bf02206829","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996,12]]}}}