{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T14:35:41Z","timestamp":1742999741338,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642015120"},{"type":"electronic","value":"9783642015137"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-01513-7_9","type":"book-chapter","created":{"date-parts":[[2009,5,20]],"date-time":"2009-05-20T07:35:42Z","timestamp":1242804942000},"page":"77-87","source":"Crossref","is-referenced-by-count":1,"title":["A Class of New Large-Update Primal-Dual Interior-Point Algorithms for $\\emph{P}_\\ast(\\kappa)$ Linear Complementarity Problems"],"prefix":"10.1007","author":[{"given":"Huaping","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mingwang","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuqin","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_CR1","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/S0377-0427(00)00432-5","volume":"124","author":"S.C. Bullups","year":"2000","unstructured":"Bullups, S.C., Murty, K.G.: Complementarity problems. J. Comput. Appl. Math.\u00a0124, 303\u2013318 (2000)","journal-title":"J. Comput. Appl. Math."},{"key":"9_CR2","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/j.cam.2007.05.007","volume":"216","author":"G.M. Cho","year":"2008","unstructured":"Cho, G.M.: A new large-update interior point algorithm for P*(\u03ba) linear complementarity problems. J. Comput. Appl. Math.\u00a0216, 265\u2013278 (2008)","journal-title":"J. Comput. Appl. Math."},{"key":"9_CR3","first-page":"1169","volume":"182","author":"G.M. Cho","year":"2006","unstructured":"Cho, G.M., Kim, M.K.: A new lerge-update interior-piont algorithm for P*(\u03ba) LCPs based on kernel finction. Appl. Math. Comput.\u00a0182, 1169\u20131183 (2006)","journal-title":"Appl. Math. Comput."},{"key":"9_CR4","doi-asserted-by":"publisher","first-page":"948","DOI":"10.1016\/j.camwa.2006.12.004","volume":"53","author":"G.M. Cho","year":"2007","unstructured":"Cho, G.M., Kim, M.K., Lee, Y.H.: Complexity of large-update interior point algorithm for P*(\u03ba) linear complementarity problem. Comput. Math. Appl.\u00a053, 948\u2013960 (2007)","journal-title":"Comput. Math. Appl."},{"key":"9_CR5","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.: The Mizuno - Todd - Ye predictor - corrector algorithm for sufficient matrix linear complementarity problem. European J. Oper. Res.\u00a0181, 1097\u20131111 (2007)","journal-title":"European J. Oper. Res."},{"key":"9_CR6","doi-asserted-by":"crossref","unstructured":"El Ghami, M., Ivanov, I., Melissen, J.B.M., Roos, C., Steihaug, T.: A polynomial-time algorithm for linear optimization based on a new class of kernel functions. J. Comput. Appl. math. (2008), http:\/\/www.sciencedirect.com","DOI":"10.1109\/ISCC.2008.4625640"},{"key":"9_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-54509-3","volume-title":"A Unifided 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. LNCS, vol.\u00a0538. Springer, Heidelberg (1991)"},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"A new efficient large-update primal-dual interior-point method based on a finite barrier. SIAM. J. Optim.\u00a013, 766\u2013782 (2003)","DOI":"10.1137\/S1052623401398132"},{"key":"9_CR9","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1137\/S1052623403423114","volume":"15","author":"Y.Q. Bai","year":"2004","unstructured":"Bai, Y.Q., EI Ghami, M., Roos, C.: A comparative study of kernel functions for primal-dual interior-point algorithms in linear optimization. SIAM. J. Optim.\u00a015, 101\u2013128 (2004)","journal-title":"SIAM. J. Optim."},{"key":"9_CR10","volume-title":"Self-Regularity: A New Paradigm for Primal-Dual Interior-Point Algorithms","author":"J. Peng","year":"2002","unstructured":"Peng, J., Roos, C., Terlaky, T.: Self-Regularity: A New Paradigm for Primal-Dual Interior-Point Algorithms. Princeton University Press, USA (2002)"}],"container-title":["Lecture Notes in Computer Science","Advances in Neural Networks \u2013 ISNN 2009"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-01513-7_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T03:40:43Z","timestamp":1558323643000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-01513-7_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642015120","9783642015137"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-01513-7_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}