{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T06:51:41Z","timestamp":1774594301840,"version":"3.50.1"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2018,7,16]],"date-time":"2018-07-16T00:00:00Z","timestamp":1531699200000},"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":["J Optim Theory Appl"],"published-print":{"date-parts":[[2018,9]]},"DOI":"10.1007\/s10957-018-1344-z","type":"journal-article","created":{"date-parts":[[2018,7,16]],"date-time":"2018-07-16T14:32:35Z","timestamp":1531751555000},"page":"935-949","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Complexity of Interior Point Methods for a Class of Linear Complementarity Problems Using a Kernel Function with Trigonometric Growth Term"],"prefix":"10.1007","volume":"178","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5731-8234","authenticated-orcid":false,"given":"Sajad","family":"Fathi-Hafshejani","sequence":"first","affiliation":[]},{"given":"Alireza","family":"Fakharzadeh Jahromi","sequence":"additional","affiliation":[]},{"given":"Mohammad Reza","family":"Peyghami","sequence":"additional","affiliation":[]},{"given":"Shengyuan","family":"Chen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,7,16]]},"reference":[{"key":"1344_CR1","doi-asserted-by":"publisher","DOI":"10.1002\/9781118032701","volume-title":"Interior-Point Algorithms: Theory and Analysis. Wiley-Interscience Series in Discrete Mathematics and Optimization","author":"Y Ye","year":"1997","unstructured":"Ye, Y.: Interior-Point Algorithms: Theory and Analysis. Wiley-Interscience Series in Discrete Mathematics and Optimization. Wiley, Chichester (1997)"},{"key":"1344_CR2","volume-title":"The Linear Complementarity Problem","author":"RW Cottle","year":"1992","unstructured":"Cottle, R.W., Pang, J.S., Stone, R.E.: The Linear Complementarity Problem. Academic Press Inc., San Diego (1992)"},{"key":"1344_CR3","volume-title":"Finite-Dimensional Variational Inequalities and Complementarity Problems","author":"F Facchinei","year":"2003","unstructured":"Facchinei, F., Pang, J.-S.: Finite-Dimensional Variational Inequalities and Complementarity Problems. Springer, New York (2003)"},{"key":"1344_CR4","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"},{"key":"1344_CR5","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, Berlin (1991)","DOI":"10.1007\/3-540-54509-3"},{"key":"1344_CR6","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":"1","key":"1344_CR7","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":"1","key":"1344_CR8","first-page":"19","volume":"4","author":"YQ Bai","year":"2008","unstructured":"Bai, Y.Q., Lesaja, G., Roos, C.: A new class of polynomial interior-point algorithms for \n                    \n                      \n                    \n                    $$P_*(\\kappa )$$\n                    \n                      \n                        \n                          \n                            P\n                            \n                              \n                              \u2217\n                            \n                          \n                          \n                            (\n                            \u03ba\n                            )\n                          \n                        \n                      \n                    \n                  -linear complementary problems. Pac. J. Optim. 4(1), 19\u201341 (2008)","journal-title":"Pac. J. Optim."},{"key":"1344_CR9","first-page":"1169","volume":"182","author":"GM Cho","year":"2006","unstructured":"Cho, G.M., Kim, M.K.: A new large-update interior-point algorithm for \n                    \n                      \n                    \n                    $$P_*(\\kappa )$$\n                    \n                      \n                        \n                          \n                            P\n                            \n                              \n                              \u2217\n                            \n                          \n                          \n                            (\n                            \u03ba\n                            )\n                          \n                        \n                      \n                    \n                  -LCPs based on kernel functions. Appl. Math. Comput. 182, 1169\u20131183 (2006)","journal-title":"Appl. Math. Comput."},{"issue":"2","key":"1344_CR10","first-page":"171","volume":"5","author":"S Fathi-Hafshejani","year":"2017","unstructured":"Fathi-Hafshejani, S., Mansouri, H., Peyghami, M.R.: An interior-point algorithm for \n                    \n                      \n                    \n                    $$P_*(\\kappa )$$\n                    \n                      \n                        \n                          \n                            P\n                            \n                              \n                              \u2217\n                            \n                          \n                          \n                            (\n                            \u03ba\n                            )\n                          \n                        \n                      \n                    \n                  -linear complementarity problem based on a new trigonometric kernel function. J. Math. Model. 5(2), 171\u2013197 (2017)","journal-title":"J. Math. Model."},{"key":"1344_CR11","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 \n                    \n                      \n                    \n                    $$P_*(\\kappa )$$\n                    \n                      \n                        \n                          \n                            P\n                            \n                              \n                              \u2217\n                            \n                          \n                          \n                            (\n                            \u03ba\n                            )\n                          \n                        \n                      \n                    \n                  -linear complementarity problems. SIAM J. Optim. 20, 3014\u20133039 (2010)","journal-title":"SIAM J. Optim."},{"issue":"9","key":"1344_CR12","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 \n                    \n                      \n                    \n                    $$P_*(\\kappa )$$\n                    \n                      \n                        \n                          \n                            P\n                            \n                              \n                              \u2217\n                            \n                          \n                          \n                            (\n                            \u03ba\n                            )\n                          \n                        \n                      \n                    \n                  -linear complementarity problem. Acta Math. Sin. (Engl. Ser.) 26(9), 1761\u20131778 (2010)","journal-title":"Acta Math. Sin. (Engl. Ser.)"},{"key":"1344_CR13","doi-asserted-by":"publisher","first-page":"3613","DOI":"10.1016\/j.cam.2011.05.036","volume":"236","author":"M Ghami El","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":"1","key":"1344_CR14","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1080\/02331934.2017.1387258","volume":"67","author":"S Fathi-Hafshejani","year":"2018","unstructured":"Fathi-Hafshejani, S., Fakharzadeh Jahromi, A., Peyghami, M.R.: A unified complexity analysis of interior point methods for semidefinite problems based on trigonometric kernel functions. Optimization 67(1), 113\u2013137 (2018)","journal-title":"Optimization"},{"key":"1344_CR15","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":"1344_CR16","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/s11075-013-9772-1","volume":"67","author":"MR Peyghami","year":"2014","unstructured":"Peyghami, M.R., Fathi-Hafshejani, S.: Complexity analysis of an interior-point algorithm for linear optimization based on a new proximity function. Numer. Algorithms 67, 33\u201348 (2014)","journal-title":"Numer. Algorithms"},{"key":"1344_CR17","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":"1344_CR18","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1016\/j.orl.2016.02.013","volume":"44","author":"MR Peyghami","year":"2016","unstructured":"Peyghami, M.R., Fathi-Hafshejani, S., Chen, S.: A primal-dual interior-point method for semidefinite optimization based on a class of trigonometric barrier functions. Oper. Res. Lett. 44, 319\u2013323 (2016)","journal-title":"Oper. Res. Lett."},{"issue":"2","key":"1344_CR19","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."},{"issue":"3","key":"1344_CR20","doi-asserted-by":"publisher","first-page":"766","DOI":"10.1137\/S1052623401398132","volume":"13","author":"YQ Bai","year":"2003","unstructured":"Bai, Y.Q., El Ghami, M., Roos, C.: A new efficient large-update primal-dual interior-point methods based on a finite barrier. SIAM J. Optim. 13(3), 766\u2013782 (2003)","journal-title":"SIAM J. Optim."},{"key":"1344_CR21","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. Algorithms 62, 289\u2013306 (2013)","journal-title":"Numer. Algorithms"},{"key":"1344_CR22","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1016\/j.cam.2008.05.027","volume":"224","author":"M Ghami El","year":"2009","unstructured":"El Ghami, 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, 500\u2013513 (2009)","journal-title":"J. Comput. Appl. Math."},{"key":"1344_CR23","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":"1344_CR24","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/978-1-4613-9617-8_8","volume-title":"Progress in Mathematical Programming: Interior Point and Related Methods","author":"N Megiddo","year":"1989","unstructured":"Megiddo, N.: Pathways to the optimal set in linear programming. In: Megiddo, N. (ed.) Progress in Mathematical Programming: Interior Point and Related Methods, pp. 131\u2013158. Springer, New York (1989)"},{"key":"1344_CR25","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, New York (2005)"}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10957-018-1344-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-018-1344-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-018-1344-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,15]],"date-time":"2019-07-15T19:12:41Z","timestamp":1563217961000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10957-018-1344-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7,16]]},"references-count":25,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2018,9]]}},"alternative-id":["1344"],"URL":"https:\/\/doi.org\/10.1007\/s10957-018-1344-z","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"value":"0022-3239","type":"print"},{"value":"1573-2878","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,7,16]]},"assertion":[{"value":"15 June 2016","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 July 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 July 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}