{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,26]],"date-time":"2025-07-26T09:06:28Z","timestamp":1753520788423,"version":"3.37.3"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2018,1,13]],"date-time":"2018-01-13T00:00:00Z","timestamp":1515801600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Numer Algor"],"published-print":{"date-parts":[[2018,11]]},"DOI":"10.1007\/s11075-018-0469-3","type":"journal-article","created":{"date-parts":[[2018,1,12]],"date-time":"2018-01-12T20:00:49Z","timestamp":1515787249000},"page":"957-992","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Two computationally efficient polynomial-iteration infeasible interior-point algorithms for linear programming"],"prefix":"10.1007","volume":"79","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2943-9389","authenticated-orcid":false,"given":"Y.","family":"Yang","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,1,13]]},"reference":[{"key":"469_CR1","doi-asserted-by":"publisher","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":"469_CR2","doi-asserted-by":"publisher","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":"469_CR3","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/0024-3795(91)90275-2","volume":"152","author":"I Lustig","year":"1991","unstructured":"Lustig, I., Marsten, R., Shannon, D.: Computational experience with a primal-dual interior-point method for linear programming. Linear Algebra Appl. 152, 191\u2013222 (1991)","journal-title":"Linear Algebra Appl."},{"key":"469_CR4","doi-asserted-by":"publisher","first-page":"432","DOI":"10.1137\/0802022","volume":"2","author":"I Lustig","year":"1992","unstructured":"Lustig, I., Marsten, R., Shannon, D.: On implementing Mehrotra\u2019s predictor-corrector interior-point method for linear programming. SIAM J. Optim. 2, 432\u2013449 (1992)","journal-title":"SIAM J. Optim."},{"key":"469_CR5","doi-asserted-by":"publisher","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 polynomial-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":"469_CR6","doi-asserted-by":"publisher","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":"469_CR7","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/978-1-4613-9617-8_2","volume-title":"Progress in Mathematical Programming","author":"Masakazu 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. Springer-Verlag, New York (1989)"},{"key":"469_CR8","doi-asserted-by":"publisher","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":"469_CR9","unstructured":"Klee, V., Minty, G.: How good is the simplex algorithm? In: Shisha, O. (ed.) Inequalities, vol. III, pp 159\u2013175, Academic Press (1972)"},{"key":"469_CR10","first-page":"1093","volume":"224","author":"L Khachiyan","year":"1979","unstructured":"Khachiyan, L.: A polynomial algorithm in linear programming. Doklady Akademiia Nauk SSSR 224, 1093\u20131096 (1979)","journal-title":"Doklady Akademiia Nauk SSSR"},{"key":"469_CR11","doi-asserted-by":"publisher","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":"469_CR12","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/s101070100261","volume":"91","author":"MJ Todd","year":"2002","unstructured":"Todd, M.J.: The many facets of linear programming. Math. Progr. Ser B 91, 417\u2013436 (2002)","journal-title":"Math. Progr. Ser B"},{"issue":"3","key":"469_CR13","doi-asserted-by":"publisher","first-page":"859","DOI":"10.1007\/s10957-013-0281-0","volume":"158","author":"Y Yang","year":"2013","unstructured":"Yang, Y.: A polynomial arc-search interior-point algorithm for linear programming. J. Optim. Theory Appl. 158(3), 859\u2013873 (2013)","journal-title":"J. Optim. Theory Appl."},{"key":"469_CR14","doi-asserted-by":"publisher","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":"469_CR15","unstructured":"Cartis, C., Gould, N.I.M.: Finding a point in the relative interior of a polyhedron. Technical Report NA-07\/01, Computing Laboratory Oxford University (2007)"},{"issue":"4","key":"469_CR16","doi-asserted-by":"publisher","first-page":"967","DOI":"10.1007\/s11075-016-0180-1","volume":"74","author":"Y Yang","year":"2017","unstructured":"Yang, Y.: CurveLP-a MATLAB implementation of an infeasible interior-point algorithm for linear programming. Numer. Algorithms 74(4), 967\u2013996 (2017)","journal-title":"Numer. Algorithms"},{"key":"469_CR17","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1137\/0804012","volume":"4","author":"Y Zhang","year":"1994","unstructured":"Zhang, Y.: On the convergence of a class of infeasible interior-point methods for the horizontal linear complementarity problem. SIAM J. Optim. 4, 208\u2013227 (1994)","journal-title":"SIAM J. Optim."},{"issue":"1-3","key":"469_CR18","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/BF01582216","volume":"67","author":"Shinji Mizuno","year":"1994","unstructured":"Mizuno, M.: Polynomiality of infeasible interior-point algorithms for linear programming, vol. 67, pp. 109\u2013119 (1994)","journal-title":"Mathematical Programming"},{"issue":"3","key":"469_CR19","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1137\/S105262349325771X","volume":"6","author":"J Miao","year":"1996","unstructured":"Miao, J.: Two infeasible interior-point predict-corrector algorithms for linear programming. SIAM J. Optim. 6(3), 587\u2013599 (1996)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"469_CR20","doi-asserted-by":"publisher","first-page":"781","DOI":"10.1007\/s11590-017-1142-9","volume":"12","author":"Yaguang Yang","year":"2017","unstructured":"Yang, Y., Yamashita, M.: An arc-search O(nL) infeasible-interior-point algorithm for linear programming. Optim. Lett. https:\/\/doi.org\/10.1007\/s11590-017-1142-9","journal-title":"Optimization Letters"},{"key":"469_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02206809","volume":"62","author":"M Kojima","year":"1996","unstructured":"Kojima, M.: Basic lemmas in polynomial-time infeasible interior-point methods for linear programming. Ann. Oper. Res. 62, 1\u201328 (1996)","journal-title":"Ann. Oper. Res."},{"key":"469_CR22","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1080\/10556789508805634","volume":"6","author":"ED Andersen","year":"1995","unstructured":"Andersen, E.D.: Finding all linearly dependent rows in large-scale linear programming. Optim. Methods Softw. 6, 219\u2013227 (1995)","journal-title":"Optim. Methods Softw."},{"key":"469_CR23","unstructured":"Yang, Y.: Arc-search path-following interior-point algorithms for linear programming, Optimization Online. http:\/\/www.optimization-online.org\/DB_HTML\/2009\/08\/2375.html (2009)"},{"key":"469_CR24","unstructured":"Yang, Y.: An Efficient Polynomial Interior-Point Algorithm for Linear Programming, arXiv: 1304.3677 [math.OC] (2013)"},{"key":"469_CR25","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/BF01582151","volume":"61","author":"M Kojima","year":"1993","unstructured":"Kojima, M., Megiddo, N., Mizuno, S.: A primal-dual infeasible interior-point algorithm for linear programming. Math. Program. Series A 61, 261\u2013280 (1993)","journal-title":"Math. Program. Series A"},{"key":"469_CR26","doi-asserted-by":"crossref","unstructured":"Czyzyk, J., Mehrotra, S., Wagner, M., Wright, S.J.: PCx User Guide (version 1.1). Technical Report OTC 96\/01 Optimization Technology Center (1997)","DOI":"10.2172\/475586"},{"key":"469_CR27","unstructured":"Zhang, Y.: Solving large-scale linear programs by interior-point methods under the Matlab environment. Technical Report TR96-01, Department of Mathematics and Statistics University of Maryland (1996)"},{"key":"469_CR28","doi-asserted-by":"publisher","first-page":"1034","DOI":"10.1137\/0914063","volume":"14","author":"E Ng","year":"1993","unstructured":"Ng, E., Peyton, B.W.: Block sparse Cholesky algorithm on advanced uniprocessor computers. SIAM J. Sci. Comput. 14, 1034\u20131056 (1993)","journal-title":"SIAM J. Sci. Comput."},{"key":"469_CR29","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1145\/214392.214398","volume":"11","author":"JW Liu","year":"1985","unstructured":"Liu, J.W.: Modification of the minimum degree algorithm by multiple elimination. ACM Trans. Math. Softw. 11, 141\u2013153 (1985)","journal-title":"ACM Trans. Math. Softw."},{"key":"469_CR30","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/BF02096259","volume":"46","author":"O Guler","year":"1993","unstructured":"Guler, O., den Hertog, D., Roos, C., Terlaky, T., Tsuchiya, T.: Degeneracy in interior-point methods for linear programming: A survey. Ann. Oper. Res. 46, 107\u2013138 (1993)","journal-title":"Ann. Oper. Res."},{"key":"469_CR31","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/BF02592025","volume":"36","author":"PE Gill","year":"1986","unstructured":"Gill, P.E., Murray, W., Saunders, M.A., Tomlin, J.A., Wright, M.H.: On projected Newton barrier methods for linear programming and an equivalence of Karmarkar\u2019s projective method. Math. Program. 36, 183\u2013209 (1986)","journal-title":"Math. Program."},{"key":"469_CR32","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1090\/S0002-9939-1953-0055639-3","volume":"4","author":"J Ekefer","year":"1953","unstructured":"Ekefer, J.: Sequential minimax search for a maximum. Proc. Amer. Math. Soc. 4, 502\u2013506 (1953)","journal-title":"Proc. Amer. Math. Soc."},{"key":"469_CR33","unstructured":"Luenberger, D.: Linear and Nonlinear Programming, 2nd edn. Addison-Wesley Publishing Company, Menlo Park (1984)"},{"key":"469_CR34","doi-asserted-by":"publisher","first-page":"1432","DOI":"10.1109\/9.539425","volume":"41","author":"AL Tits","year":"1996","unstructured":"Tits, A.L., Yang, Y.: Globally convergent algorithms for robust pole assignment by state feedback. IEEE Trans. Autom. Control 41, 1432\u20131452 (1996)","journal-title":"IEEE Trans. Autom. Control"},{"key":"469_CR35","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"ED Dolan","year":"2002","unstructured":"Dolan, E.D., More, J.J.: Benchmarking optimization software with performance profiles. Math. Program. 91, 201\u2013213 (2002)","journal-title":"Math. Program."}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11075-018-0469-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-018-0469-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-018-0469-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,9]],"date-time":"2019-10-09T05:38:45Z","timestamp":1570599525000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11075-018-0469-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,1,13]]},"references-count":35,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2018,11]]}},"alternative-id":["469"],"URL":"https:\/\/doi.org\/10.1007\/s11075-018-0469-3","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"type":"print","value":"1017-1398"},{"type":"electronic","value":"1572-9265"}],"subject":[],"published":{"date-parts":[[2018,1,13]]},"assertion":[{"value":"10 November 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 January 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 January 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}