{"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":1772661670458,"version":"3.50.1"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2016,2,24]],"date-time":"2016-02-24T00:00:00Z","timestamp":1456272000000},"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":[[2016,8]]},"DOI":"10.1007\/s10957-016-0895-0","type":"journal-article","created":{"date-parts":[[2016,2,24]],"date-time":"2016-02-24T23:26:56Z","timestamp":1456356416000},"page":"528-545","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":29,"title":["An Efficient Primal\u2013Dual Interior Point Method for Linear Programming Problems Based on a New Kernel Function with a Trigonometric Barrier Term"],"prefix":"10.1007","volume":"170","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":[[2016,2,24]]},"reference":[{"key":"895_CR1","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 LO based on generalized logarithmic barrier functions. Int. J. Appl. Math. 21, 99\u2013115 (2008)","journal-title":"Int. J. Appl. Math."},{"key":"895_CR2","volume-title":"Theory and Algorithms for Linear Optimization, An Interior Point Approach","author":"C Roos","year":"1997","unstructured":"Roos, C., Terlaky, T., Vial, J.Ph: Theory and Algorithms for Linear Optimization, An Interior Point Approach. Wiley, Chichester (1997)"},{"key":"895_CR3","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":"895_CR4","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":"895_CR5","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":"895_CR6","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":"895_CR7","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. Algorithms 67, 33\u201348 (2014)","journal-title":"Numer. Algorithms"},{"key":"895_CR8","doi-asserted-by":"crossref","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., Art. ID 710158, 11 (2014)","DOI":"10.1155\/2014\/710158"},{"key":"895_CR9","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":"895_CR10","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":"895_CR11","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":"895_CR12","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":"895_CR13","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":"895_CR14","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 Information Science, vol. 84, pp. 866\u2013876. Springer, Berlin (1986)","DOI":"10.1007\/BFb0043914"},{"issue":"2","key":"895_CR15","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":"895_CR16","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":"895_CR17","doi-asserted-by":"crossref","first-page":"386","DOI":"10.1016\/j.amc.2011.05.075","volume":"218","author":"GM Cho","year":"2011","unstructured":"Cho, G.M.: An interior point algorithm for linear optimization based on a new barrier function. Appl. Math. Comput. 218, 386\u2013395 (2011)","journal-title":"Appl. Math. Comput."}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-016-0895-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10957-016-0895-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-016-0895-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,5]],"date-time":"2022-06-05T02:34:59Z","timestamp":1654396499000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10957-016-0895-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,2,24]]},"references-count":17,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2016,8]]}},"alternative-id":["895"],"URL":"https:\/\/doi.org\/10.1007\/s10957-016-0895-0","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"value":"0022-3239","type":"print"},{"value":"1573-2878","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,2,24]]}}}