{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T06:32:43Z","timestamp":1773815563870,"version":"3.50.1"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2023,4,20]],"date-time":"2023-04-20T00:00:00Z","timestamp":1681948800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,4,20]],"date-time":"2023-04-20T00:00:00Z","timestamp":1681948800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J. Appl. Math. Comput."],"published-print":{"date-parts":[[2023,8]]},"DOI":"10.1007\/s12190-023-01858-8","type":"journal-article","created":{"date-parts":[[2023,4,20]],"date-time":"2023-04-20T18:03:41Z","timestamp":1682013821000},"page":"2935-2953","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A full-Newton step infeasible interior-point algorithm based on a kernel function with a new barrier term"],"prefix":"10.1007","volume":"69","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6942-6331","authenticated-orcid":false,"given":"Safa","family":"Guerdouh","sequence":"first","affiliation":[]},{"given":"Wided","family":"Chikouche","sequence":"additional","affiliation":[]},{"given":"Behrouz","family":"Kheirfam","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,4,20]]},"reference":[{"key":"1858_CR1","first-page":"339","volume-title":"Activity Analysis of Production and Allocation","author":"GB Dantzig","year":"1951","unstructured":"Dantzig, G.B.: Maximization of a linear function of variables subject to linear inequalities. In: Koopmans, T.C. (ed.) Activity Analysis of Production and Allocation, pp. 339\u2013347. Wiley, New York (1951)"},{"key":"1858_CR2","unstructured":"Guerdouh, S., Chikouche, W., Touil, I.: An efficient primal-dual interior point algorithm for linear optimization problems based on a novel parameterized kernel function with a hyperbolic barrier term. halshs-03228790 (2021)"},{"key":"1858_CR3","first-page":"366","volume":"6","author":"LV Kantorovich","year":"1960","unstructured":"Kantorovich, L.V.: Mathematical methods in the organization and planning of production. Publication House of the Leningrad State University, 1939. Transl. Manag. Sci. 6, 366\u2013422 (1960)","journal-title":"Transl. Manag. Sci."},{"key":"1858_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. 4, 373\u2013395 (1984)","DOI":"10.1007\/BF02579150"},{"issue":"4","key":"1858_CR5","doi-asserted-by":"publisher","first-page":"841","DOI":"10.1080\/02331934.2015.1080255","volume":"65","author":"B Kheirfam","year":"2016","unstructured":"Kheirfam, B., Haghighi, M.: A full-Newton step infeasible interior-point method for linear optimization based on a trigonometric kernel function. Optimization 65(4), 841\u2013857 (2016)","journal-title":"Optimization"},{"key":"1858_CR6","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/s11075-019-00802-x","volume":"85","author":"B Kheirfam","year":"2020","unstructured":"Kheirfam, B., Haghighi, M.: A full-Newton step infeasible interior-point method based on a trigonometric kernel function without centering steps. Numer. Algorithms 85, 59\u201375 (2020)","journal-title":"Numer. Algorithms"},{"key":"1858_CR7","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/978-1-4613-9617-8_2","volume-title":"Progress in Math. Program","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 Math. Program, pp. 29\u201347. Springer, New York (1989)"},{"issue":"2","key":"1858_CR8","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/s11075-007-9135-x","volume":"46","author":"Z Liu","year":"2007","unstructured":"Liu, Z., Sun, W.: An infeasible interior-point algorithm with full-Newton step for linear optimization. Numer. Algorithms 46(2), 173\u2013188 (2007)","journal-title":"Numer. Algorithms"},{"key":"1858_CR9","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/s00245-009-9069-x","volume":"60","author":"Z Liu","year":"2009","unstructured":"Liu, Z., Sun, W., Tian, F.: A full-Newton step infeasible interior-point algorithm for linear programming based on a kernel function. Appl. Math. Optim. 60, 237\u2013251 (2009)","journal-title":"Appl. Math. Optim."},{"issue":"1\u20133","key":"1858_CR10","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/BF01588785","volume":"49","author":"IJ Lustig","year":"1990","unstructured":"Lustig, I.J.: Feasibility issues in a primal-dual interior-point method for linear programming. Math. Program. 49(1\u20133), 145\u2013162 (1990)","journal-title":"Math. Program."},{"issue":"3","key":"1858_CR11","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1080\/10556780600816692","volume":"22","author":"H Mansouri","year":"2007","unstructured":"Mansouri, H., Roos, C.: Simplified $${\\cal{O} }(nL)$$ infeasible interior-point algorithm for linear optimization using full-Newton step. Optim. Methods Softw. 22(3), 519\u2013530 (2007)","journal-title":"Optim. Methods Softw."},{"issue":"4","key":"1858_CR12","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1137\/0802028","volume":"2","author":"S Mehrotra","year":"1992","unstructured":"Mehrotra, S.: On the implementation of a primal-dual interior point method. SIAM J. Optim. 2(4), 575\u2013601 (1992)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"1858_CR13","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/BF01587075","volume":"44","author":"RD Monteiro","year":"1989","unstructured":"Monteiro, R.D., Adler, I.: Interior path following primal-dual algorithms. Part I: Linear programming. Math. Program. 44(1), 27\u201341 (1989)","journal-title":"Math. Program."},{"key":"1858_CR14","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/s11590-018-1257-7","volume":"13","author":"M Moslemi","year":"2019","unstructured":"Moslemi, M., Kheirfam, B.: Complexity analysis of infeasible interior-point method for semidefinite optimization based on a new trigonometric kernel function. Optim. Lett. 13, 127\u2013145 (2019)","journal-title":"Optim. Lett."},{"key":"1858_CR15","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1007\/s10589-018-0012-4","volume":"71","author":"PR Rig\u00f3","year":"2018","unstructured":"Rig\u00f3, P.R., Darvay, Z.: Infeasible interior-point method for symmetric optimization using a positive-asymptotic barrier. Comput. Optim. Appl. 71, 483\u2013508 (2018)","journal-title":"Comput. Optim. Appl."},{"issue":"4","key":"1858_CR16","doi-asserted-by":"publisher","first-page":"1110","DOI":"10.1137\/050623917","volume":"16","author":"C Roos","year":"2006","unstructured":"Roos, C.: A full-Newton step $${\\cal{O} }(n)$$ infeasible interior-point algorithm for linear optimization. SIAM J. Optim. 16(4), 1110\u20131136 (2006)","journal-title":"SIAM J. Optim."},{"key":"1858_CR17","volume-title":"Theory and Algorithms for Linear Optimization. An Interior Point Approach","author":"C Roos","year":"1997","unstructured":"Roos, C., Terlaky, T.J., Vial, Ph.: Theory and Algorithms for Linear Optimization. An Interior Point Approach. Wiley, Chichester (1997)"},{"issue":"2","key":"1858_CR18","doi-asserted-by":"publisher","first-page":"466","DOI":"10.1016\/j.ejor.2007.02.008","volume":"186","author":"M Salahi","year":"2008","unstructured":"Salahi, M., Peyghami, M.R., Terlaky, T.: New complexity analysis of IIPMs for linear optimization based on a specific self-regular function. Eur. J. Oper. Res. 186(2), 466\u2013485 (2008)","journal-title":"Eur. J. Oper. Res."},{"key":"1858_CR19","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1007\/s10255-022-1061-0","volume":"38","author":"I Touil","year":"2022","unstructured":"Touil, I., Chikouche, W.: Novel kernel function with a hyperbolic barrier term to primal-dual interior point algorithm for SDP problems. Acta Math. Appl. Sin. Engl. Ser. 38, 44\u201367 (2022)","journal-title":"Acta Math. Appl. Sin. Engl. Ser."},{"issue":"12","key":"1858_CR20","doi-asserted-by":"publisher","first-page":"3957","DOI":"10.2298\/FIL2012957T","volume":"34","author":"I Touil","year":"2020","unstructured":"Touil, I., Chikouche, W.: Primal-dual interior point methods for semidefinite programming based on a new type of kernel functions. Filomat 34(12), 3957\u20133969 (2020)","journal-title":"Filomat"}],"container-title":["Journal of Applied Mathematics and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12190-023-01858-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12190-023-01858-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12190-023-01858-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,19]],"date-time":"2023-07-19T19:22:42Z","timestamp":1689794562000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12190-023-01858-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,4,20]]},"references-count":20,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2023,8]]}},"alternative-id":["1858"],"URL":"https:\/\/doi.org\/10.1007\/s12190-023-01858-8","relation":{},"ISSN":["1598-5865","1865-2085"],"issn-type":[{"value":"1598-5865","type":"print"},{"value":"1865-2085","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,4,20]]},"assertion":[{"value":"11 November 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 March 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 March 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 April 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"No conflict of interest was reported by the authors.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}