{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,20]],"date-time":"2026-04-20T11:47:47Z","timestamp":1776685667984,"version":"3.51.2"},"reference-count":72,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,7,6]],"date-time":"2022-07-06T00:00:00Z","timestamp":1657065600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,7,6]],"date-time":"2022-07-06T00:00:00Z","timestamp":1657065600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["OIA-1557417"],"award-info":[{"award-number":["OIA-1557417"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2022,9]]},"DOI":"10.1007\/s10589-022-00385-9","type":"journal-article","created":{"date-parts":[[2022,7,6]],"date-time":"2022-07-06T14:02:36Z","timestamp":1657116156000},"page":"211-246","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Projected orthogonal vectors in two-dimensional search interior point algorithms for linear programming"],"prefix":"10.1007","volume":"83","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3284-8378","authenticated-orcid":false,"given":"Fabio","family":"Vitor","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Todd","family":"Easton","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,7,6]]},"reference":[{"issue":"1\u20133","key":"385_CR1","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/BF01587095","volume":"44","author":"I Adler","year":"1989","unstructured":"Adler, I., Resende, M.G.C., Veiga, G., Karmarkar, N.: An implementation of Karmarkar\u2019s algorithm for linear programming. Math. Program. 44(1\u20133), 297\u2013335 (1989)","journal-title":"Mathematical Programming"},{"issue":"2","key":"385_CR2","doi-asserted-by":"publisher","first-page":"562","DOI":"10.1007\/s10957-015-0826-5","volume":"170","author":"A Asadi","year":"2016","unstructured":"Asadi, A., Roos, C.: Infeasible interior-point methods for linear optimization based on large neighborhood. J. Optim. Theory Appl. 170(2), 562\u2013590 (2016)","journal-title":"Journal of Optimization Theory and Applications"},{"issue":"2","key":"385_CR3","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1007\/BF02592024","volume":"36","author":"ER Barnes","year":"1986","unstructured":"Barnes, E.R.: A variation on Karmarkars algorithm for solving linear programming problems. Math. Program. 36(2), 174\u2013182 (1986)","journal-title":"Mathematical Programming"},{"issue":"2","key":"385_CR4","first-page":"499","volume":"314","author":"DA Bayer","year":"1989","unstructured":"Bayer, D.A., Lagarias, J.C.: The nonlinear geometry of linear programming. I affine and projective scaling trajectories. Trans. Am. Math. Soc. 314(2), 499\u2013526 (1989)","journal-title":"I affine and projective scaling trajectories. Transactions of the American Mathematical Society"},{"key":"385_CR5","volume-title":"Linear Programming and Network Flows","author":"MS Bazaraa","year":"2010","unstructured":"Bazaraa, M.S., Jarvis, J.J., Sherali, H.D.: Linear Programming and Network Flows, 4th edn. Wiley, Hoboken (2010)","edition":"4"},{"key":"385_CR6","volume-title":"Introduction to Linear Optimization","author":"D Bertsimas","year":"1997","unstructured":"Bertsimas, D., Tsitsiklis, J.N.: Introduction to Linear Optimization. Athena Scientific, Belmont (1997)"},{"issue":"3","key":"385_CR7","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1287\/ijoc.1.3.159","volume":"1","author":"PT Boggs","year":"1989","unstructured":"Boggs, P.T., Domich, P.D., Donaldson, J.R., Witzgall, C.: Algorithmic enhancements to the method of centers for linear programming problems. ORSA J. Comput. 1(3), 159\u2013171 (1989)","journal-title":"ORSA Journal on Computing"},{"issue":"2","key":"385_CR8","doi-asserted-by":"publisher","first-page":"528","DOI":"10.1007\/s10957-016-0895-0","volume":"170","author":"M Bouafia","year":"2016","unstructured":"Bouafia, M., Benterki, D., Yassine, A.: An efficient primal-dual interior point method for linear programming problems based on a new kernel function with a trigonometric barrier term. J. Optim. Theory Appl. 170(2), 528\u2013545 (2016)","journal-title":"Journal of Optimization Theory and Applications"},{"issue":"1","key":"385_CR9","first-page":"279","volume":"43","author":"C Brezinski","year":"2006","unstructured":"Brezinski, C.: The life and work of Andr\u00e9 Cholesky. Numer. Algorithms 43(1), 279\u2013288 (2006)","journal-title":"Numerical Algorithms"},{"issue":"13","key":"385_CR10","doi-asserted-by":"publisher","first-page":"1303","DOI":"10.1016\/S0305-0548(99)00075-1","volume":"27","author":"MC Cavichia","year":"2000","unstructured":"Cavichia, M.C., Arenales, M.N.: Piecewise linear programming via interior points. Comput. Oper. Res. 27(13), 1303\u20131324 (2000)","journal-title":"Computers & Operations Research"},{"issue":"3","key":"385_CR11","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/s10589-007-9106-0","volume":"41","author":"M Colombo","year":"2008","unstructured":"Colombo, M., Gondzio, J.: Further development of multiple centrality correctors for interior point methods. Comput. Optim. Appl. 41(3), 277\u2013305 (2008)","journal-title":"Computational Optimization and Applications"},{"issue":"1\u20134","key":"385_CR12","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1080\/10556789908805757","volume":"11","author":"J Czyzyk","year":"1999","unstructured":"Czyzyk, J., Mehrotra, S., Wagner, M., Wright, S.J.: PCx: an interior-point code for linear programming. Optim. Methods Softw. 11(1\u20134), 397\u2013430 (1999)","journal-title":"Optimization Methods and Software"},{"issue":"5","key":"385_CR13","doi-asserted-by":"publisher","first-page":"1099","DOI":"10.1007\/s11590-017-1171-4","volume":"12","author":"Z Darvay","year":"2018","unstructured":"Darvay, Z., Tak\u00e1cs, P.R.: New method for determining search directions for interior-point algorithms in linear optimization. Optim. Lett. 12(5), 1099\u20131116 (2018)","journal-title":"Optimization Letters"},{"issue":"4","key":"385_CR14","first-page":"747","volume":"174","author":"II Dikin","year":"1967","unstructured":"Dikin, I.I.: Iterative solution of problems of linear and quadratic programming. Dokl. Akad. Nauk SSSR 174(4), 747\u2013748 (1967)","journal-title":"Doklady Akademii Nauk SSSR"},{"issue":"1","key":"385_CR15","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/0024-3795(91)90280-A","volume":"152","author":"PD Domich","year":"1991","unstructured":"Domich, P.D., Boggs, P.T., Rogers, J.E., Witzgall, C.: Optimizing over three-dimensional subspaces in an interior-point method for linear programming. Linear Algebra Appl. 152(1), 315\u2013342 (1991)","journal-title":"Linear Algebra and Its Applications"},{"issue":"5","key":"385_CR16","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1145\/22899.22904","volume":"30","author":"JJ Dongarra","year":"1987","unstructured":"Dongarra, J.J., Grosse, E.: Distribution of mathematical software via electronic mail. Commun. ACM 30(5), 403\u2013407 (1987)","journal-title":"Communications of the ACM"},{"issue":"1","key":"385_CR17","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1137\/0213003","volume":"13","author":"ME Dyer","year":"1984","unstructured":"Dyer, M.E.: Linear time algorithms for two- and three-variable linear programs. SIAM J. Comput. 13(1), 31\u201345 (1984)","journal-title":"SIAM Journal on Computing"},{"issue":"3","key":"385_CR18","doi-asserted-by":"publisher","first-page":"725","DOI":"10.1137\/0215052","volume":"15","author":"ME Dyer","year":"1986","unstructured":"Dyer, M.E.: On a multidimensional search technique and its application to the Euclidean one-centre problem. SIAM J. Comput. 15(3), 725\u2013738 (1986)","journal-title":"SIAM Journal on Computing"},{"issue":"1","key":"385_CR19","first-page":"99","volume":"21","author":"M El Ghami","year":"2008","unstructured":"El Ghami, M., Ivanov, I.D., Roos, C., Steihaug, T.: A polynomial-time algorithm for LO based on generalized logarithmic barrier functions. Int. J. Appl. Math. 21(1), 99\u2013115 (2008)","journal-title":"International Journal of Applied Mathematics"},{"key":"385_CR20","volume-title":"Linear Optimization and Extensions: Theory and Algorithms","author":"S Fang","year":"1993","unstructured":"Fang, S., Puthenpura, S.: Linear Optimization and Extensions: Theory and Algorithms. Prentice Hall, Englewood Cliffs (1993)"},{"key":"385_CR21","first-page":"10","volume":"13","author":"DM Gay","year":"1985","unstructured":"Gay, D.M.: Electronic mail distribution of linear programming test problems. Math. Program. Soc. COAL Newsl. 13, 10\u201312 (1985)","journal-title":"Mathematical Programming Society COAL Newsletter"},{"issue":"2","key":"385_CR22","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 the projected Newton barrier methods for linear programming and an equivalence to Karmarkar\u2019s projective method. Math. Program. 36(2), 183\u2013209 (1986)","journal-title":"Mathematical Programming"},{"key":"385_CR23","first-page":"73","volume-title":"Handbooks in Operations Research and Management Science","author":"D Goldfarb","year":"1989","unstructured":"Goldfarb, D., Todd, M.J.: Chapter II linear programming. In: Nemhauser, G.L., Rinnooy Kan, A.H.G., Todd, M.J. (eds.) Handbooks in Operations Research and Management Science, vol. 1, pp. 73\u2013170. Elsevier, Amsterdam (1989)"},{"issue":"2","key":"385_CR24","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/BF00249643","volume":"6","author":"J Gondzio","year":"1996","unstructured":"Gondzio, J.: Multiple centrality corrections in a primal-dual method for linear programming. Comput. Optim. Appl. 6(2), 137\u2013156 (1996)","journal-title":"Computational Optimization and Applications"},{"issue":"3","key":"385_CR25","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1016\/j.ejor.2011.09.017","volume":"218","author":"J Gondzio","year":"2012","unstructured":"Gondzio, J.: Interior point methods 25 years later. Eur. J. Oper. Res. 218(3), 587\u2013601 (2012)","journal-title":"European Journal of Operational Research"},{"issue":"1\u20136","key":"385_CR26","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/BF01759039","volume":"6","author":"CC Gonzaga","year":"1991","unstructured":"Gonzaga, C.C.: Search directions for interior linear-programming methods. Algorithmica 6(1\u20136), 153\u2013181 (1991)","journal-title":"Algorithmica"},{"issue":"2","key":"385_CR27","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1137\/1034048","volume":"34","author":"CC Gonzaga","year":"1992","unstructured":"Gonzaga, C.C.: Path-following methods for linear programming. SIAM Rev. 34(2), 167\u2013224 (1992)","journal-title":"SIAM Review"},{"issue":"1\u20133","key":"385_CR28","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/BF01580610","volume":"60","author":"O G\u00fcler","year":"1993","unstructured":"G\u00fcler, O., Ye, Y.: Convergence behavior of interior-point algorithms. Math. Program. 60(1\u20133), 215\u2013228 (1993)","journal-title":"Mathematical Programming"},{"key":"385_CR29","first-page":"209","volume-title":"Nonlinear Programming","author":"P Huard","year":"1967","unstructured":"Huard, P.: Resolution of mathematical programming with nonlinear constraints by the method of centers. In: Abadie, J. (ed.) Nonlinear Programming, pp. 209\u2013219. North-Holland, Amsterdam (1967)"},{"issue":"2","key":"385_CR30","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1016\/S0377-2217(02)00061-9","volume":"140","author":"T Ill\u00e9s","year":"2002","unstructured":"Ill\u00e9s, T., Terlaky, T.: Pivot versus interior point methods: Pros and cons. Eur. J. Oper. Res. 140(2), 170\u2013190 (2002)","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"385_CR31","first-page":"38","volume":"1","author":"F Jarre","year":"1999","unstructured":"Jarre, F., Wechs, M.: Extending Mehrotra\u2019s corrector for linear programs. Adv. Model. Optim. 1(2), 38\u201360 (1999)","journal-title":"Advanced Modeling and Optimization"},{"key":"385_CR32","doi-asserted-by":"crossref","unstructured":"Karmarkar, N.: A new polynomial-time algorithm for linear programming. In: Proceedings of the 16th Annual ACM Symposium on Theory of Computing, New York, pp 302\u2013311 (1984)","DOI":"10.1145\/800057.808695"},{"issue":"4","key":"385_CR33","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/BF02579150","volume":"4","author":"N Karmarkar","year":"1984","unstructured":"Karmarkar, N.: A new polynomial-time algorithm for linear programming. Combinatorica 4(4), 373\u2013395 (1984)","journal-title":"Combinatorica"},{"key":"385_CR34","unstructured":"Karmarkar, N., Ramakrishnan, R.: Further developments in the new polynomial-time algorithm for linear programming. In: ORSA\/TIMS Joint National Meeting, Boston (1985)"},{"issue":"1","key":"385_CR35","first-page":"191","volume":"20","author":"LG Khachiyan","year":"1979","unstructured":"Khachiyan, L.G.: A polynomial algorithm in linear programming. Sov. Math. Dokl. 20(1), 191\u2013194 (1979)","journal-title":"Soviet Mathematics Doklady"},{"key":"385_CR36","doi-asserted-by":"publisher","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)"},{"issue":"1\u20133","key":"385_CR37","doi-asserted-by":"publisher","first-page":"263","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. 61(1\u20133), 263\u2013280 (1993)","journal-title":"Mathematical Programming"},{"issue":"3","key":"385_CR38","doi-asserted-by":"publisher","first-page":"796","DOI":"10.1137\/S1052623400366802","volume":"11","author":"JB Lasserre","year":"2001","unstructured":"Lasserre, J.B.: Global optimization with polynomials and the problem of moments. SIAM J. Optim. 11(3), 796\u2013817 (2001)","journal-title":"SIAM Journal on Optimization"},{"issue":"2","key":"385_CR39","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/S0305-0548(00)00069-1","volume":"29","author":"H Luh","year":"2002","unstructured":"Luh, H., Tsaih, R.: An efficient search direction for linear programming problems. Comput. Oper. Res. 29(2), 195\u2013203 (2002)","journal-title":"Computers & Operations Research"},{"issue":"3","key":"385_CR40","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1137\/0802022","volume":"2","author":"IJ Lustig","year":"1992","unstructured":"Lustig, I.J., Marsten, R.E., Shanno, D.F.: On implementing Mehrotra\u2019s predictor-corrector interior-point method for linear programming. SIAM J. Optim. 2(3), 435\u2013449 (1992)","journal-title":"SIAM Journal on Optimization"},{"issue":"1","key":"385_CR41","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/ijoc.6.1.1","volume":"6","author":"IJ Lustig","year":"1994","unstructured":"Lustig, I.J., Marsten, R.E., Shanno, D.F.: Interior point methods for linear programming: computational state of the art. ORSA J. Comput. 6(1), 1\u201314 (1994)","journal-title":"ORSA Journal on Computing"},{"issue":"4","key":"385_CR42","doi-asserted-by":"publisher","first-page":"759","DOI":"10.1137\/0212052","volume":"12","author":"N Megiddo","year":"1983","unstructured":"Megiddo, N.: Linear-time algorithms for linear programming in $${\\mathbb{R}}^{3}$$ and related problems. SIAM J. Comput. 12(4), 759\u2013776 (1983)","journal-title":"SIAM Journal on Computing"},{"issue":"1","key":"385_CR43","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1145\/2422.322418","volume":"31","author":"N Megiddo","year":"1984","unstructured":"Megiddo, N.: Linear programming in linear time when the dimension is fixed. J. Assoc. Comput. Mach. 31(1), 114\u2013127 (1984)","journal-title":"Journal of the Association for Computing Machinery"},{"key":"385_CR44","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/978-1-4613-9617-8_8","volume-title":"Progress in Mathematical Programming: Interior-Point and Related Methods","author":"N Megiddo","year":"1989","unstructured":"Megiddo, N.: Pathways to the optimal set in linear programming. In: Megiddo, N. (ed.) Progress in Mathematical Programming: Interior-Point and Related Methods, pp. 131\u2013158. Springer, New York (1989)"},{"issue":"4","key":"385_CR45","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(4), 575\u2013601 (1992)","journal-title":"SIAM Journal on Optimization"},{"issue":"3","key":"385_CR46","doi-asserted-by":"publisher","first-page":"635","DOI":"10.1137\/S1052623403431494","volume":"15","author":"S Mehrotra","year":"2005","unstructured":"Mehrotra, S., Li, Z.: Convergence conditions and Krylov subspace-based corrections for primal-dual interior-point method. SIAM J. Optim. 15(3), 635\u2013653 (2005)","journal-title":"SIAM Journal on Optimization"},{"key":"385_CR47","doi-asserted-by":"crossref","unstructured":"Mei, G., Guennoun, Z.A., Bouali, S., Steihaug T.: Interior-point methods for linear optimization based on a kernel function with a trigonometric barrier term. J. Comput. Appl. Math. 236(15), 3613\u20133623 (2012)","DOI":"10.1016\/j.cam.2011.05.036"},{"key":"385_CR48","unstructured":"Mittelmann, H.D.: Decision tree for optimization software (2021). http:\/\/plato.asu.edu\/guide.html"},{"issue":"2","key":"385_CR49","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1007\/BF02023109","volume":"46","author":"RDC Monteiro","year":"1993","unstructured":"Monteiro, R.D.C., Tsuchiya, T., Wang, Y.: A simplified global convergence proof of the affine scaling algorithm. Ann. Oper. Res. 46(2), 443\u2013482 (1993)","journal-title":"Annals of Operations Research"},{"issue":"4","key":"385_CR50","first-page":"61","volume":"6","author":"J Peng","year":"2001","unstructured":"Peng, J., Roos, C., Tam\u00e1s, Terlaky: A new and efficient large-update interior-point method for linear optimization. J. Comput. Technol. 6(4), 61\u201380 (2001)","journal-title":"Journal on Computational Technology"},{"issue":"1","key":"385_CR51","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/BF02206821","volume":"62","author":"R Saigal","year":"1996","unstructured":"Saigal, R.: A simple proof of a primal affine scaling method. Ann. Oper. Res. 62(1), 303\u2013324 (1996)","journal-title":"Annals of Operations Research"},{"issue":"2","key":"385_CR52","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1007\/s10589-019-00079-9","volume":"73","author":"L Santos","year":"2019","unstructured":"Santos, L., Villas-B\u00f4as, F., Oliveira, A.R.L., Perin, C.: Optimized choice of parameters in interior-point methods for linear programming. Comput. Optim. Appl. 73(2), 535\u2013574 (2019)","journal-title":"Computational Optimization and Applications"},{"key":"385_CR53","first-page":"208","volume-title":"17th Annual Symposium on Foundations of Computer Science","author":"MI Shamos","year":"1976","unstructured":"Shamos, M.I., Hoey, D.: Geometric intersection problems. In: 17th Annual Symposium on Foundations of Computer Science, pp. 208\u2013215. Houston, TX (1976)"},{"issue":"6","key":"385_CR54","doi-asserted-by":"publisher","first-page":"889","DOI":"10.1080\/02331934.2018.1432610","volume":"67","author":"PR Tak\u00e1cs","year":"2018","unstructured":"Tak\u00e1cs, P.R., Darvay, Z.: A primal-dual interior-point algorithm for symmetric optimization based on a new method for finding search directions. Optimization 67(6), 889\u2013905 (2018)","journal-title":"Optimization"},{"issue":"1","key":"385_CR55","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/BF02096264","volume":"46","author":"T Terlaky","year":"1993","unstructured":"Terlaky, T., Zhang, S.: Pivot rules for linear programming: a survey on recent theoretical developments. Ann. Oper. Res. 46(1), 203\u2013233 (1993)","journal-title":"Annals of Operations Research"},{"issue":"3","key":"385_CR56","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. Program. 91(3), 417\u2013436 (2002)","journal-title":"Mathematical Programming"},{"issue":"1\u20133","key":"385_CR57","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/BF01580904","volume":"56","author":"P Tseng","year":"1992","unstructured":"Tseng, P., Luo, Z.: On the convergence of the affine-scaling algorithm. Math. Program. 56(1\u20133), 301\u2013319 (1992)","journal-title":"Mathematical Programming"},{"issue":"3","key":"385_CR58","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1287\/moor.17.3.527","volume":"17","author":"T Tsuchiya","year":"1992","unstructured":"Tsuchiya, T.: Global convergence property of the affine scaling methods for primal degenerate linear programming problems. Math. Oper. Res. 17(3), 527\u2013557 (1992)","journal-title":"Mathematics of Operations Research"},{"key":"385_CR59","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-7630-6","volume-title":"Linear Programming: Foundations and Extensions","author":"RJ Vanderbei","year":"2014","unstructured":"Vanderbei, R.J.: Linear Programming: Foundations and Extensions, 4th edn. International Series in Operations Research & Management Science, Springer, New York (2014)","edition":"4"},{"issue":"1","key":"385_CR60","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1090\/conm\/114\/1097868","volume":"114","author":"RJ Vanderbei","year":"1990","unstructured":"Vanderbei, R.J., Lagarias, J.C.: I. I. Dikin\u2019s convergence result for the affine-scaling algorithm. Contemp. Math. 114(1), 109\u2013119 (1990)","journal-title":"Contemporary Mathematics"},{"issue":"1\u20134","key":"385_CR61","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/BF01840454","volume":"1","author":"RJ Vanderbei","year":"1986","unstructured":"Vanderbei, R.J., Meketon, M.S., Freedman, B.A.: A modification of Karmarkar\u2019s linear programming algorithm. Algorithmica 1(1\u20134), 395\u2013407 (1986)","journal-title":"Algorithmica"},{"issue":"1","key":"385_CR62","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1023\/A:1021850032714","volume":"24","author":"F Villas-B\u00f4as","year":"2003","unstructured":"Villas-B\u00f4as, F., Perin, C.: Postponing the choice of penalty parameterand step length. Comput. Optim. Appl. 24(1), 63\u201381 (2003)","journal-title":"Computational Optimization and Applications"},{"key":"385_CR63","unstructured":"Vitor, F.: The ratio algorithm to solve the optimal basis of two constraint linear programs. In: Barker, K., Berry, D., Rainwater, C. (eds.) Proceedings of the 2018 IISE Annual Conference, Orlando, FL, pp 1949\u20131954 (2018)"},{"key":"385_CR64","unstructured":"Vitor, F.T.: Two dimensional search algorithms for linear programming. PhD dissertation, Kansas State University, Mahattan (2019)"},{"issue":"1","key":"385_CR65","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/s00186-017-0610-4","volume":"87","author":"F Vitor","year":"2018","unstructured":"Vitor, F., Easton, T.: The double pivot simplex method. Math. Methods Oper. Res. 87(1), 109\u2013137 (2018)","journal-title":"Mathematical Methods of Operations Research"},{"key":"385_CR66","unstructured":"Vitor F, Easton T (2018b) A two dimensional search primal affine scaling interior point algorithm for linear programs. In: Barker K, Berry D, Rainwater C (eds) Proceedings of the 2018 IISE Annual Conference, Orlando, FL, pp 1961\u20131966"},{"key":"385_CR67","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611971453","volume-title":"Primal-Dual Interior-Point Methods","author":"SJ Wright","year":"1997","unstructured":"Wright, S.J.: Primal-Dual Interior-Point Methods. SIAM, Philadelphia (1997)"},{"issue":"4","key":"385_CR68","doi-asserted-by":"publisher","first-page":"1159","DOI":"10.1137\/S1052623496304712","volume":"9","author":"SJ Wright","year":"1999","unstructured":"Wright, S.J.: Modified cholesky factorizations in interior-point algorithms for linear programming. SIAM J. Optim. 9(4), 1159\u20131191 (1999)","journal-title":"SIAM Journal on Optimization"},{"issue":"3","key":"385_CR69","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":"Journal of Optimization Theory and Applications"},{"issue":"3","key":"385_CR70","doi-asserted-by":"publisher","first-page":"957","DOI":"10.1007\/s11075-018-0469-3","volume":"79","author":"Y Yang","year":"2018","unstructured":"Yang, Y.: Two computationally efficient polynomial-iteration infeasible interior-point algorithms for linear programming. Numer. Algorithms 79(3), 957\u2013992 (2018)","journal-title":"Numerical Algorithms"},{"key":"385_CR71","doi-asserted-by":"crossref","unstructured":"Yang, Y., Vitor, F.: A double-pivot degenerate-robust simplex algorithm for linear programming (2021). arXiv:2107.11451","DOI":"10.1504\/IJOR.2022.10050447"},{"issue":"1\u20132","key":"385_CR72","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/s12190-015-0900-z","volume":"51","author":"X Yang","year":"2016","unstructured":"Yang, X., Zhang, Y., Liu, H.: A wide neighborhood infeasible-interior-point method with arc-search for linear programming. J. Appl. Math. Comput. 51(1\u20132), 209\u2013225 (2016)","journal-title":"Journal of Applied Mathematics and Computing"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-022-00385-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-022-00385-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-022-00385-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,23]],"date-time":"2022-10-23T19:16:53Z","timestamp":1666552613000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-022-00385-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,6]]},"references-count":72,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,9]]}},"alternative-id":["385"],"URL":"https:\/\/doi.org\/10.1007\/s10589-022-00385-9","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,7,6]]},"assertion":[{"value":"26 September 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 June 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 July 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}