{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T14:28:39Z","timestamp":1648564119241},"reference-count":16,"publisher":"EDP Sciences","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Oper. Res."],"published-print":{"date-parts":[[2016,1]]},"DOI":"10.1051\/ro\/2015020","type":"journal-article","created":{"date-parts":[[2015,6,12]],"date-time":"2015-06-12T06:45:30Z","timestamp":1434091530000},"page":"131-143","source":"Crossref","is-referenced-by-count":1,"title":["Complexity analysis of a weighted-full-Newton step interior-point algorithm for<i>P<\/i><sub>\u2217<\/sub>(<i>\u03ba<\/i>)-LCP"],"prefix":"10.1051","volume":"50","author":[{"given":"Mohamed","family":"Achache","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"250","published-online":{"date-parts":[[2016,1,12]]},"reference":[{"key":"R1","unstructured":"Achache M., A weighted path-following method for the linear complementarity problem.Studia Univ. Babes-Bolyai, InformaticaXLIX(2004) 61\u201373."},{"key":"R2","doi-asserted-by":"crossref","unstructured":"Achache M. and Khebchache R., A full-Newton step feasible weighted primal-dual interior point algorithm for monotone LCP.Afrika Matematika26(2015) 139\u2013151.","DOI":"10.1007\/s13370-013-0193-z"},{"key":"R3","unstructured":"Cho G.M., Large-update interior point algorithm forP\u2217-linear complementarity problem.J. Inequalities Appl.363(2014) 1\u201312."},{"key":"R4","unstructured":"R.W. Cottle, J.S. Pang and R.E. Stone, The linear complementarity problem. Academic Press, San Deigo (1992)."},{"key":"R5","unstructured":"Darvay Zs., A weighted-path-following method for linear optimization.Studia Univ. Babes-Bolyai, InformaticaXLVII(2002)."},{"key":"R6","unstructured":"Ding J. and Li T.Y., An algorithm based on weighted logarithmic barrier functions for linear complementarity problems.Arab. J. Sci. Eng.15(1990) 679\u2013685."},{"key":"R7","unstructured":"T. Ill\u00e9s and M. Nagy, The Mizuno-Todd-Ye predictor-corrector algorithm for sufficient matrix linear complementarity problem.Oper. Res. report(2004)."},{"key":"R8","unstructured":"Jansen B., Roos C., Terlaky T. and Vial J.Ph., Primal-dual target-following algorithms for linear programming.Ann. Oper. Res.62(1997) 197\u2013231."},{"key":"R9","unstructured":"Mansouri H. and Asadi H., A quadratically convergent \\hbox{$O((1+\\kappa)\\sqrt{n})$}O((1+\u03ba)n) interior point algorithm for theP\u2217(\u03ba) \u2212 matrix horizontal linear complementarity problem.J. Sci. Islamic Republic of Iran23(2012) 237\u2013244."},{"key":"R10","unstructured":"I. P\u00f3lik,Novel analysis of interior point methods for linear optimization problems [in Hungarian]. Msc thesis, Eotvos Lorand University of Sciences. Faculty of Natural Sciences, Budapest (2002)."},{"key":"R11","unstructured":"C. Roos, T. Terlaky and J. Ph. Vial, Theory and Algorithms for Linear optimization. An Interior Point Approach. John Wiley and Sons, Chichester (1997)."},{"key":"R12","unstructured":"Wang G.Q. and Bai Y.Q., Polynomial interior-point algorithms forP\u2217(\u03ba)-horizontal linear complementarity problem.J. Comput. Appl. Math.233(2009) 249\u2013263."},{"key":"R13","unstructured":"Wang G.Q., Yue Y.J. and Cai X.Z., A weighted path-following method for monotone horizontal linear complementarity problem.Fuzzy Inform. Eng.54(2009) 479\u2013487."},{"key":"R14","unstructured":"Wang G.Q., Fan X.J., Zhu D.T. and Wang D.Z., New complexity analysis of a full-Newton step feasible interior point algorithm forP\u2217(\u03ba)-LCP.Optim. Lett.9(2015) 1105\u20131119."},{"key":"R15","unstructured":"Wang G.Q., Yu C.J. and Teo K.L., A full-Newton step feasible interior-point algorithm forP\u2217(\u03ba)-linear complementarity problem.J. Global Optim.59(2014) 81\u201399."},{"key":"R16","doi-asserted-by":"crossref","unstructured":"S.J. Wright, Primal-dual interior point methods. Copyright by SIAM (1997).","DOI":"10.1137\/1.9781611971453"}],"container-title":["RAIRO - Operations Research"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ro.org\/10.1051\/ro\/2015020\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,26]],"date-time":"2019-08-26T19:36:45Z","timestamp":1566848205000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ro.org\/10.1051\/ro\/2015020"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,1]]},"references-count":16,"journal-issue":{"issue":"1"},"alternative-id":["ro150020"],"URL":"https:\/\/doi.org\/10.1051\/ro\/2015020","relation":{},"ISSN":["0399-0559","1290-3868"],"issn-type":[{"value":"0399-0559","type":"print"},{"value":"1290-3868","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,1]]}}}