{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:23:49Z","timestamp":1773347029549,"version":"3.50.1"},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T00:00:00Z","timestamp":1557878400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T00:00:00Z","timestamp":1557878400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/100009567","name":"Budapest University of Technology and Economics","doi-asserted-by":"crossref","id":[{"id":"10.13039\/100009567","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cent Eur J Oper Res"],"published-print":{"date-parts":[[2020,9]]},"DOI":"10.1007\/s10100-019-00622-3","type":"journal-article","created":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T05:25:42Z","timestamp":1557897942000},"page":"1123-1140","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["A corrector\u2013predictor interior-point method with new search direction for linear optimization"],"prefix":"10.1007","volume":"28","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1094-9837","authenticated-orcid":false,"given":"Zs.","family":"Darvay","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8789-6211","authenticated-orcid":false,"given":"T.","family":"Ill\u00e9s","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"B.","family":"Kheirfam","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P. R.","family":"Rig\u00f3","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,5,15]]},"reference":[{"issue":"7","key":"622_CR1","first-page":"1889","volume":"216","author":"M Achache","year":"2010","unstructured":"Achache M (2010) Complexity analysis and numerical implementation of a short-step primal-dual algorithm for linear complementarity problems. Appl Math Comput 216(7):1889\u20131895","journal-title":"Appl Math Comput"},{"issue":"2","key":"622_CR2","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1007\/s11075-012-9628-0","volume":"63","author":"S Asadi","year":"2013","unstructured":"Asadi S, Mansouri H (2013) Polynomial interior-point algorithm for $${P}_*(\\kappa )$$ horizontal linear complementarity problems. Numer Algorithms 63(2):385\u2013398","journal-title":"Numer Algorithms"},{"issue":"2","key":"622_CR3","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1080\/02331934.2016.1267732","volume":"66","author":"S Asadi","year":"2017","unstructured":"Asadi S, Mansouri H, Darvay Zs (2017a) An infeasible full-NT step IPM for horizontal linear complementarity problem over Cartesian product of symmetric cones. Optimization 66(2):225\u2013250","journal-title":"Optimization"},{"key":"622_CR4","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1080\/01630563.2016.1232731","volume":"38","author":"S Asadi","year":"2017","unstructured":"Asadi S, Zangiabadi M, Mansouri H (2017b) A predictor\u2013corrector interior-point algorithm for $$P_*(\\kappa )-HLCPs$$ over Cartesian product of symmetric cones. Numer Funct Anal Optim 38:20\u201338","journal-title":"Numer Funct Anal Optim"},{"key":"622_CR5","volume-title":"The linear complementarity problem, computer science and scientific computing","author":"RW Cottle","year":"1992","unstructured":"Cottle RW, Pang J-S, Stone RE (1992) The linear complementarity problem, computer science and scientific computing. Academic Press Inc., Boston"},{"issue":"1","key":"622_CR6","first-page":"15","volume":"47","author":"Zs Darvay","year":"2002","unstructured":"Darvay Zs (2002) A new algorithm for solving self-dual linear optimization problems. Studia Univ Babe\u015f-Bolyai Ser Inform 47(1):15\u201326","journal-title":"Studia Univ Babe\u015f-Bolyai Ser Inform"},{"issue":"1","key":"622_CR7","first-page":"51","volume":"5","author":"Zs Darvay","year":"2003","unstructured":"Darvay Zs (2003) New interior-point algorithms in linear programming. Adv Model Optim 5(1):51\u201392","journal-title":"Adv Model Optim"},{"key":"622_CR8","first-page":"135","volume":"22","author":"Zs Darvay","year":"2005","unstructured":"Darvay Zs (2005) A new predictor\u2013corrector algorithm for linear programming. Alkalm Mat Lapok 22:135\u2013161 (in Hungarian)","journal-title":"Alkalm Mat Lapok"},{"issue":"2","key":"622_CR9","first-page":"121","volume":"54","author":"Zs Darvay","year":"2009","unstructured":"Darvay Zs (2009) A predictor\u2013corrector algorithm for linearly constrained convex optimization. Studia Univ Babe\u015f-Bolyai Ser Inform 54(2):121\u2013138","journal-title":"Studia Univ Babe\u015f-Bolyai Ser Inform"},{"key":"622_CR10","unstructured":"Darvay Zs, Tak\u00f3 I (2012) Computational comparison of primal-dual algorithms based on a new software. Unpublished manuscript (2012)"},{"issue":"1","key":"622_CR11","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/s10998-016-0119-2","volume":"73","author":"Zs Darvay","year":"2016","unstructured":"Darvay Zs, Papp IM, Tak\u00e1cs PR (2016) Complexity analysis of a full-Newton step interior-point method for linear optimization. Period Math Hung 73(1):27\u201342","journal-title":"Period Math Hung"},{"key":"622_CR12","first-page":"10","volume":"3","author":"D Gay","year":"1985","unstructured":"Gay D (1985) Electronic mail distribution of linear programming test problems. Math Program Soc COAL Newsl 3:10\u201312","journal-title":"Math Program Soc COAL Newsl"},{"issue":"3","key":"622_CR13","doi-asserted-by":"publisher","first-page":"1097","DOI":"10.1016\/j.ejor.2005.08.031","volume":"181","author":"T Ill\u00e9s","year":"2007","unstructured":"Ill\u00e9s T, Nagy M (2007) A new variant of the Mizuno\u2013Todd\u2013Ye predictor\u2013corrector algorithm for sufficient matrix linear complementarity problem. Eur J Oper Res 181(3):1097\u20131111","journal-title":"Eur J Oper Res"},{"issue":"1","key":"622_CR14","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1080\/02331934.2013.811666","volume":"63","author":"T Ill\u00e9s","year":"2014","unstructured":"Ill\u00e9s T, Nagy A (2014) Computational aspects of simplex and MBU-simplex algorithms using different anti-cycling pivot rules. Optimization 63(1):49\u201366","journal-title":"Optimization"},{"key":"622_CR15","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1016\/S0377-2217(02)00061-9","volume":"140","author":"T Ill\u00e9s","year":"2002","unstructured":"Ill\u00e9s T, Terlaky T (2002) Pivot versus interior point methods: pros and cons. Eur J Oper Res 140:6\u201326","journal-title":"Eur J Oper Res"},{"issue":"3","key":"622_CR16","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/s10898-008-9348-0","volume":"47","author":"T Ill\u00e9s","year":"2010","unstructured":"Ill\u00e9s T, Nagy M, Terlaky T (2010a) A polynomial path-following interior point algorithm for general linear complementarity problems. J Glob Optim 47(3):329\u2013342","journal-title":"J Glob Optim"},{"key":"622_CR17","first-page":"1","volume":"5","author":"T Ill\u00e9s","year":"2010","unstructured":"Ill\u00e9s T, Nagy M, Terlaky T (2010b) Polynomial interior point algorithms for general linear complementarity problems. Algorithmic Oper Res 5:1\u201312","journal-title":"Algorithmic Oper Res"},{"issue":"4","key":"622_CR18","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/BF02579150","volume":"4","author":"NK Karmarkar","year":"1984","unstructured":"Karmarkar NK (1984) A new polynomial-time algorithm for linear programming. Combinatorica 4(4):373\u2013395","journal-title":"Combinatorica"},{"issue":"2","key":"622_CR19","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1007\/s11075-013-9738-3","volume":"66","author":"B Kheirfam","year":"2014","unstructured":"Kheirfam B (2014) A predictor\u2013corrector interior-point algorithm for $$P_{*}(\\kappa )$$-horizontal linear complementarity problem. Numer Algorithms 66(2):349\u2013361","journal-title":"Numer Algorithms"},{"issue":"1","key":"622_CR20","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1007\/s10957-014-0554-2","volume":"164","author":"B Kheirfam","year":"2015","unstructured":"Kheirfam B (2015) A corrector\u2013predictor path-following method for convex quadratic symmetric cone optimization. J Optim Theory Appl 164(1):246\u2013260","journal-title":"J Optim Theory Appl"},{"issue":"12","key":"622_CR21","doi-asserted-by":"publisher","first-page":"2064","DOI":"10.1080\/00207160.2015.1085028","volume":"93","author":"B Kheirfam","year":"2016","unstructured":"Kheirfam B (2016) A corrector\u2013predictor path-following method for second-order cone optimization. Int J Comput Math 93(12):2064\u20132078","journal-title":"Int J Comput Math"},{"issue":"1","key":"622_CR22","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1007\/s12190-017-1128-x","volume":"57","author":"B Kheirfam","year":"2018","unstructured":"Kheirfam B (2018) An infeasible interior point method for the monotone SDLCP based on a transformation of the central path. J Appl Math Comput 57(1):685\u2013702","journal-title":"J Appl Math Comput"},{"key":"622_CR23","doi-asserted-by":"crossref","unstructured":"Kojima M, Megiddo N, Noma T, Yoshise A (1991) A unified approach to interior point algorithms for linear complementarity problems, vol 538. Lecture notes in computer science. Springer, Berlin","DOI":"10.1007\/3-540-54509-3"},{"issue":"6","key":"622_CR24","doi-asserted-by":"crossref","first-page":"3014","DOI":"10.1137\/090766735","volume":"20","author":"G Le\u0161aja","year":"2010","unstructured":"Le\u0161aja G, Roos C (2010) Unified analysis of kernel-based interior-point methods for $$P_*(\\kappa )$$-linear complementarity problems. SIAM J Optim 20(6):3014\u20133039","journal-title":"SIAM J Optim"},{"key":"622_CR25","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1080\/02331934.2015.1062011","volume":"65","author":"N Mohammadi","year":"2015","unstructured":"Mohammadi N, Mansouri H, Zangiabadi M, Asadi S (2015) A full Nesterov\u2013Todd step infeasible-interior-point algorithm for Cartesian $$P_*(\\kappa )$$ horizontal linear complementarity problem over symmetric cones. Optimization 65:539\u2013565","journal-title":"Optimization"},{"key":"622_CR26","series-title":"Interior-point and related methods","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/978-1-4613-9617-8_8","volume-title":"Progress in mathematical programming","author":"N Megiddo","year":"1989","unstructured":"Megiddo N (1989) Pathways to the optimal set in linear programming. In: Megiddo N (ed) Progress in mathematical programming. Interior-point and related methods. Springer, New York, pp 131\u2013158"},{"issue":"4","key":"622_CR27","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1137\/0802028","volume":"2","author":"S Mehrotra","year":"1992","unstructured":"Mehrotra S (1992) On the implementation of a primal-dual interior point method. SIAM J Optim 2(4):575\u2013601","journal-title":"SIAM J Optim"},{"key":"622_CR28","doi-asserted-by":"publisher","first-page":"964","DOI":"10.1287\/moor.18.4.964","volume":"18","author":"S Mizuno","year":"1993","unstructured":"Mizuno S, Todd MJ, Ye Y (1993) On adaptive-step primal-dual interior-point algorithms for linear programming. Math Oper Res 18:964\u2013981","journal-title":"Math Oper Res"},{"key":"622_CR29","volume-title":"Interior point polynomial methods in convex programming. SIAM studies in applied mathematics","author":"YE Nesterov","year":"1994","unstructured":"Nesterov YE, Nemirovski A (1994) Interior point polynomial methods in convex programming. SIAM studies in applied mathematics. SIAM Publications, Philadelphia"},{"key":"622_CR30","volume-title":"Self-regular functions: a new paradigm for primal-dual interior-point methods","author":"J Peng","year":"2002","unstructured":"Peng J, Roos C, Terlaky T (2002) Self-regular functions: a new paradigm for primal-dual interior-point methods. Princeton University Press, Princeton"},{"key":"622_CR31","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1016\/S0377-2217(02)00388-0","volume":"143","author":"FA Potra","year":"2002","unstructured":"Potra FA (2002) The Mizuno-Todd-Ye algorithm in a larger neighborhood of the central path. Eur J Oper Res 143:257\u2013267","journal-title":"Eur J Oper Res"},{"issue":"1","key":"622_CR32","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/120884341","volume":"24","author":"FA Potra","year":"2014","unstructured":"Potra FA (2014) Interior point methods for sufficient LCP in a wide neighborhood of the central path with optimal iteration complexity. SIAM J Optim 24(1):1\u201328","journal-title":"SIAM J Optim"},{"issue":"1","key":"622_CR33","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1007\/BF02614385","volume":"76","author":"FA Potra","year":"1996","unstructured":"Potra FA, Sheng R (1996) Predictor\u2013corrector algorithm for solving $$P_*(\\kappa )$$-matrix LCP from arbitrary positive starting points. Math Program 76(1):223\u2013244","journal-title":"Math Program"},{"key":"622_CR34","volume-title":"Theory and algorithms for linear optimization, an interior-point approach","author":"C Roos","year":"1997","unstructured":"Roos C, Terlaky T, Vial J-Ph (1997) Theory and algorithms for linear optimization, an interior-point approach. Wiley, Chichester"},{"key":"622_CR35","unstructured":"Sonnevend Gy (1985) A new method for solving a set of linear (convex) inequalities and its applications. Technical report, Department of Numerical Analysis, Institute of Mathematics, E\u00f6tv\u00f6s Lor\u00e1nd University, Budapest"},{"key":"622_CR36","unstructured":"Sonnevend Gy (1986) An \u201danalytic center\u201d for polyhedrons and new classes of global algorithms for linear (smooth, convex) programming. In: Pr\u00e9kopa A, Szelezs\u00e1n J, Strazicky B (eds) System modelling and optimization: proceedings of the 12th IFIP-conference held in Budapest, Hungary, Sept 1985. Lecture notes in control and information sciences, vol 84. Springer, Berlin, pp 866\u2013876"},{"key":"622_CR37","first-page":"19","volume":"62","author":"Gy Sonnevend","year":"1990","unstructured":"Sonnevend Gy, Stoer J, Zhao G (1990) On the complexity of following the central path by linear extrapolation in linear programming. Methods Oper Res 62:19\u201331","journal-title":"Methods Oper Res"},{"issue":"1","key":"622_CR38","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0377-2217(00)00094-1","volume":"130","author":"T Terlaky","year":"2001","unstructured":"Terlaky T (2001) An easy way to teach interior-point methods. Eur J Oper Res 130(1):1\u201319","journal-title":"Eur J Oper Res"},{"key":"622_CR39","doi-asserted-by":"crossref","unstructured":"Wang GQ (2012) A new polynomial interior-point algorithm for the monotone linear complementarity problem over symmetric cones with full NT-steps. Asia-Pac J Oper Res 29(2)","DOI":"10.1142\/S0217595912500157"},{"issue":"4","key":"622_CR40","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1007\/s12543-009-0033-x","volume":"1","author":"GQ Wang","year":"2009","unstructured":"Wang GQ, Yue YJ, Cai XZ (2009) Weighted-path-following interior-point algorithm to monotone mixed linear complementarity problem. Fuzzy Inf Eng 1(4):435\u2013445","journal-title":"Fuzzy Inf Eng"},{"key":"622_CR41","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611971453","volume-title":"Primal-dual interior-point methods","author":"SJ Wright","year":"1997","unstructured":"Wright SJ (1997) Primal-dual interior-point methods. SIAM, Philadelphia"},{"key":"622_CR42","doi-asserted-by":"publisher","DOI":"10.1002\/9781118032701","volume-title":"Interior point algorithms, Wiley-interscience series in discrete mathematics and optimization. Theory and analysis","author":"Y Ye","year":"1997","unstructured":"Ye Y (1997) Interior point algorithms, Wiley-interscience series in discrete mathematics and optimization. Theory and analysis. Wiley, New York"},{"issue":"1","key":"622_CR43","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1287\/moor.19.1.53","volume":"19","author":"Y Ye","year":"1994","unstructured":"Ye Y, Todd M, Mizuno S (1994) An $$O(\\sqrt{n} L)$$-iteration homogeneous and self-dual linear programming algorithm. Math Oper Res 19(1):53\u201367","journal-title":"Math Oper Res"},{"key":"622_CR44","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/978-1-4613-3449-1_8","volume-title":"Interior point methods of mathematical programming","author":"A Yoshise","year":"1996","unstructured":"Yoshise A (1996) Complementarity problems. In: Terlaky T (ed) Interior point methods of mathematical programming. Kluwer Academic Publishers, Dordrecht, pp 297\u2013367"}],"container-title":["Central European Journal of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10100-019-00622-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10100-019-00622-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10100-019-00622-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,19]],"date-time":"2020-07-19T08:08:21Z","timestamp":1595146101000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10100-019-00622-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,5,15]]},"references-count":44,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2020,9]]}},"alternative-id":["622"],"URL":"https:\/\/doi.org\/10.1007\/s10100-019-00622-3","relation":{},"ISSN":["1435-246X","1613-9178"],"issn-type":[{"value":"1435-246X","type":"print"},{"value":"1613-9178","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,5,15]]},"assertion":[{"value":"15 May 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}