{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:23:47Z","timestamp":1773347027192,"version":"3.50.1"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2013,7,11]],"date-time":"2013-07-11T00:00:00Z","timestamp":1373500800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Numer Algor"],"published-print":{"date-parts":[[2014,6]]},"DOI":"10.1007\/s11075-013-9738-3","type":"journal-article","created":{"date-parts":[[2013,7,10]],"date-time":"2013-07-10T03:50:18Z","timestamp":1373428218000},"page":"349-361","source":"Crossref","is-referenced-by-count":29,"title":["A predictor-corrector interior-point algorithm for P \u2217 ( \u03ba ) $P_{*}(\\kappa )$ -horizontal linear complementarity problem"],"prefix":"10.1007","volume":"66","author":[{"given":"Behrouz","family":"Kheirfam","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,7,11]]},"reference":[{"issue":"2","key":"9738_CR1","doi-asserted-by":"crossref","first-page":"400","DOI":"10.1137\/040604492","volume":"16","author":"WB Ai","year":"2005","unstructured":"Ai, W.B., Zhang, S.Z.: An O ( n L ) $O(\\sqrt {n}L)$ iteration primal-dual path-following method, based on wide neighborhoods and large updates, for monotone linear complementarity problems. SIAM J. Optim. 16(2), 400\u2013417 (2005)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"9738_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.: Polynomial interior-point algorithm for P \u2217 ( \u03ba ) $P_*(\\kappa )$ -horizontal linear complementarity problems. Numer. Algorithms 63(2), 385-398 (2013)","journal-title":"Numer. Algorithms"},{"issue":"1","key":"9738_CR3","first-page":"51","volume":"5","author":"Z Darvay","year":"2003","unstructured":"Darvay, Z.: New interior-point algorithms in linear programming. Adv. Model. Optim. 5(1), 51\u201392 (2003)","journal-title":"Adv. Model. Optim."},{"issue":"2005","key":"9738_CR4","first-page":"135","volume":"22","author":"Z Darvay","year":"2005","unstructured":"Darvay, Z.: A new predictor-corrector algorithm for linear programming. Alkalmazott matematikai lapok 22, 135\u2013161 (2005). In hungarian","journal-title":"Alkalmazott matematikai lapok"},{"key":"9738_CR5","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1007\/s10589-009-9263-4","volume":"48","author":"F Gurtuna","year":"2011","unstructured":"Gurtuna, F., Petra, C., Potra, F.A., Shevehenko, O., Vancea, A.: Corrector-predictor methods for sufficient linear complementarity problems. Comput. Optim. Appl. 48, 453\u2013485 (2011)","journal-title":"Comput. Optim. Appl."},{"key":"9738_CR6","doi-asserted-by":"crossref","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.: A Mizuno-Todd-Ye type predictor-corrector algorithm for sufficient linear complementarity problems. Eur. J. Oper. Res. 181, 1097\u20131111 (2007)","journal-title":"Eur. J. Oper. Res."},{"key":"9738_CR7","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/BF02579150","volume":"4","author":"NK Karmarkar","year":"1984","unstructured":"Karmarkar, N.K.: A new polynomial-time algorithm for linear programming. Combinatorica 4, 373\u2013395 (1984)","journal-title":"Combinatorica"},{"key":"9738_CR8","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-54509-3","volume-title":"A Unified Approach to Interior Point Algorithms for Linear Complementarity Problems Lecture Notes in Computer Science, vol. 538","author":"M Kojima","year":"1991","unstructured":"Kojima, M., Megiddo, N., Noma, T., Yoshise, A.: A Unified Approach to Interior Point Algorithms for Linear Complementarity Problems Lecture Notes in Computer Science, vol. 538. Springer-Verlag, Berlin (1991)"},{"issue":"6","key":"9738_CR9","doi-asserted-by":"crossref","first-page":"3011","DOI":"10.1137\/090766735","volume":"20","author":"G Lesaja","year":"2010","unstructured":"Lesaja, G., Roos, C.: Unified analysis of kernel-based interior-point methods for P \u2217 ( \u03ba ) $P_*(\\kappa )$ -linear complementarity problems. SIAM J. Optim. 20(6), 3011\u20133039 (2010)","journal-title":"SIAM J. Optim."},{"key":"9738_CR10","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.J., 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":"9738_CR11","first-page":"407","volume":"83","author":"J Stoer","year":"1998","unstructured":"Stoer, J., Wechs, M.: Infeasible-interior-point paths for sufficient linear complemetarity problems and their analyticity. Math. Program. 83, 407\u2013423 (1998)","journal-title":"Math. Program."},{"key":"9738_CR12","first-page":"103","volume":"239","author":"H V\u00e4liaho","year":"1996","unstructured":"V\u00e4liaho, H.: P \u2217 $P_*$ -matrices are just sufficient. Linear Algebra Appl. 239, 103\u2013108 (1996)","journal-title":"Linear Algebra Appl."},{"key":"9738_CR13","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1016\/j.cam.2009.07.014","volume":"233","author":"GQ Wang","year":"2009","unstructured":"Wang, G.Q., Bai, Y.Q.: Polynomial interior-point algorithm for P \u2217 ( \u03ba ) $P_*(\\kappa )$ horizontal linear complementarity problem. J. Comput. Appl. Math. 233, 248\u2013263 (2009)","journal-title":"J. Comput. Appl. Math."},{"issue":"1","key":"9738_CR14","doi-asserted-by":"crossref","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(1), 208\u2013227 (1994)","journal-title":"SIAM J. Optim."}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-013-9738-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11075-013-9738-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-013-9738-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T01:08:22Z","timestamp":1559351302000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11075-013-9738-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,7,11]]},"references-count":14,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2014,6]]}},"alternative-id":["9738"],"URL":"https:\/\/doi.org\/10.1007\/s11075-013-9738-3","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"value":"1017-1398","type":"print"},{"value":"1572-9265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,7,11]]}}}