{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,16]],"date-time":"2025-05-16T09:07:20Z","timestamp":1747386440424},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2013,2,20]],"date-time":"2013-02-20T00:00:00Z","timestamp":1361318400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Optim Theory Appl"],"published-print":{"date-parts":[[2013,9]]},"DOI":"10.1007\/s10957-013-0281-0","type":"journal-article","created":{"date-parts":[[2013,2,19]],"date-time":"2013-02-19T21:39:45Z","timestamp":1361309985000},"page":"859-873","source":"Crossref","is-referenced-by-count":25,"title":["A Polynomial Arc-Search Interior-Point Algorithm for Linear Programming"],"prefix":"10.1007","volume":"158","author":[{"given":"Yaguang","family":"Yang","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,2,20]]},"reference":[{"key":"281_CR1","first-page":"159","volume-title":"Inequalities","author":"V. Klee","year":"1972","unstructured":"Klee, V., Minty, G.: How good is the simplex algorithm? In: Shisha, O. (ed.) Inequalities, vol.\u00a0III, pp.\u00a0159\u2013175. Academic Press, San Diego (1972)"},{"key":"281_CR2","first-page":"1093","volume":"224","author":"L. Hhachiyan","year":"1979","unstructured":"Hhachiyan, L.: A polynomial algorithm in linear programming. Dokl. Akad. Nauk SSSR 224, 1093\u20131096 (1979)","journal-title":"Dokl. Akad. Nauk SSSR"},{"key":"281_CR3","doi-asserted-by":"crossref","first-page":"1039","DOI":"10.1287\/opre.29.6.1039","volume":"29","author":"R. Bland","year":"1981","unstructured":"Bland, R., Goldfarb, D., Todd, M.: The ellipsoid method: a survey. Oper. Res. 29, 1039\u20131091 (1981)","journal-title":"Oper. Res."},{"key":"281_CR4","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1007\/BF02579150","volume":"4","author":"N. Karmarkar","year":"1984","unstructured":"Karmarkar, N.: A new polynomial-time algorithm for linear programming. Combinatorica 4, 375\u2013395 (1984)","journal-title":"Combinatorica"},{"key":"281_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01587074","volume":"44","author":"M. Kojima","year":"1989","unstructured":"Kojima, M., Mizuno, S., Yoshise, A.: A polynomial-time algorithm for a class of linear complementarity problem. Math. Program. 44, 1\u201326 (1989)","journal-title":"Math. Program."},{"key":"281_CR6","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":"Kojima, M., Mizuno, S., Yoshise, A.: A primal-dual interior point algorithm for linear programming. In: Megiddo, N. (ed.) Progress in Mathematical Programming: Interior-Point and Related Methods, pp. 29\u201347. Springer, New York (1989)"},{"key":"281_CR7","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/BF01587075","volume":"44","author":"R. Monteiro","year":"1989","unstructured":"Monteiro, R., Adler, I.: Interior path following primal-dual algorithm. Part I: linear programming. Math. Program. 44, 27\u201341 (1989)","journal-title":"Math. Program."},{"key":"281_CR8","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1287\/moor.15.2.191","volume":"15","author":"R. Monteiro","year":"1990","unstructured":"Monteiro, R., Adler, I., Resende, M.: A polynominal-time primal-dual affine scaling algorithm for linear and convex quadratic programming and its power series extension. Math. Oper. Res. 15, 191\u2013214 (1990)","journal-title":"Math. Oper. Res."},{"key":"281_CR9","doi-asserted-by":"crossref","first-page":"964","DOI":"10.1287\/moor.18.4.964","volume":"18","author":"S. Mizuno","year":"1993","unstructured":"Mizuno, S., Todd, M., Ye, Y.: On adaptive step primal-dual interior-point algorithms for linear programming. Math. Oper. Res. 18, 964\u2013981 (1993)","journal-title":"Math. Oper. Res."},{"key":"281_CR10","doi-asserted-by":"crossref","first-page":"575","DOI":"10.1137\/0802028","volume":"2","author":"S. Mehrotra","year":"1992","unstructured":"Mehrotra, S.: On the implementation of a primal-dual interior point method. SIAM J. Optim. 2, 575\u2013601 (1992)","journal-title":"SIAM J. Optim."},{"key":"281_CR11","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/BF00249643","volume":"6","author":"J. Gondzio","year":"1994","unstructured":"Gondzio, J.: Multiple centrality corrections in a primal-dual method for linear programming. Comput. Optim. Appl. 6, 137\u2013156 (1994)","journal-title":"Comput. Optim. Appl."},{"key":"281_CR12","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1080\/10556789908805754","volume":"11","author":"A. Altman","year":"1999","unstructured":"Altman, A., Gondzio, J.: Regularized symmetric indefinite systems in interior point methods for linear and quadratic optimization. Optim. Methods Softw. 11, 275\u2013302 (1999)","journal-title":"Optim. Methods Softw."},{"key":"281_CR13","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1007\/s101070100261","volume":"91","author":"M.J. Todd","year":"2002","unstructured":"Todd, M.J.: The many facets of linear programming. Math. Program., Ser. B 91, 417\u2013436 (2002)","journal-title":"Math. Program., Ser. B"},{"key":"281_CR14","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611971453","volume-title":"Primal-Dual Interior-Point Methods","author":"S. Wright","year":"1997","unstructured":"Wright, S.: Primal-Dual Interior-Point Methods. SIAM, Philadelphia (1997)"},{"key":"281_CR15","doi-asserted-by":"crossref","first-page":"1110","DOI":"10.1016\/j.apnum.2008.05.006","volume":"59","author":"C. Cartis","year":"2009","unstructured":"Cartis, C.: Some disadvantages of a Mehrotra-type primal-dual corrector interior point algorithm for linear programming. Appl. Numer. Math. 59, 1110\u20131119 (2009)","journal-title":"Appl. Numer. Math."},{"key":"281_CR16","doi-asserted-by":"crossref","first-page":"1377","DOI":"10.1137\/050628787","volume":"18","author":"M. Salahi","year":"2007","unstructured":"Salahi, M., Peng, J., Terlaky, T.: On Mehrotra-Type Predictor\u2013Corrector Algorithms. SIAM J. Optim. 18, 1377\u20131397 (2007)","journal-title":"SIAM J. Optim."},{"key":"281_CR17","unstructured":"Yang, Y.: Arc-search path-following interior-point algorithm for linear programming. Optimization Online, August (2009)"},{"key":"281_CR18","first-page":"47","volume":"76","author":"Y. Nesterov","year":"1996","unstructured":"Nesterov, Y.: Long-step strategies in interior-point primal-dual methods. Math. Program. 76, 47\u201394 (1996)","journal-title":"Math. Program."},{"key":"281_CR19","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/j.ejor.2011.06.020","volume":"215","author":"Y. Yang","year":"2011","unstructured":"Yang, Y.: A polynomial arc-search interior-point algorithm for convex quadratic programming. Eur. J. Oper. Res. 215, 25\u201338 (2011)","journal-title":"Eur. J. Oper. Res."},{"key":"281_CR20","volume-title":"Differential Geometry of Curves and Surfaces","author":"M.P. Do Carmo","year":"1976","unstructured":"Do Carmo, M.P.: Differential Geometry of Curves and Surfaces. Prentice-Hall, New Jersey (1976)"},{"key":"281_CR21","unstructured":"Cartis, C., Could, N.I.M.: Finding a point in the relative interior of a polyhedron. Technical Report NA-07\/01, Computing Laboratory, Oxford University (2007)"},{"key":"281_CR22","volume-title":"Handbook of Mathematics For Engineers and Scientists","author":"A.D. Polyanin","year":"2007","unstructured":"Polyanin, A.D., Manzhirov, A.V.: Handbook of Mathematics For Engineers and Scientists. Chapman & Hall\/CRC Press, London\/Boca Raton (2007)"}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-013-0281-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10957-013-0281-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-013-0281-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T09:55:21Z","timestamp":1559469321000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10957-013-0281-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,2,20]]},"references-count":22,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2013,9]]}},"alternative-id":["281"],"URL":"https:\/\/doi.org\/10.1007\/s10957-013-0281-0","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"value":"0022-3239","type":"print"},{"value":"1573-2878","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,2,20]]}}}