{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,4,12]],"date-time":"2024-04-12T04:29:32Z","timestamp":1712896172073},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2013,11,7]],"date-time":"2013-11-07T00:00:00Z","timestamp":1383782400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Optim Theory Appl"],"published-print":{"date-parts":[[2014,6]]},"DOI":"10.1007\/s10957-013-0457-7","type":"journal-article","created":{"date-parts":[[2013,11,6]],"date-time":"2013-11-06T16:57:39Z","timestamp":1383757059000},"page":"853-869","source":"Crossref","is-referenced-by-count":10,"title":["A New Complexity Analysis for Full-Newton Step Infeasible Interior-Point Algorithm for Horizontal Linear Complementarity Problems"],"prefix":"10.1007","volume":"161","author":[{"given":"Behrouz","family":"Kheirfam","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,11,7]]},"reference":[{"key":"457_CR1","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/BF02579150","volume":"4","author":"N.K. Karmarkar","year":"1984","unstructured":"Karmarkar, N.K.: A new polynomial-time algorithm for linear programming. Combinatorica 4, 373\u2013395 (1984)","journal-title":"Combinatorica"},{"issue":"2","key":"457_CR2","doi-asserted-by":"crossref","first-page":"400","DOI":"10.1137\/040604492","volume":"16","author":"W.B. Ai","year":"2005","unstructured":"Ai, W.B., Zhang, S.Z.: An $O(\\sqrt{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":"457_CR3","first-page":"355","volume":"69","author":"J. Miao","year":"1995","unstructured":"Miao, J.: A quadratically convergent $\\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."},{"issue":"4","key":"457_CR4","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\u2013dual interior-point algorithms for linear programming. Math. Oper. Res. 18(4), 964\u2013981 (1993)","journal-title":"Math. Oper. Res."},{"key":"457_CR5","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. 538. Springer, Berlin (1991)"},{"key":"457_CR6","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":"2","key":"457_CR7","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1016\/j.cam.2009.07.014","volume":"233","author":"G.Q. Wang","year":"2009","unstructured":"Wang, G.Q., Bai, Y.Q.: Polynomial interior-point algorithm for P \u2217(\u03ba) horizontal linear complementarity problem. J. Comput. Appl. Math. 233(2), 248\u2013263 (2009)","journal-title":"J. Comput. Appl. Math."},{"issue":"1","key":"457_CR8","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":"7","key":"457_CR9","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\u2013dual algorithm for linear complementarity problems. Appl. Math. Comput. 216(7), 1889\u20131895 (2010)","journal-title":"Appl. Math. Comput."},{"issue":"2","key":"457_CR10","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1007\/s11075-012-9628-0","volume":"63","author":"S. Asadi","year":"2013","unstructured":"Asadi, S., Mansouri, H.: Polynomial interior-point algorithm for P \u2217(\u03ba)-horizontal linear complementarity problems. Numer. Algorithms 63(2), 385\u2013398 (2013)","journal-title":"Numer. Algorithms"},{"key":"457_CR11","author":"B. Kheirfam","year":"2013","unstructured":"Kheirfam, B.: A predictor-corrector interior-point algorithm for P \u2217(\u03ba) horizontal linear complementarity problem. Numer. Algorithms (2013). doi: 10.1007\/s11075-013-9738-3","journal-title":"Numer. Algorithms"},{"key":"457_CR12","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/BF01588785","volume":"67","author":"I.J. Lustig","year":"1990","unstructured":"Lustig, I.J.: Feasible issues in a primal-dual interior-point method. Math. Program. 67, 145\u2013162 (1990)","journal-title":"Math. Program."},{"issue":"3","key":"457_CR13","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/BF01582151","volume":"61","author":"M. Kojima","year":"1993","unstructured":"Kojima, M., Megiddo, N., Mizuno, S.: A primal\u2013dual infeasible-interior-point algorithm for linear programming. Math. Program. 61(3), 263\u2013280 (1993)","journal-title":"Math. Program."},{"issue":"1","key":"457_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."},{"issue":"1","key":"457_CR15","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF01582216","volume":"67","author":"S. Mizuno","year":"1994","unstructured":"Mizuno, S.: Polynomiality of infeasible-interior-point algorithms for linear programming. Math. Program. 67(1), 109\u2013119 (1994)","journal-title":"Math. Program."},{"issue":"2","key":"457_CR16","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1137\/S1052623495279359","volume":"7","author":"F.A. Potra","year":"1997","unstructured":"Potra, F.A., Sheng, R.Q.: A large-step infeasible-interior-point method for the P \u2217-matrix LCP. SIAM J. Optim. 7(2), 318\u2013335 (1997)","journal-title":"SIAM J. Optim."},{"key":"457_CR17","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611971453","volume-title":"Primal\u2013Dual Interior-Point Methods","author":"S.J. Wright","year":"1997","unstructured":"Wright, S.J.: Primal\u2013Dual Interior-Point Methods. SIAM, Philadelphia (1997)"},{"issue":"4","key":"457_CR18","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":"457_CR19","doi-asserted-by":"crossref","first-page":"545","DOI":"10.1016\/j.nonrwa.2010.06.039","volume":"12","author":"H. Mansouri","year":"2011","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), 545\u2013561 (2011)","journal-title":"Nonlinear Anal., Real World Appl."},{"key":"457_CR20","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1017\/S144618111200003X","volume":"53","author":"B. Kheirfam","year":"2011","unstructured":"Kheirfam, B.: A full NT-step infeasible interior-point algorithm for semidefinite optimization based on a self-regular proximity. ANZIAM J. 53, 48\u201367 (2011)","journal-title":"ANZIAM J."},{"issue":"4","key":"457_CR21","doi-asserted-by":"crossref","first-page":"589","DOI":"10.1007\/s11075-011-9506-1","volume":"59","author":"B. Kheirfam","year":"2012","unstructured":"Kheirfam, B.: Simplified infeasible interior-point algorithm for SDO using full Nesterov\u2013Todd step. Numer. Algorithms 59(4), 589\u2013606 (2012)","journal-title":"Numer. Algorithms"},{"key":"457_CR22","first-page":"103","volume":"7","author":"B. Kheirfam","year":"2013","unstructured":"Kheirfam, B.: A full-Newton step infeasible interior-point algorithm for linear complementarity problems based on a kernel function. Algorithmic Oper. Res. 7, 103\u2013110 (2013)","journal-title":"Algorithmic Oper. Res."},{"key":"457_CR23","doi-asserted-by":"crossref","unstructured":"Kheirfam, B., Mahdavi-Amiri, N.: A full Nesterov\u2013Todd step infeasible interior-point algorithm for symmetric cone linear complementarity problem. Bull. Iran. Math. Soc. (2013) in press","DOI":"10.3934\/naco.2013.3.601"},{"issue":"2","key":"457_CR24","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1080\/02331934.2011.571257","volume":"62","author":"L. Zhang","year":"2013","unstructured":"Zhang, L., Sun, L., Xu, Y.: Simplified analysis for full-Newton step infeasible interior-point algorithm for semidefinite programming. Optimization 62(2), 169\u2013191 (2013)","journal-title":"Optimization"},{"issue":"2","key":"457_CR25","first-page":"203","volume":"36","author":"M. Anitescu","year":"1997","unstructured":"Anitescu, M., Lesaja, G., Potra, F.A.: An infeasible-interior-point predictor\u2013corrector algorithm for the P \u2217-Geometric LCP. Appl. Math. Optim. 36(2), 203\u2013228 (1997)","journal-title":"Appl. Math. Optim."},{"key":"457_CR26","volume-title":"Theory and Algorithms for Linear Optimization. An Interior-Point Approach","author":"C. Roos","year":"1997","unstructured":"Roos, C., Terlaky, T., Vial, J.-P.: Theory and Algorithms for Linear Optimization. An Interior-Point Approach. Wiley, Chichester (1997)"},{"key":"457_CR27","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1007\/s10957-009-9634-0","volume":"145","author":"G. Gu","year":"2010","unstructured":"Gu, G., Mansouri, H., Zangiabadi, M., Bai, Y.Q., Roos, C.: Improved full-Newton step O(nL) infeasible interior-point method for linear optimization. J. Optim. Theory Appl. 145, 271\u2013288 (2010)","journal-title":"J. Optim. Theory Appl."},{"issue":"3","key":"457_CR28","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."},{"key":"457_CR29","unstructured":"Kheirfam, B.: A full-Newton step infeasible interior-point algorithm for P \u2217(\u03ba)-horizontal linear complementarity problems. Submitted"}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-013-0457-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10957-013-0457-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-013-0457-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,1]],"date-time":"2019-08-01T02:55:23Z","timestamp":1564628123000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10957-013-0457-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,11,7]]},"references-count":29,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2014,6]]}},"alternative-id":["457"],"URL":"https:\/\/doi.org\/10.1007\/s10957-013-0457-7","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"value":"0022-3239","type":"print"},{"value":"1573-2878","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,11,7]]}}}