{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T15:28:50Z","timestamp":1768750130282,"version":"3.49.0"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2009,6,3]],"date-time":"2009-06-03T00:00:00Z","timestamp":1243987200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2011,4]]},"DOI":"10.1007\/s10589-009-9263-4","type":"journal-article","created":{"date-parts":[[2009,6,2]],"date-time":"2009-06-02T12:03:02Z","timestamp":1243944182000},"page":"453-485","source":"Crossref","is-referenced-by-count":34,"title":["Corrector-predictor methods for sufficient linear complementarity problems"],"prefix":"10.1007","volume":"48","author":[{"given":"Filiz","family":"Gurtuna","sequence":"first","affiliation":[]},{"given":"Cosmin","family":"Petra","sequence":"additional","affiliation":[]},{"given":"Florian A.","family":"Potra","sequence":"additional","affiliation":[]},{"given":"Olena","family":"Shevchenko","sequence":"additional","affiliation":[]},{"given":"Adrian","family":"Vancea","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,6,3]]},"reference":[{"issue":"3","key":"9263_CR1","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1080\/10556789708805657","volume":"7","author":"M. Anitescu","year":"1997","unstructured":"Anitescu, M., Lesaja, G., Potra, F.A.: Equivalence between different formulations of the linear complementarity problem. Optim. Methods Softw. 7(3), 265\u2013290 (1997)","journal-title":"Optim. Methods Softw."},{"key":"9263_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/moor.21.1.1","volume":"21","author":"J.F. Bonnans","year":"1996","unstructured":"Bonnans, J.F., Gonzaga, C.C.: Convergence of interior point algorithms for the monotone linear complementarity problem. Math. Oper. Res. 21, 1\u201325 (1996)","journal-title":"Math. Oper. Res."},{"issue":"2","key":"9263_CR3","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1287\/moor.22.2.378","volume":"22","author":"J.F. Bonnans","year":"1997","unstructured":"Bonnans, J.F., Potra, F.A.: On the convergence of the iteration sequence of infeasible path following algorithms for linear complementarity problems. Math. Oper. Res. 22(2), 378\u2013407 (1997)","journal-title":"Math. Oper. Res."},{"key":"9263_CR4","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0024-3795(89)90463-1","volume":"114\/115","author":"R.W. Cottle","year":"1989","unstructured":"Cottle, R.W., Pang, J.S., Venkateswaran, V.: Sufficient matrices and the linear complementarity problem. Linear Algebra Appl. 114\/115, 231\u2013249 (1989)","journal-title":"Linear Algebra Appl."},{"key":"9263_CR5","volume-title":"The Linear Complementarity Problem","author":"R.W. Cottle","year":"1992","unstructured":"Cottle, R.W., Pang, J.S., Stone, R.E.: The Linear Complementarity Problem. Academic Press, San Diego (1992)"},{"issue":"1","key":"9263_CR6","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1007\/BF02192304","volume":"85","author":"J. Ji","year":"1995","unstructured":"Ji, J., Potra, F.A., Huang, S.: Predictor-corrector method for linear complementarity problems with polynomial complexity and superlinear convergence. J. Optim. Theory Appl. 85(1), 187\u2013199 (1995)","journal-title":"J. Optim. Theory Appl."},{"key":"9263_CR7","series-title":"Lecture Notes in Comput. Sci.","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-54509-3","volume-title":"A Unified Approach to Interior Point Algorithms for Linear Complementarity Problems","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 Comput. Sci., vol.\u00a0538. Springer, New York (1991)"},{"issue":"3","key":"9263_CR8","doi-asserted-by":"crossref","first-page":"871","DOI":"10.1137\/050623723","volume":"17","author":"X. Liu","year":"2006","unstructured":"Liu, X., Potra, F.A.: Corrector-predictor methods for sufficient linear complementarity problems in a wide neighborhood of the central path. SIAM J. Optim. 17(3), 871\u2013890 (2006)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"9263_CR9","doi-asserted-by":"crossref","first-page":"741","DOI":"10.1287\/moor.18.3.741","volume":"18","author":"S. Mehrotra","year":"1993","unstructured":"Mehrotra, S.: Quadratic convergence in a primal-dual method. Math. Oper. Res. 18(3), 741\u2013751 (1993)","journal-title":"Math. Oper. Res."},{"key":"9263_CR10","first-page":"355","volume":"69","author":"J. Miao","year":"1995","unstructured":"Miao, J.: A quadratically convergent ${O}((1+k)\\sqrt{n}{L})$ -iteration algorithm for the P *(k)-matrix linear complementarity problem. Math. Program. 69, 355\u2013368 (1995)","journal-title":"Math. Program."},{"issue":"4","key":"9263_CR11","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(4), 964\u2013981 (1993)","journal-title":"Math. Oper. Res."},{"key":"9263_CR12","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/BF01300971","volume":"3","author":"R.D.C. Monteiro","year":"1994","unstructured":"Monteiro, R.D.C., Wright, S.J.: Local convergence of interior-point algorithms for degenerate monotone LCP. Comput. Optim. Appl. 3, 131\u2013155 (1994)","journal-title":"Comput. Optim. Appl."},{"issue":"1","key":"9263_CR13","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1080\/10556780512331318038","volume":"20","author":"F.A. Potra","year":"2005","unstructured":"Potra, F.A., Liu, X.: Predictor-corrector methods for sufficient linear complementarity problems in a wide neighborhood of the central path. Optim. Methods Softw. 20(1), 145\u2013168 (2005)","journal-title":"Optim. Methods Softw."},{"key":"9263_CR14","unstructured":"Potra, F.A., Stoer, J.: On a class of superlinearly convergent polynomial time interior point methods for sufficient LCP. Technical Report TR2008-02, Mathematics and Statistics, UMBC (2008). http:\/\/www.math.umbc.edu\/~kogan\/technical_papers\/index2008.html"},{"key":"9263_CR15","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1023\/A:1012951021320","volume":"103","author":"J. Stoer","year":"2001","unstructured":"Stoer, J.: High order long-step methods for solving linear complementarity problems. Ann. Oper. Res. 103, 149\u2013159 (2001). Optimization and numerical algebra (Nanjing, 1999)","journal-title":"Ann. Oper. Res."},{"issue":"2","key":"9263_CR16","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1080\/10556789808805721","volume":"10","author":"J. Stoer","year":"1998","unstructured":"Stoer, J., Wechs, M.: The complexity of high-order predictor-corrector methods for solving sufficient linear complementarity problems. Optim. Methods Softw. 10(2), 393\u2013417 (1998). Dedicated to Professor Masao Iri on the occasion of his 65th birthday","journal-title":"Optim. Methods Softw."},{"issue":"3","key":"9263_CR17","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1007\/BF02680568","volume":"83","author":"J. Stoer","year":"1998","unstructured":"Stoer, J., Wechs, M.: Infeasible-interior-point paths for sufficient linear complementarity problems and their analyticity. Math. Program. Ser. A 83(3), 407\u2013423 (1998)","journal-title":"Math. Program. Ser. A"},{"issue":"4","key":"9263_CR18","doi-asserted-by":"crossref","first-page":"832","DOI":"10.1287\/moor.23.4.832","volume":"23","author":"J. Stoer","year":"1998","unstructured":"Stoer, J., Wechs, M., Mizuno, S.: High order infeasible-interior-point methods for solving sufficient linear complementarity problems. Math. Oper. Res. 23(4), 832\u2013862 (1998)","journal-title":"Math. Oper. Res."},{"key":"9263_CR19","first-page":"103","volume":"239","author":"H. V\u00e4liaho","year":"1996","unstructured":"V\u00e4liaho, H.: P *-matrices are just sufficient. Linear Algebra Appl. 239, 103\u2013108 (1996)","journal-title":"Linear Algebra Appl."},{"issue":"3","key":"9263_CR20","doi-asserted-by":"crossref","first-page":"537","DOI":"10.1007\/BF01585182","volume":"62","author":"Y. Ye","year":"1993","unstructured":"Ye, Y., Anstreicher, K.: On quadratic and ${O}(\\sqrt{n}{L})$ convergence of predictor-corrector algorithm for LCP. Math. Program. 62(3), 537\u2013551 (1993)","journal-title":"Math. Program."},{"issue":"2","key":"9263_CR21","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/BF01581242","volume":"59","author":"Y. Ye","year":"1993","unstructured":"Ye, Y., G\u00fcler, O., Tapia, R.A., Zhang, Y.: A quadratically convergent ${O}(\\sqrt{n}{L})$ -iteration algorithm for linear programming. Math. Program. 59(2), 151\u2013162 (1993)","journal-title":"Math. Program."},{"issue":"1","key":"9263_CR22","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.J., Mizuno, S.: An ${O}(\\sqrt{n}{L})$ -iteration homogeneous and self-dual linear programming algorithm. Math. Oper. Res. 19(1), 53\u201367 (1994)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"9263_CR23","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/BF01585931","volume":"70","author":"G.Y. Zhao","year":"1995","unstructured":"Zhao, G.Y., Zhu, J.S.: The curvature integral and the complexity of linear complementarity problems. Math. Program. Ser. A 70(1), 107\u2013122 (1995)","journal-title":"Math. Program. Ser. A"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-009-9263-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-009-9263-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-009-9263-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T07:36:36Z","timestamp":1559288196000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-009-9263-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,6,3]]},"references-count":23,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2011,4]]}},"alternative-id":["9263"],"URL":"https:\/\/doi.org\/10.1007\/s10589-009-9263-4","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,6,3]]}}}