{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,8,19]],"date-time":"2023-08-19T07:17:17Z","timestamp":1692429437696},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1996,2,1]],"date-time":"1996-02-01T00:00:00Z","timestamp":823132800000},"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":[[1996,2]]},"DOI":"10.1007\/bf02592088","type":"journal-article","created":{"date-parts":[[2007,3,29]],"date-time":"2007-03-29T11:32:15Z","timestamp":1175167935000},"page":"177-194","source":"Crossref","is-referenced-by-count":4,"title":["An $$O(\\sqrt n L)$$ iteration bound primal-dual cone affine scaling algorithm for linear programmingiteration bound primal-dual cone affine scaling algorithm for linear programming"],"prefix":"10.1007","volume":"72","author":[{"given":"Jos F.","family":"Sturm","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shuzhong","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02592088_CR1","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1007\/BF01587095","volume":"44","author":"I. Adler","year":"1989","unstructured":"I. Adler, M.G.C. Resende, G. Veiga and N.K. Karmarkar, \u201cAn implementation of Karmarkar's algorithm for linear programming,\u201dMathematical Programming 44 (1989) 297\u2013335.","journal-title":"Mathematical Programming"},{"key":"BF02592088_CR2","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1007\/BF01582902","volume":"52","author":"D. Hertog Den","year":"1991","unstructured":"D. Den Hertog and C. Roos, \u201cA survey of search directions in interior point methods for linear programming,\u201dMathematical Programming 52 (1991) 481\u2013509.","journal-title":"Mathematical Programming"},{"key":"BF02592088_CR3","first-page":"674","volume":"8","author":"I.I. Dikin","year":"1967","unstructured":"I.I. Dikin, \u201cIterative solution of problems of linear and quadratic programming,\u201dSoviet Mathematics Doklady 8 (1967) 674\u2013675.","journal-title":"Soviet Mathematics Doklady"},{"key":"BF02592088_CR4","volume-title":"Nonlinear Programming: Sequential Unconstrained Minimization Techniques","author":"A.V. Fiacco","year":"1968","unstructured":"A.V. Fiacco and G.P. McCormick,Nonlinear Programming: Sequential Unconstrained Minimization Techniques (Wiley, New York, 1968)."},{"key":"BF02592088_CR5","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/BF01586924","volume":"51","author":"D. Goldfarb","year":"1991","unstructured":"D. Goldfarb and D. Xiao, \u201cA primal projective interior point method for linear programming,\u201dMathematical Programming 51 (1991) 17\u201343.","journal-title":"Mathematical Programming"},{"key":"BF02592088_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":"BF02592088_CR7","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/BF01759039","volume":"6","author":"C.C. Gonzaga","year":"1991","unstructured":"C.C. Gonzaga, \u201cSearch directions for interior linear programming methods,\u201dAlgorithmica 6 (1991) 153\u2013181.","journal-title":"Algorithmica"},{"key":"BF02592088_CR8","unstructured":"C.C. Gonzaga, \u201cThe largest step path following algorithm for monotone linear complementarity problems,\u201d Report 94-07, Delft University of Technology, (1994)."},{"key":"BF02592088_CR9","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1287\/inte.16.4.75","volume":"16","author":"J.N. Hooker","year":"1986","unstructured":"J.N. Hooker, \u201cKarmarkar's linear programming algorithm,\u201dInterfaces 16 (1986) 75\u201390.","journal-title":"Interfaces"},{"key":"BF02592088_CR10","first-page":"207","volume-title":"Nonlinear Programming","author":"P. Huard","year":"1967","unstructured":"P. Huard, \u201cResolution of mathematical programming with nonlinear constraints by the method of centres,\u201d in: J. Abadie, ed.Nonlinear Programming (North Holland, Amsterdam, 1967) pp. 207\u2013219."},{"key":"BF02592088_CR11","doi-asserted-by":"crossref","first-page":"681","DOI":"10.1080\/02331939108843712","volume":"22","author":"G-M. Jan","year":"1991","unstructured":"G-M. Jan and S-C Fang, \u201cA new variant of the primal affine scaling algorithm for linear programs\u201d,Optimization 22 (1991) 681\u2013715.","journal-title":"Optimization"},{"key":"BF02592088_CR12","unstructured":"B. Jansen, C. Roos and T. Terlaky, \u201cA polynomial primal-dual Dikin-type algorithm for linear programming,\u201d Report 93-36, Delft University of Technology, (1993)."},{"key":"BF02592088_CR13","unstructured":"B. Jansen, C. Roos, T. Terlaky and J.-Ph. Vial, \u201cInterior-point methodology for linear programming: Duality, sensitivity analysis and computational aspects,\u201d Report 93-28, Delft University of Technology, (1993)."},{"key":"BF02592088_CR14","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/BF02579150","volume":"4","author":"N.K. Karmarkar","year":"1984","unstructured":"N.K. Karmarkar, \u201cA new polynomial-time algorithm for linear programming,\u201dCombinatorica 4 (1984) 373\u2013395.","journal-title":"Combinatorica"},{"key":"BF02592088_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-54509-3","volume-title":"A unified approach to interior point algorithms for linear complementarity problems","author":"M. Kojima","year":"1991","unstructured":"M. Kojima, N. Megiddo, T. Noma and A. Yoshise,A unified approach to interior point algorithms for linear complementarity problems, Lecture Notes in Computer Science, Vol. 538 (Springer, Berlin, 1991)."},{"key":"BF02592088_CR16","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/978-1-4613-9617-8_2","volume-title":"Progress in Mathematical Programming: Interior Point and Related Methods","author":"M. Kojima","year":"1989","unstructured":"M. Kojima, S. Mizuno and A. Yoshise, \u201cA primal-dual interior point algorithm for linear programming,\u201d in: N. Megiddo, ed.,Progress in Mathematical Programming: Interior Point and Related Methods (Springer, New York, 1989) pp. 29\u201348."},{"key":"BF02592088_CR17","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1017\/CCOL0521340446.006","volume-title":"Advances in Economic Theory","author":"N. Megiddo","year":"1987","unstructured":"N. Megiddo, \u201cOn the complexity of linear programming,\u201d in: T. Bewley, ed.,Advances in Economic Theory (Cambridge University Press, Cambridge, 1987) pp. 225\u2013268."},{"key":"BF02592088_CR18","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1007\/BF01585163","volume":"62","author":"S. Mizuno","year":"1993","unstructured":"S. Mizuno and A. Nagasawa, \u201cA primal-dual affine scaling potential reduction algorithm for linear programming,\u201dMathematical Programming 62 (1993) 119\u2013131.","journal-title":"Mathematical Programming"},{"key":"BF02592088_CR19","doi-asserted-by":"crossref","unstructured":"S. Mizuno, M.J. Todd and Y. Ye, \u201cOn adaptive-step primal-dual interior-point algorithms for linear programming,\u201dMathematics of Operations Research (1993) 964\u2013981.","DOI":"10.1287\/moor.18.4.964"},{"key":"BF02592088_CR20","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 and I. Adler, \u201cInterior path following primal-dual algorithm,\u201dMathematical Programming 44 (1989) 27\u201342.","journal-title":"Mathematical Programming"},{"key":"BF02592088_CR21","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1287\/moor.15.2.191","volume":"15","author":"R.D.C. Monteiro","year":"1990","unstructured":"R.D.C. Monteiro, I. Adler and M.G.C. Resende, \u201cA polynomial-time primal-dual affine scaling algorithm for linear and convex quadratic programming and its power series extension,\u201dMathematics of Operations Research 15 (1990) 191\u2013214.","journal-title":"Mathematics of Operations Research"},{"key":"BF02592088_CR22","volume-title":"Solution of a nonlinear programming problem arising in the projective method for linear programming","author":"M.W. Padberg","year":"1985","unstructured":"M.W. Padberg, \u201cSolution of a nonlinear programming problem arising in the projective method for linear programming,\u201d Manuscript, School of Business and Administration, New York University (New York, 1985)."},{"key":"BF02592088_CR23","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":"BF02592088_CR24","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":"BF02592088_CR25","series-title":"Research Memorandum","volume-title":"New complexity results for the Iri-Imai method","author":"J.F. Sturm","year":"1993","unstructured":"J.F. Sturm and S. Zhang, \u201cNew complexity results for the Iri-Imai method,\u201d Research Memorandum 530, University of Groningen (Groningen, 1993). To appear inAnnals of Operations Research."},{"key":"BF02592088_CR26","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1007\/BF01582896","volume":"52","author":"T. Tsuchiya","year":"1991","unstructured":"T. Tsuchiya, \u201cGlobal convergence of the affine scaling methods for degenerate linear programming problems,\u201dMathematical Programming 52 (1991) 377\u2013404.","journal-title":"Mathematical Programming"},{"key":"BF02592088_CR27","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1137\/0805027","volume":"5","author":"T. Tsuchiya","year":"1995","unstructured":"T. Tsuchiya and M. Muramutsu, \u201cGlobal convergence of the long-step affine scaling algorithm for degenerate linear programming problems,\u201dSIAM Journal on Optimization 5 (1995) 525\u2013551.","journal-title":"SIAM Journal on Optimization"},{"key":"BF02592088_CR28","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/BF01581142","volume":"66","author":"L. Tun\u00e7el","year":"1994","unstructured":"L. Tun\u00e7el \u201cConstant potential primal-dual algorithm: A framework,\u201dMathematical Programming 66 (1994) 145\u2013159.","journal-title":"Mathematical Programming"},{"key":"BF02592088_CR29","volume-title":"A Polynomially and Quadratically Convergent Method for Linear Programming","author":"H. Yamashita","year":"1986","unstructured":"H. Yamashita,A Polynomially and Quadratically Convergent Method for Linear Programming (Mathematical Systems Inc., Tokyo, 1986)."},{"key":"BF02592088_CR30","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/BF01594937","volume":"50","author":"Y. Ye","year":"1991","unstructured":"Y. Ye, \u201cAn O(n 3 L) potential reduction algorithm for linear programming,\u201dMathematical Programming 50 (1991) 239\u2013258.","journal-title":"Mathematical Programming"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02592088.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02592088\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02592088","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T19:37:52Z","timestamp":1558381072000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02592088"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,2]]},"references-count":30,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1996,2]]}},"alternative-id":["BF02592088"],"URL":"https:\/\/doi.org\/10.1007\/bf02592088","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996,2]]}}}