{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,18]],"date-time":"2023-10-18T11:56:36Z","timestamp":1697630196390},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2015,5,22]],"date-time":"2015-05-22T00:00:00Z","timestamp":1432252800000},"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":["Numer Algor"],"published-print":{"date-parts":[[2016,3]]},"DOI":"10.1007\/s11075-015-0005-7","type":"journal-article","created":{"date-parts":[[2015,5,20]],"date-time":"2015-05-20T21:41:09Z","timestamp":1432158069000},"page":"491-503","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["An improved full-Newton step O(n) infeasible interior-point method for horizontal linear complementarity problem"],"prefix":"10.1007","volume":"71","author":[{"given":"Behrouz","family":"Kheirfam","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,5,22]]},"reference":[{"issue":"2","key":"5_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 {nL})$ 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":"1","key":"5_CR2","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1007\/BF01588254","volume":"17","author":"Y Fathi","year":"1979","unstructured":"Fathi, Y.: Computational complexity of LCPs associated with positive definite matrices. Math. Program. 17(1), 335\u2013344 (1979)","journal-title":"Math. Program."},{"key":"5_CR3","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., Shevchenko, O., Vancea, A.: Corrector-predictor methods for sufficient linear complementarity problems. Comput. Optim. Appl. 48, 453\u2013485 (2011)","journal-title":"Comput. Optim. Appl."},{"issue":"4","key":"5_CR4","first-page":"432","volume":"20","author":"ZH Huang","year":"2000","unstructured":"Huang, Z.H.: Polynomiality of high-order feasible interior point method for solving the horizontal linear complementarity problems. J. Sys. Sci. Math. Sci. 20(4), 432\u2013438 (2000)","journal-title":"J. Sys. Sci. Math. Sci."},{"key":"5_CR5","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"},{"issue":"3","key":"5_CR6","doi-asserted-by":"crossref","first-page":"853","DOI":"10.1007\/s10957-013-0457-7","volume":"161","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. 161(3), 853\u2013869 (2014)","journal-title":"J. Optim. Theory Appl."},{"key":"5_CR7","first-page":"355","volume":"69","author":"J Miao","year":"1995","unstructured":"Miao, J.: A quadratically convergent O ( ( 1 + \u03ba ) n L ) $\\mathcal {O}((1+\\kappa )\\sqrt {n}L)$ -iteration algorithm for the P \u2217(\u03ba)-matrix linear complementarity problem. Math. Program. 69, 355\u2013368 (1995)","journal-title":"Math. Program."},{"key":"5_CR8","volume-title":"Linear Complementarity, Linear and Nonlinear Programming","author":"KG Murty","year":"1988","unstructured":"Murty, K.G.: Linear Complementarity, Linear and Nonlinear Programming. Helderman-Verlag, Berlin (1988)"},{"issue":"3","key":"5_CR9","doi-asserted-by":"crossref","first-page":"1333","DOI":"10.1137\/080716979","volume":"20","author":"F Potra","year":"2009","unstructured":"Potra, F., Stoer, J.: On a class of superlinearly convergent polynomial time interior point methods for sufficient LCP. SIAM J. Optim. 20(3), 1333\u20131363 (2009)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"5_CR10","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 L) infeasible interior-point algorithm for linear optimization. SIAM J. Optim. 16(4), 1110\u20131136 (2006)","journal-title":"SIAM J. Optim."},{"key":"5_CR11","volume-title":"Theory and Algorithms for Linear Optimization. An Interior-Point Approach","author":"C Roos","year":"1997","unstructured":"Roos, C., Terlaky, T., Vial, J.-Ph.: Theory and Algorithms for Linear Optimization. An Interior-Point Approach. Wiley, Chichester (1997)"},{"issue":"1","key":"5_CR12","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1137\/140975462","volume":"25","author":"C Roos","year":"2015","unstructured":"Roos, C.: An improved and simplified full-Newton step O(n) infeasible interior-point method for linear optimization. SIAM J. Optim. 25(1), 102\u2013114 (2015)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"5_CR13","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."},{"issue":"1","key":"5_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-015-0005-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11075-015-0005-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-015-0005-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,3]],"date-time":"2019-06-03T10:01:13Z","timestamp":1559556073000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11075-015-0005-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,5,22]]},"references-count":14,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2016,3]]}},"alternative-id":["5"],"URL":"https:\/\/doi.org\/10.1007\/s11075-015-0005-7","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"value":"1017-1398","type":"print"},{"value":"1572-9265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,5,22]]}}}