{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,7]],"date-time":"2025-07-07T18:42:13Z","timestamp":1751913733595,"version":"3.37.3"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2019,9,11]],"date-time":"2019-09-11T00:00:00Z","timestamp":1568160000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,9,11]],"date-time":"2019-09-11T00:00:00Z","timestamp":1568160000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J. Appl. Math. Comput."],"published-print":{"date-parts":[[2020,2]]},"DOI":"10.1007\/s12190-019-01284-9","type":"journal-article","created":{"date-parts":[[2019,9,11]],"date-time":"2019-09-11T06:33:57Z","timestamp":1568183637000},"page":"281-300","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["An interior point method for $$P_{*}(\\kappa )$$-horizontal linear complementarity problem based on a new proximity function"],"prefix":"10.1007","volume":"62","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2248-5614","authenticated-orcid":false,"given":"Sajad","family":"Fathi Hafshejani","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alireza","family":"Fakharzadeh Jahromi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,9,11]]},"reference":[{"issue":"2","key":"1284_CR1","doi-asserted-by":"publisher","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_*(\\kappa )$$-horizontal linear complementarity problems. Numer. Algorithms 63(2), 385\u2013398 (2013)","journal-title":"Numer. Algorithms"},{"issue":"1","key":"1284_CR2","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/s40305-015-0070-6","volume":"3","author":"S Asadi","year":"2015","unstructured":"Asadi, S., Mansouri, H., Zangiabadi, M.: A class of path-following interior-point methods for $$P_*(\\kappa )$$-horizontal linear complementarity problems. J. Oper. Res. Soc. China 3(1), 17\u201330 (2015)","journal-title":"J. Oper. Res. Soc. China"},{"issue":"1","key":"1284_CR3","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/s12190-014-0856-4","volume":"50","author":"S Asadi","year":"2016","unstructured":"Asadi, S., Zangiabadi, M., Mansouri, H.: An infeasible interior-point algorithm with full-Newton steps for $$P_*(\\kappa )$$-horizontal linear complementarity problems based on a kernel function. J. Appl. Math. Comput. 50(1), 15\u201337 (2016)","journal-title":"J. Appl. Math. Comput."},{"issue":"1","key":"1284_CR4","doi-asserted-by":"publisher","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":"2","key":"1284_CR5","doi-asserted-by":"publisher","first-page":"528","DOI":"10.1007\/s10957-016-0895-0","volume":"170","author":"M Bouafia","year":"2016","unstructured":"Bouafia, M., Benterki, D., Yassine, A.: An efficient primal-dual interior point method for linear programming problems based on a new kernel function with a trigonometric barrier term. J. Optim. Theory Appl. 170(2), 528\u2013545 (2016)","journal-title":"J. Optim. Theory Appl."},{"key":"1284_CR6","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/s11075-012-9581-y","volume":"62","author":"X Cai","year":"2013","unstructured":"Cai, X., Wang, G., Zhang, Z.: Complexity analysis and numerical implementation of primal-dual interior-point methods for convex quadratic optimization based on a finite barrier. Numer. Algorithims 62, 289\u2013306 (2013)","journal-title":"Numer. Algorithims"},{"key":"1284_CR7","doi-asserted-by":"publisher","first-page":"3613","DOI":"10.1016\/j.cam.2011.05.036","volume":"236","author":"M El Ghami","year":"2012","unstructured":"El Ghami, M., Guennoun, Z.A., Boula, S., Steihaug, T.: Interior-point methods for linear optimization based on a kernel function with a trigonometric barrier term. J. Comput. Appl. Math. 236, 3613\u20133623 (2012)","journal-title":"J. Comput. Appl. Math."},{"issue":"2","key":"1284_CR8","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1016\/j.cam.2008.05.027","volume":"224","author":"M El. Ghamia","year":"2009","unstructured":"El. Ghamia, 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. 224(2), 500\u2013513 (2009)","journal-title":"J. Comput. Appl. Math."},{"key":"1284_CR9","first-page":"331","volume":"31","author":"M El Ghami","year":"2013","unstructured":"El Ghami, M.: Primal-dual interior-point methods for $$P_*(\\kappa )$$-linear complementarity problem based on a kernel function with a trigonometric barrier term. Optim. Theory Decis. Mak. Oper. Res. Appl. 31, 331\u2013349 (2013)","journal-title":"Optim. Theory Decis. Mak. Oper. Res. Appl."},{"key":"1284_CR10","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/s12190-014-0794-1","volume":"48","author":"S Fathi-Hafshejani","year":"2015","unstructured":"Fathi-Hafshejani, S., Fatemi, M., Peyghami, M.R.: An interior-point method for $$P_*(\\kappa )$$-linear complementarity problem based on a trigonometric kernel function. J. Appl. Math. Comput. 48, 111\u2013148 (2015)","journal-title":"J. Appl. Math. Comput."},{"key":"1284_CR11","doi-asserted-by":"crossref","unstructured":"Karmarkar, N.K.: A new polynomial-time algorithm for linear programming. In: Proceedings of the 16th Annual ACM Symposium on Theory of Computing, pp. 302\u2013311 (1984)","DOI":"10.1145\/800057.808695"},{"issue":"10","key":"1284_CR12","doi-asserted-by":"publisher","first-page":"1169","DOI":"10.1080\/01630563.2019.1598430","volume":"40","author":"B Kheirfam","year":"2019","unstructured":"Kheirfam, B.: A new search direction for full-newton stepinterior-point method in $$P_*(\\kappa )$$-HLCP. J. Numer. Funct. Anal. Optim. 40(10), 1169\u20131181 (2019)","journal-title":"J. Numer. Funct. Anal. Optim."},{"key":"1284_CR13","doi-asserted-by":"publisher","first-page":"659","DOI":"10.1007\/s11075-012-9557-y","volume":"61","author":"B Kheirfam","year":"2012","unstructured":"Kheirfam, B.: Primal-dual interior-point algorithm for semidefinite optimization based on a new kernel function with trigonometric barrier term. Numer. Algorithms 61, 659\u2013680 (2012)","journal-title":"Numer. Algorithms"},{"key":"1284_CR14","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/978-1-4613-9617-8_2","volume-title":"Progress in Mathematical Programming: Interior Point and Related Methods","author":"M Kojima","year":"1989","unstructured":"Kojima, M., Mizuno, S., Yoshise, A.: A primal-dual interior point algorithm for linear programming. In: Megiddo, N. (ed.) Progress in Mathematical Programming: Interior Point and Related Methods, pp. 29\u201347. Springer, New York (1989)"},{"key":"1284_CR15","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1186\/1029-242X-2013-215","volume":"2013","author":"YH Lee","year":"2013","unstructured":"Lee, Y.H., Cho, Y.Y., Cho, G.M.: Kernel function based interior-point methodsfor horizontal linear complementarity problems. J. Inequal. Appl. 2013, 215\u2013229 (2013)","journal-title":"J. Inequal. Appl."},{"key":"1284_CR16","doi-asserted-by":"publisher","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 )$$-linear complementarity problems. SIAM J. Optim. 20, 3014\u20133039 (2010)","journal-title":"SIAM J. Optim."},{"key":"1284_CR17","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, Princeton (2002)"},{"issue":"9","key":"1284_CR18","doi-asserted-by":"publisher","first-page":"1761","DOI":"10.1007\/s10114-010-7529-5","volume":"26","author":"MR Peyghami","year":"2010","unstructured":"Peyghami, M.R., Amini, K.: A kernel function based interior-point methods for solving $$P_{\\ast }(\\kappa )$$-linear complementarity problem. Acta Math. Sinica (Engl. Ser.) 26(9), 1761\u20131778 (2010)","journal-title":"Acta Math. Sinica (Engl. Ser.)"},{"key":"1284_CR19","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/s11075-013-9772-1","volume":"67","author":"MR Peyghami","year":"2016","unstructured":"Peyghami, M.R., Fathi-Hafshejani, S.: Complexity analysis of an interior point algorithm for linear optimization based on a new poriximity function. Numer. Algorithims 67, 33\u201348 (2016)","journal-title":"Numer. Algorithims"},{"key":"1284_CR20","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1016\/j.cam.2013.04.039","volume":"255","author":"MR Peyghami","year":"2014","unstructured":"Peyghami, M.R., Fathi-Hafshejani, S., Shirvani, L.: Complexity of interior-point methods for linear optimization based on a new trigonometric kernel function. J. Comput. Appl. Math. 255, 74\u201385 (2014)","journal-title":"J. Comput. Appl. Math."},{"key":"1284_CR21","volume-title":"Theory and Algorithms for Linear Optimization: An Interior Point Approach","author":"C Roos","year":"2005","unstructured":"Roos, C., Terlaky, T., Vial, J.-P.: Theory and Algorithms for Linear Optimization: An Interior Point Approach. Springer, NewYork (2005)"},{"key":"1284_CR22","first-page":"866","volume-title":"Lecture Notes in Control and Information Sciences","author":"G Sonnevend","year":"1986","unstructured":"Sonnevend, G.: An analytic center for polyhedrons and new classes of global algorithms for linear (smooth, convex) programming. In: Prakopa, A., Szelezsan, J., Strazicky, B. (eds.) Lecture Notes in Control and Information Sciences, vol. 84, pp. 866\u2013876. Springer, Berlin (1986)"},{"key":"1284_CR23","doi-asserted-by":"publisher","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 algorithm for $$P_*(\\kappa )$$ horizontal linear complementarity problem. J. Comput. Appl. Math. 233, 248\u2013263 (2009)","journal-title":"J. Comput. Appl. Math."}],"container-title":["Journal of Applied Mathematics and Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12190-019-01284-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12190-019-01284-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12190-019-01284-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,10]],"date-time":"2020-09-10T17:45:19Z","timestamp":1599759919000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12190-019-01284-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,9,11]]},"references-count":23,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2020,2]]}},"alternative-id":["1284"],"URL":"https:\/\/doi.org\/10.1007\/s12190-019-01284-9","relation":{},"ISSN":["1598-5865","1865-2085"],"issn-type":[{"type":"print","value":"1598-5865"},{"type":"electronic","value":"1865-2085"}],"subject":[],"published":{"date-parts":[[2019,9,11]]},"assertion":[{"value":"16 July 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 September 2019","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}