{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,4]],"date-time":"2026-03-04T22:01:10Z","timestamp":1772661670839,"version":"3.50.1"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2017,7,20]],"date-time":"2017-07-20T00:00:00Z","timestamp":1500508800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2018,7]]},"DOI":"10.1007\/s11590-017-1170-5","type":"journal-article","created":{"date-parts":[[2017,7,20]],"date-time":"2017-07-20T12:08:10Z","timestamp":1500552490000},"page":"1079-1097","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":17,"title":["An efficient parameterized logarithmic kernel function for linear optimization"],"prefix":"10.1007","volume":"12","author":[{"given":"Mousaab","family":"Bouafia","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Djamel","family":"Benterki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Adnan","family":"Yassine","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,7,20]]},"reference":[{"key":"1170_CR1","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, vol. 4, pp. 373\u2013395 (1984)","DOI":"10.1145\/800057.808695"},{"key":"1170_CR2","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)"},{"key":"1170_CR3","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":"1170_CR4","doi-asserted-by":"crossref","DOI":"10.1002\/9781118032701","volume-title":"Interior Point Algorithms, Theory and Analysis","author":"Y Ye","year":"1997","unstructured":"Ye, Y.: Interior Point Algorithms, Theory and Analysis. Wiley, Chichester (1997)"},{"key":"1170_CR5","unstructured":"El Ghami, M.: New Primal-Dual Interior-Point Methods Based on Kernel Functions. PhD Thesis, TU Delft, The Netherlands (2005)"},{"key":"1170_CR6","first-page":"61","volume":"6","author":"J Peng","year":"2001","unstructured":"Peng, J., Roos, C., Terlaky, T.: A new and efficient large-update interior point method for linear optimization. J. Comput. Technol. 6, 61\u201380 (2001)","journal-title":"J. Comput. Technol."},{"issue":"1","key":"1170_CR7","doi-asserted-by":"crossref","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."},{"key":"1170_CR8","first-page":"99","volume":"21","author":"M Ghami El","year":"2008","unstructured":"El Ghami, M., Ivanov, I.D., Roos, C., Steihaug, T.: A polynomial-time algorithm for $$\\text{ LO }$$ LO based on generalized logarithmic barrier functions. Int. J. Appl. Math. 21, 99\u2013115 (2008)","journal-title":"Int. J. Appl. Math."},{"key":"1170_CR9","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1007\/s10957-008-9389-z","volume":"138","author":"YQ Bai","year":"2008","unstructured":"Bai, Y.Q., Lesaja, G., Roos, C., Wang, G.Q., El Ghami, M.: A class of large-update and small-update primal-dual interior-point algorithms for linear optimization. J. Optim. Theory Appl. 138, 341\u2013359 (2008)","journal-title":"J. Optim. Theory Appl."},{"key":"1170_CR10","doi-asserted-by":"crossref","first-page":"631","DOI":"10.1080\/10556780310001639735","volume":"18","author":"YQ Bai","year":"2003","unstructured":"Bai, Y.Q., Roos, C.: A polynomial-time algorithm for linear optimization based on a new simple kernel function. Optim. Methods Softw. 18, 631\u2013646 (2003)","journal-title":"Optim. Methods Softw."},{"key":"1170_CR11","doi-asserted-by":"crossref","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., Bouali, 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."},{"key":"1170_CR12","doi-asserted-by":"crossref","first-page":"935","DOI":"10.1051\/ro\/2015056","volume":"50","author":"M Bouafia","year":"2016","unstructured":"Bouafia, M., Benterki, D., Yassine, A.: Complexity analysis of interior point methods for linear programming based on a parameterized kernel function. RAIRO Oper. Res. 50, 935\u2013949 (2016)","journal-title":"RAIRO Oper. Res."},{"key":"1170_CR13","doi-asserted-by":"crossref","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, 528\u2013545 (2016)","journal-title":"J. Optim. Theory Appl."},{"key":"1170_CR14","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1016\/j.cam.2013.04.039","volume":"255","author":"MR Peyghami","year":"2014","unstructured":"Peyghami, M.R., Hafshejani, S.F., 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":"1170_CR15","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/s11075-013-9772-1","volume":"67","author":"MR Peyghami","year":"2014","unstructured":"Peyghami, M.R., Hafshejani, S.F.: Complexity analysis of an interior point algorithm for linear optimization based on a new proximity function. Numer. Algoritm. 67, 33\u201348 (2014)","journal-title":"Numer. Algoritm."},{"key":"1170_CR16","unstructured":"Cai, X.Z., Wang, G.Q., El Ghami, M., Yue, Y.J.: Complexity analysis of primal-dual interior-point methods for linear optimization based on a new parametric Kernel function with a trigonometric barrier term. Abstr. Appl. Anal., pages Art. ID 710158, 11, (2014)"},{"issue":"2","key":"1170_CR17","doi-asserted-by":"crossref","first-page":"233","DOI":"10.2298\/YJOR120904006K","volume":"25","author":"B Kheirfam","year":"2015","unstructured":"Kheirfam, B., Moslem, M.: A polynomial-time algorithm for linear optimization based on a new kernel function with trigonometric barrier term. YUJOR 25(2), 233\u2013250 (2015)","journal-title":"YUJOR"},{"issue":"5","key":"1170_CR18","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1016\/j.orl.2015.06.013","volume":"43","author":"X Li","year":"2015","unstructured":"Li, X., Zhang, M.: Interior-point algorithm for linear optimization based on a new trigonometric kernel function. Oper. Res. Lett 43(5), 471\u2013475 (2015)","journal-title":"Oper. Res. Lett"},{"key":"1170_CR19","unstructured":"Bai, Y. Q., Roos, C.: A primal-dual interior point method based on a new kernel function with linear growth rate. In: Proceedings of the 9th Australian Optimization Day, Perth, Australia (2002)"},{"key":"1170_CR20","doi-asserted-by":"crossref","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":"1170_CR21","doi-asserted-by":"crossref","unstructured":"Sonnevend, G.: An \u201canalytic center\u201d for polyhedrons and new classes of global algorithms for linear (smooth, convex) programming. In: Prekopa, A., Szelezsan, J., Strazicky, B. (eds.) System Modelling and Optimization: Proceedings of the 12th IFIP-Conference, Budapest, Hungary, 1985, Lecture Notes in Control and Inform. Sci, vol. 84, pp. 866\u2013876. Springer, Berlin (1986)","DOI":"10.1007\/BFb0043914"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-017-1170-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-017-1170-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-017-1170-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,31]],"date-time":"2022-07-31T06:31:16Z","timestamp":1659249076000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-017-1170-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,7,20]]},"references-count":21,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2018,7]]}},"alternative-id":["1170"],"URL":"https:\/\/doi.org\/10.1007\/s11590-017-1170-5","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,7,20]]}}}