{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,2,29]],"date-time":"2024-02-29T08:20:21Z","timestamp":1709194821903},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2012,1,12]],"date-time":"2012-01-12T00:00:00Z","timestamp":1326326400000},"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":[[2012,9]]},"DOI":"10.1007\/s11075-011-9530-1","type":"journal-article","created":{"date-parts":[[2012,1,10]],"date-time":"2012-01-10T23:27:53Z","timestamp":1326238073000},"page":"57-81","source":"Crossref","is-referenced-by-count":9,"title":["A full-Newton step infeasible interior-point algorithm for monotone LCP based on a locally-kernel function"],"prefix":"10.1007","volume":"61","author":[{"given":"Zhang","family":"Lipu","sequence":"first","affiliation":[]},{"given":"Bai","family":"Yanqin","sequence":"additional","affiliation":[]},{"given":"Xu","family":"Yinghong","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,1,12]]},"reference":[{"key":"9530_CR1","doi-asserted-by":"crossref","unstructured":"Cottle, R., Pang, J., Stone, R.: The Linear Complementarity Problem. Society for Industrial Mathematics (2009)","DOI":"10.1137\/1.9780898719000"},{"key":"9530_CR2","unstructured":"El\u00a0Ghami, M.: New primal-dual interior-point methods based on kernel functions. Ph.D Thesis, Delft University of Technology (2005)"},{"key":"9530_CR3","doi-asserted-by":"crossref","unstructured":"Kojima, M., Megiddo, N., Noma, T.: A unified approach to interior point algorithms for linear complementarity problems. In: Lecture Notes in Computer Science, Springer (1991)","DOI":"10.1007\/3-540-54509-3"},{"issue":"4","key":"9530_CR4","doi-asserted-by":"crossref","first-page":"754","DOI":"10.1287\/moor.16.4.754","volume":"16","author":"M Kojima","year":"1991","unstructured":"Kojima, M., Megiddo, N., Noma, T.: Homotopy continuation methods for nonlinear complementarity problems. Math. Oper. Res. 16(4), 754\u2013774 (1991)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"9530_CR5","doi-asserted-by":"crossref","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 problems. Math. Prog. 44(1), 1\u201326 (1989)","journal-title":"Math. Prog."},{"issue":"1","key":"9530_CR6","first-page":"546","volume":"12","author":"H Mansouri","year":"2010","unstructured":"Mansouri, H., Zangiabadi, M., Pirhaji, M.: A full-Newton step o (n) infeasible-interior-point algorithm for linear complementarity problems. Nonlinear Anal.: Real World Appl. 12(1), 546\u2013561 (2010)","journal-title":"Nonlinear Anal.: Real World Appl."},{"issue":"2","key":"9530_CR7","doi-asserted-by":"crossref","first-page":"342","DOI":"10.1287\/moor.15.2.342","volume":"15","author":"S Mehrotra","year":"1990","unstructured":"Mehrotra, S., Sun, J.: An algorithm for convex quadratic programming that requires O(n^3.5L) arithmetic operations. Math. Oper. Res. 15(2), 342\u2013363 (1990)","journal-title":"Math. Oper. Res."},{"issue":"2","key":"9530_CR8","doi-asserted-by":"crossref","first-page":"529","DOI":"10.1137\/0728029","volume":"28","author":"S Mehrotra","year":"1991","unstructured":"Mehrotra, S., Sun, J.: A method of analytic centers for quadratically constrained convex quadratic programs. SIAM J. Numer. Anal. 28(2), 529\u2013544 (1991)","journal-title":"SIAM J. Numer. Anal."},{"issue":"4","key":"9530_CR9","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., 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."},{"issue":"1","key":"9530_CR10","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/BF01587076","volume":"44","author":"R Monteiro","year":"1989","unstructured":"Monteiro, R., Adler, I.: Interior path following primal-dual algorithms. Part II: convex quadratic programming. Math. Prog. 44(1), 43\u201366 (1989)","journal-title":"Math. Prog."},{"key":"9530_CR11","doi-asserted-by":"crossref","unstructured":"Potra, F.: An infeasible interior point method for linear complementarity problems over symmetric cones. In: AIP Conference Proceedings, vol. 1168, pp. 1403\u20131406 (2009)","DOI":"10.1063\/1.3241352"},{"issue":"0","key":"9530_CR12","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1023\/A:1018942131812","volume":"81","author":"F Potra","year":"1998","unstructured":"Potra, F., Sheng, R.: A path following method for LCP withsuperlinearly convergent iteration sequence. Ann. Oper. Res. 81(0), 97\u2013114 (1998)","journal-title":"Ann. Oper. Res."},{"issue":"4","key":"9530_CR13","doi-asserted-by":"crossref","first-page":"1110","DOI":"10.1137\/050623917","volume":"16","author":"C Roos","year":"2006","unstructured":"Roos, C.: A full-Newton step o (n) infeasible interior-point algorithm for linear optimization. SIAM J. Optim. 16(4), 1110\u20131136 (2006)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"9530_CR14","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/BF01582211","volume":"67","author":"S Wright","year":"1994","unstructured":"Wright, S.: An infeasible-interior-point algorithm for linear complementarity problems. Math. Program. 67(1), 29\u201351 (1994)","journal-title":"Math. Program."},{"key":"9530_CR15","volume-title":"Interior Point Methods of Mathematical Programming","author":"A Yoshise","year":"1996","unstructured":"Yoshise, A.: Complementarity problems. In: Terlaky T. (ed.) Interior Point Methods of Mathematical Programming. Kluwer Academic Publishers, Dordrecht (1996)"},{"issue":"3","key":"9530_CR16","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1023\/B:COAP.0000013059.84424.af","volume":"27","author":"G Zhou","year":"2004","unstructured":"Zhou, G., Toh, K., Zhao, G.: Convergence analysis of an infeasible interior point algorithm based on a regularized central path for linear complementarity problems. Comput. Optim. Appl. 27(3), 269\u2013283 (2004)","journal-title":"Comput. Optim. Appl."}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-011-9530-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11075-011-9530-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-011-9530-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,22]],"date-time":"2019-06-22T05:43:36Z","timestamp":1561182216000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11075-011-9530-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,1,12]]},"references-count":16,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,9]]}},"alternative-id":["9530"],"URL":"https:\/\/doi.org\/10.1007\/s11075-011-9530-1","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"value":"1017-1398","type":"print"},{"value":"1572-9265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,1,12]]}}}