{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T22:15:08Z","timestamp":1759702508259},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2019,12,17]],"date-time":"2019-12-17T00:00:00Z","timestamp":1576540800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,12,17]],"date-time":"2019-12-17T00:00:00Z","timestamp":1576540800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"The manuscript has no funding"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Numer Algor"],"published-print":{"date-parts":[[2020,9]]},"DOI":"10.1007\/s11075-019-00802-x","type":"journal-article","created":{"date-parts":[[2019,12,17]],"date-time":"2019-12-17T10:09:45Z","timestamp":1576577385000},"page":"59-75","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A full-Newton step infeasible interior-point method based on a trigonometric kernel function without centering steps"],"prefix":"10.1007","volume":"85","author":[{"given":"Behrouz","family":"Kheirfam","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Masoumeh","family":"Haghighi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,12,17]]},"reference":[{"key":"802_CR1","first-page":"133","volume":"602-633","author":"M Becker","year":"1978","unstructured":"Becker, M., Strak, E.L.: On a hierarchy of quolynomial inequalities for tan x. Univ. Beograd. Publ. Elektrotehn. Fak. Ser. Mat. Fiz. 602-633, 133\u2013138 (1978)","journal-title":"Univ. Beograd. Publ. Elektrotehn. Fak. Ser. Mat. Fiz."},{"key":"802_CR2","doi-asserted-by":"crossref","unstructured":"Browne, S., Dongarra, J., Grosse, E., Rowan, T.: The netlib mathematical software repository, Corporation for National Reasrch Initiatives (1995)","DOI":"10.1045\/september95-browne"},{"issue":"15","key":"802_CR3","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., Bouali, S., Steihaug, T.: Interior-point methods for linear optimization based on a kernel function with trigonmetric barrier term. J. Comput. Appl. Math. 236(15), 3613\u20133623 (2012)","journal-title":"J. Comput. Appl. Math."},{"issue":"4","key":"802_CR4","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1007\/s10852-013-9240-x","volume":"13","author":"B Kheirfam","year":"2014","unstructured":"Kheirfam, B.: A generic interior-point algorithm for monotone symmetric cone linear complementarity problems based on a new kernel function. J. Math. Model. Algorithms Oper. Res. 13(4), 471\u2013491 (2014)","journal-title":"J. Math. Model. Algorithms Oper. Res."},{"issue":"3","key":"802_CR5","doi-asserted-by":"publisher","first-page":"853","DOI":"10.1007\/s10957-013-0457-7","volume":"161","author":"B Kheirfam","year":"2014","unstructured":"Kheirfam, B.: A new complexity analysis for full-Newton step infeasible interior-point algorithm for p\u2217(\u03ba)-horizontal linear complementarity problems. J. Optim. Theory Appl. 161(3), 853\u2013869 (2014)","journal-title":"J. Optim. Theory Appl."},{"issue":"4","key":"802_CR6","doi-asserted-by":"crossref","first-page":"601","DOI":"10.3934\/naco.2013.3.601","volume":"3","author":"B Kheirfam","year":"2013","unstructured":"Kheirfam, B.: A full Nesterov-Todd step infeasible interior-point algorithm for symmetric optimization based on a specific kernel function. NACO 3(4), 601\u2013614 (2013)","journal-title":"NACO"},{"issue":"1","key":"802_CR7","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/s10479-013-1474-5","volume":"211","author":"B Kheirfam","year":"2013","unstructured":"Kheirfam, B.: A new infeasible interior-point method based on Darvay\u2019s technique for symmetric optimization. Ann. Oper. Res. 211(1), 209\u2013224 (2013)","journal-title":"Ann. Oper. Res."},{"issue":"4","key":"802_CR8","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(4), 659\u2013680 (2012)","journal-title":"Numer. Algorithms"},{"issue":"3","key":"802_CR9","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1007\/s11075-015-0005-7","volume":"71","author":"B Kheirfam","year":"2016","unstructured":"Kheirfam, B.: An improved full-Newton step O(n) infeasible interior-point method for horizontal linear complementarity problem. Numer. Algorithms 71(3), 491\u2013503 (2016)","journal-title":"Numer. Algorithms"},{"issue":"3","key":"802_CR10","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1007\/s11590-015-0884-5","volume":"10","author":"B Kheirfam","year":"2016","unstructured":"Kheirfam, B.: A full step infeasible interior-point method for Cartesian p\u2217(\u03ba)-SCLCP. Optim Lett. 10(3), 591\u2013603 (2016)","journal-title":"Optim Lett."},{"issue":"2","key":"802_CR11","doi-asserted-by":"publisher","first-page":"1650059","DOI":"10.1142\/S1793557116500595","volume":"9","author":"B Kheirfam","year":"2016","unstructured":"Kheirfam, B.: An improved and modified infeasible interior-point method for symmetric optimization. Asian-Eur. J. Math. 9(2), 1650059 (2016). (13 pages)","journal-title":"Asian-Eur. J. Math."},{"issue":"1","key":"802_CR12","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/s11075-016-0140-9","volume":"74","author":"B Kheirfam","year":"2017","unstructured":"Kheirfam, B.: An infeasible full-NT step interior point algorithm for CQSCO. Numer. Algorithms 74(1), 93\u2013109 (2017)","journal-title":"Numer. Algorithms"},{"issue":"4","key":"802_CR13","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"},{"issue":"3","key":"802_CR14","first-page":"541","volume":"40","author":"B Kheirfam","year":"2014","unstructured":"Kheirfam, B., Mahdavi-Amiri, N.: A full Nesterov-Todd step infeasible interior-point algorithm for symmetric cone linear complementarity problem. Bull. Iranian Math. Soc. 40(3), 541\u2013564 (2014)","journal-title":"Bull. Iranian Math. Soc."},{"issue":"2","key":"802_CR15","doi-asserted-by":"publisher","first-page":"233","DOI":"10.2298\/YJOR120904006K","volume":"25","author":"B Kheirfam","year":"2015","unstructured":"Kheirfam, B., Moslemi, M.: A polynomial-time algorithm for linear optimization based on a new kernel function with trigonometric barrier term. Yugosl. J. Oper. Res. 25(2), 233\u2013250 (2015)","journal-title":"Yugosl. J. Oper. Res."},{"key":"802_CR16","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/BF01582151","volume":"61","author":"M Kojima","year":"1993","unstructured":"Kojima, M., Megiddo, N., Mizuno, S.: A primal-dual infeasible-interior-point algorithm for linear programming. Math. Program. 61, 263\u2013280 (1993)","journal-title":"Math. Program."},{"key":"802_CR17","volume-title":"A primal-dual interior-point algorithm for linear programming, Progress in Mathematical Programming (Pacific Grove, CA, 1987), pp. 29\u201347","author":"M Kojima","year":"1989","unstructured":"Kojima, M., Mizuno, S., Yoshise, A.: A primal-dual interior-point algorithm for linear programming, Progress in Mathematical Programming (Pacific Grove, CA, 1987), pp. 29\u201347. Springer, New York (1989a)"},{"issue":"5","key":"802_CR18","doi-asserted-by":"publisher","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":"802_CR19","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., full-Newton step, A: O(n) infeasible interior-point algorithm for linear programming based on kernel function. Appl. Math. Optim. 60, 237\u2013251 (2009)","journal-title":"Appl. Math. Optim."},{"issue":"1-3","key":"802_CR20","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/BF01588785","volume":"49","author":"IJ Lustig","year":"1991","unstructured":"Lustig, I.J.: Feasibility issues in a primal-dual interior-point method for linear programming. Math. Program. 49(1-3), 145\u2013162 (1991)","journal-title":"Math. Program."},{"key":"802_CR21","volume-title":"Pathways to the optimal set in linear programming, progress in mathematical programming (Pacific Grove, CA. 1987) pp. 131\u2013158","author":"S Megiddo","year":"1989","unstructured":"Megiddo, S.: Pathways to the optimal set in linear programming, progress in mathematical programming (Pacific Grove, CA. 1987) pp. 131\u2013158. Springer, New York (1989)"},{"key":"802_CR22","first-page":"243","volume":"13","author":"F Qi","year":"2006","unstructured":"Qi, F.: Jordan\u2019s inequality: refinements, generalizations, applications and related problems. RGMIA Res. Rep. Coll. 2006;9:12 (16p) (electronic). Budengshi Yanjiu Tongxun (Communications in Studies on Inequalities) 13, 243\u2013259 (2006)","journal-title":"Budengshi Yanjiu Tongxun (Communications in Studies on Inequalities)"},{"issue":"4","key":"802_CR23","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 O(n) infeasible interior- point algorithm for linear optimization. SIAM J. Optim. 16(4), 1110\u20131136 (2006)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"802_CR24","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1137\/140975462","volume":"25","author":"C Roos","year":"2015","unstructured":"Roos, C.: An improved and simplified full-Newton step O(n) infeasible interior-point method for linear optimization. SIAM J. Optim. 25(1), 102\u2013114 (2015)","journal-title":"SIAM J. Optim."},{"key":"802_CR25","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":"802_CR26","volume-title":"Interior point algorithms. Wiley-Interscience Series in Discrete Mathematics and Optimization","author":"Y Ye","year":"1997","unstructured":"Ye, Y.: Interior point algorithms. Wiley-Interscience Series in Discrete Mathematics and Optimization. Wiley, New York (1997). Theory and analysis, A Wiley-Interscience Publication"},{"issue":"2","key":"802_CR27","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1080\/02331934.2011.571257","volume":"62","author":"L Zhang","year":"2013","unstructured":"Zhang, L., Sun, L., Xu, Y.: Simplified analysis for full-Newton step infeasible interior-point algorithm for semidefinite programming. Optimization 62(2), 169\u2013191 (2013)","journal-title":"Optimization"}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-019-00802-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11075-019-00802-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-019-00802-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,8]],"date-time":"2022-10-08T17:47:09Z","timestamp":1665251229000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11075-019-00802-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,12,17]]},"references-count":27,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020,9]]}},"alternative-id":["802"],"URL":"https:\/\/doi.org\/10.1007\/s11075-019-00802-x","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"value":"1017-1398","type":"print"},{"value":"1572-9265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,12,17]]},"assertion":[{"value":"24 December 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 September 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 December 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}