{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,4,8]],"date-time":"2024-04-08T10:00:02Z","timestamp":1712570402769},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2014,9,24]],"date-time":"2014-09-24T00:00:00Z","timestamp":1411516800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2015,8]]},"DOI":"10.1007\/s11590-014-0800-4","type":"journal-article","created":{"date-parts":[[2014,9,23]],"date-time":"2014-09-23T23:41:53Z","timestamp":1411515713000},"page":"1105-1119","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["New complexity analysis of a full-Newton step feasible interior-point algorithm for $$P_*(\\kappa )$$ P \u2217 ( \u03ba ) -LCP"],"prefix":"10.1007","volume":"9","author":[{"given":"G. Q.","family":"Wang","sequence":"first","affiliation":[]},{"given":"X. J.","family":"Fan","sequence":"additional","affiliation":[]},{"given":"D. T.","family":"Zhu","sequence":"additional","affiliation":[]},{"given":"D. Z.","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,9,24]]},"reference":[{"issue":"7","key":"800_CR1","doi-asserted-by":"crossref","first-page":"1889","DOI":"10.1016\/j.amc.2010.03.015","volume":"216","author":"M Achache","year":"2010","unstructured":"Achache, M.: Complexity analysis and numerical implementation of a short-step primal-dual algorithm for linear complementarity problems. Appl. Math. Comput. 216(7), 1889\u20131895 (2010)","journal-title":"Appl. Math. Comput."},{"issue":"2","key":"800_CR2","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(\\sqrt{n}L)$$ O ( 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."},{"key":"800_CR3","doi-asserted-by":"crossref","unstructured":"Asadi, H., Mansouri, H.: Polynomial interior-point algorithm for $$P_*(\\kappa )$$ P \u2217 ( \u03ba ) horizontal linear complementarity problems. Numer. Algorithms 63(2), 385\u2013398 (2013)","DOI":"10.1007\/s11075-012-9628-0"},{"issue":"1","key":"800_CR4","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1137\/S1052623403423114","volume":"15","author":"YQ Bai","year":"2004","unstructured":"Bai, Y.Q., El Ghami, M., Roos, C.: A comparative study of kernel functions for primal-dual interior-point algorithms in linear optimization. SIAM J. Optim. 15(1), 101\u2013128 (2004)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"800_CR5","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1007\/s10957-008-9389-z","volume":"138","author":"YQ Bai","year":"2008","unstructured":"Bai, Y.Q., Lesaja, G., Roos, C., Wang, G.Q., El Ghami, M.: A class of large-update and small-update primal-dual interior-point algorithms for linear optimization. J. Optim. Theory Appl. 138(3), 341\u2013359 (2008)","journal-title":"J. Optim. Theory Appl."},{"issue":"1","key":"800_CR6","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":"4","key":"800_CR7","doi-asserted-by":"crossref","first-page":"669","DOI":"10.1137\/S0036144595285963","volume":"39","author":"MC Ferris","year":"1997","unstructured":"Ferris, M.C., Pang, J.S.: Engineering and economic applications of complementarity problems. SIAM Rev. 39(4), 669\u2013713 (1997)","journal-title":"SIAM Rev."},{"key":"800_CR8","author":"B Kheirfam","year":"2014","unstructured":"Kheirfam, B.: A new complexity analysis for full-Newton step infeasible interior-point algorithm for horizontal linear complementarity problems. J. Optim. Theory Appl. (2014). doi: 10.1007\/s10957-013-0457-7","journal-title":"J. Optim. Theory Appl."},{"key":"800_CR9","doi-asserted-by":"crossref","unstructured":"Kojima, M., Megiddo, N., Noma, T., Yoshise, A.: A unified approach to interior point algorithms for linear complementarity problems. In: Lecture Notes in Computer Science, vol. 538, Springer,break New York (1991)","DOI":"10.1007\/3-540-54509-3"},{"issue":"6","key":"800_CR10","doi-asserted-by":"crossref","first-page":"3014","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_*(\\kappa )$$ P \u2217 ( \u03ba ) -linear complementarity problems. SIAM J. Optim. 20(6), 3014\u20133039 (2010)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"800_CR11","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1007\/s10957-012-0195-2","volume":"157","author":"H Mansouri","year":"2013","unstructured":"Mansouri, H., Pirhaji, M.: A polynomial interior-point algorithm for monotone linear complementarity problems. J. Optim. Theory Appl. 157(2), 451\u2013461 (2013)","journal-title":"J. Optim. Theory Appl."},{"issue":"1\u20133","key":"800_CR12","first-page":"355","volume":"69","author":"J Miao","year":"1995","unstructured":"Miao, J.: A quadratically convergent $$O((1+\\kappa )\\sqrt{n}L)$$ O ( ( 1 + \u03ba ) n L ) -iteration algorithm for the $$P_*(\\kappa )$$ P \u2217 ( \u03ba ) -matrix linear complementarity problem. Math. Program. 69(1\u20133), 355\u2013368 (1995)","journal-title":"Math. Program."},{"key":"800_CR13","doi-asserted-by":"crossref","unstructured":"Pan, S.H., Li, X.S., He, S.Y.: An infeasible primal-dual interior point algorithm for linear programs based on logarithmic equivalent transformation. J. Math. Anal. Appl. 314(2), 644\u2013660 (2006)","DOI":"10.1016\/j.jmaa.2005.04.028"},{"issue":"1","key":"800_CR14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/120884341","volume":"24","author":"FA Potra","year":"2014","unstructured":"Potra, F.A.: Interior-point methods for sufficient horizontal LCP in a wide neighborhood of the central path with best known iteration complexity. SIAM J. Optim. 24(1), 1\u201328 (2014)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"800_CR15","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1007\/BF02614385","volume":"76","author":"FA Potra","year":"1996","unstructured":"Potra, F.A., Sheng, R.Q.: Predictor-corrector algorithms for solving $$P_*(\\kappa )$$ P \u2217 ( \u03ba ) -matrix LCP from arbitrary positive starting points. Math. Program. 76(1), 223\u2013244 (1996)","journal-title":"Math. Program."},{"issue":"1","key":"800_CR16","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/s10898-013-0090-x","volume":"59","author":"GQ Wang","year":"2014","unstructured":"Wang, G.Q., Yu, C.J., Teo, K.L.: A full-Newton step feasible interior-point algorithm for $$P_*(\\kappa )$$ P \u2217 ( \u03ba ) -linear complementarity problem. J. Global Opti. 59(1), 81\u201399 (2014)","journal-title":"J. Global Opti."},{"issue":"2","key":"800_CR17","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 algorithms for $$P_*(\\kappa )$$ P \u2217 ( \u03ba ) horizontal linear complementarity problem. J. Comput. Appl. Math. 233(2), 248\u2013263 (2009)","journal-title":"J. Comput. Appl. Math."},{"issue":"5","key":"800_CR18","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1016\/j.orl.2011.06.006","volume":"39","author":"LP Zhang","year":"2011","unstructured":"Zhang, L.P., Xu, Y.H.: A full-Newton step interior-point algorithm based on modified Newton direction. Oper. Res. Lett. 39(5), 318\u2013322 (2011)","journal-title":"Oper. Res. Lett."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-014-0800-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-014-0800-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-014-0800-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T17:11:40Z","timestamp":1559409100000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-014-0800-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,9,24]]},"references-count":18,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2015,8]]}},"alternative-id":["800"],"URL":"https:\/\/doi.org\/10.1007\/s11590-014-0800-4","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,9,24]]}}}