{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,17]],"date-time":"2024-07-17T09:50:21Z","timestamp":1721209821003},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2020,4,18]],"date-time":"2020-04-18T00:00:00Z","timestamp":1587168000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,4,18]],"date-time":"2020-04-18T00:00:00Z","timestamp":1587168000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J. Appl. Math. Comput."],"published-print":{"date-parts":[[2020,10]]},"DOI":"10.1007\/s12190-020-01347-2","type":"journal-article","created":{"date-parts":[[2020,4,18]],"date-time":"2020-04-18T09:02:29Z","timestamp":1587200549000},"page":"119-135","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A wide neighborhood interior-point algorithm based on the trigonometric kernel function"],"prefix":"10.1007","volume":"64","author":[{"given":"B.","family":"Kheirfam","sequence":"first","affiliation":[]},{"given":"M.","family":"Haghighi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,4,18]]},"reference":[{"issue":"2","key":"1347_CR1","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1137\/040604492","volume":"16","author":"W Ai","year":"2005","unstructured":"Ai, W., Zhang, S.: An $$O(\\sqrt{n}L)$$ iteration primal-dual path-following method, based on wide neighborhoods and large updates, for monotone LCP. SIAM J. Optim. 16(2), 400\u2013417 (2005)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"1347_CR2","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."},{"key":"1347_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., 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."},{"key":"1347_CR4","doi-asserted-by":"publisher","first-page":"1235","DOI":"10.1080\/02331930903104382","volume":"59","author":"Z Feng","year":"2010","unstructured":"Feng, Z., Fang, L.: A wide neighborhood interior-point method with $$O(\\sqrt{n}L)$$ iteration-complexity bound for semidefinite programming. Optimization 59, 1235\u20131246 (2010)","journal-title":"Optimization"},{"key":"1347_CR5","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/j.cam.2013.07.011","volume":"256","author":"Z Feng","year":"2014","unstructured":"Feng, Z., Fang, L.: A new $$O(\\sqrt{n}L)$$-iteration predictor-corrector algorithm with wide neighborhood for semidefinite programming. J. Comput. Appl. Math. 256, 65\u201376 (2014)","journal-title":"J. Comput. Appl. Math."},{"issue":"4","key":"1347_CR6","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/BF02579150","volume":"4","author":"NK Karmarkar","year":"1984","unstructured":"Karmarkar, N.K.: A new polynomial-time algorithm for linear programming. Combinatorica 4(4), 373\u2013395 (1984)","journal-title":"Combinatorica"},{"issue":"1","key":"1347_CR7","first-page":"51","volume":"3","author":"B Kheirfam","year":"2018","unstructured":"Kheirfam, B., Haghighi, M.: An infeasible interior-point method for the $$P_*$$-matrix linear complementarity problem based on a trigonometric kernel function with full-Newton step. Commun. Comb. Optim. 3(1), 51\u201370 (2018)","journal-title":"Commun. Comb. Optim."},{"issue":"1","key":"1347_CR8","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1007\/s10998-018-00271-0","volume":"79","author":"B Kheirfam","year":"2019","unstructured":"Kheirfam, B., Haghighi, M.: A wide neighborhood interior-point algorithm for linear optimization based on a specific kernel function. Period. Math. Hung. 79(1), 94\u2013105 (2019)","journal-title":"Period. Math. Hung."},{"issue":"4","key":"1347_CR9","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":"1","key":"1347_CR10","doi-asserted-by":"publisher","first-page":"33","DOI":"10.3233\/FI-2017-1511","volume":"152","author":"B Kheirfam","year":"2017","unstructured":"Kheirfam, B.: A predictor-corrector infeasible-interior-point algorithm for semidefinite optimization in a wide neighborhood. Fundam. Inform. 152(1), 33\u201350 (2017)","journal-title":"Fundam. Inform."},{"key":"1347_CR11","volume-title":"Progress in Mathematical Programming: Interior Point and Related Methods","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 Mathematical Programming: Interior Point and Related Methods. Springer, New York (1989)"},{"key":"1347_CR12","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/BF01594942","volume":"50","author":"M Kojima","year":"1991","unstructured":"Kojima, M., Mizuno, S., Yoshise, A.: An $$O(\\sqrt{n}L)$$ iteration potential reduction algorithm for linear complementarity problems. Math. Program. 50, 331\u2013342 (1991)","journal-title":"Math. Program."},{"issue":"6","key":"1347_CR13","doi-asserted-by":"publisher","first-page":"2853","DOI":"10.1137\/080729311","volume":"20","author":"Y Li","year":"2010","unstructured":"Li, Y., Terlaky, T.: A new class of large neighborhood path-following interior point algorithms for semidefinite optimization with $$O(\\sqrt{n}\\log (\\frac{{\\rm tr}(X^0S^0)}{\\epsilon }))$$ iteration complexity. SIAM J. Optim. 20(6), 2853\u20132875 (2010)","journal-title":"SIAM J. Optim."},{"key":"1347_CR14","doi-asserted-by":"publisher","first-page":"729","DOI":"10.1007\/s11590-010-0242-6","volume":"5","author":"C Liu","year":"2011","unstructured":"Liu, C., Liu, H.W., Cong, W.: An $$O(\\sqrt{n}L)$$ iteration primal-dual second-order corrector algorithm for linear programming. Optim. Lett. 5, 729\u2013743 (2011)","journal-title":"Optim. Lett."},{"key":"1347_CR15","series-title":"Interior-Point and Related Methods","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/978-1-4613-9617-8_8","volume-title":"Progress in Mathematical Programming","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":"1347_CR16","volume-title":"Self-regular Functions: A New Paradigm for Primal-Dual Interior-Point Methods","author":"J Peng","year":"2002","unstructured":"Peng, J., Roos, C., Terlaky, T.: Self-regular Functions: A New Paradigm for Primal-Dual Interior-Point Methods. Princeton University Press, Princeton (2002)"},{"issue":"1","key":"1347_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/120884341","volume":"24","author":"FA Potra","year":"2014","unstructured":"Potra, F.A.: Interior point methods for sufficient horizontal LCP in a wide neighborhood of the central path with best known iteration complexity. SIAM J. Optim. 24(1), 1\u201328 (2014)","journal-title":"SIAM J. Optim."},{"key":"1347_CR18","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":"1347_CR19","doi-asserted-by":"crossref","unstructured":"Sonnevend, G.: An \u201dAnalytic Center\u201d for Polyhedrons and New Classes of Global Algorithms for Linear (Smooth, Convex) Programming, In: A. Pr\u00e9kopa, J. Szelezs\u00e1n, B. Strazicky (eds), System Modelling and Optimization: Proceedings of the 12th IFIP-Conference held in Budapest, Hungary, September 1985, Lecture Notes in Control and Information Sciences, vol. 84, Springer, Berlin, West-Germany, pp. 866\u2013876 (1986)","DOI":"10.1007\/BFb0043914"},{"key":"1347_CR20","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611971453","volume-title":"Primal-Dual Interior-Point Methods","author":"SJ Wright","year":"1997","unstructured":"Wright, S.J.: Primal-Dual Interior-Point Methods. SIAM, Philadelphia (1997)"},{"issue":"1","key":"1347_CR21","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/s12190-015-0900-z","volume":"51","author":"X Yang","year":"2016","unstructured":"Yang, X., Zhang, Y., Liu, H.: A wide neighborhood infeasible-interior-point method with arc-search for linear programming. J. Appl. Math. Comput. 51(1), 209\u2013225 (2016)","journal-title":"J. Appl. Math. Comput."},{"key":"1347_CR22","series-title":"Wiley-Interscience Series in Discrete Mathematics and Optimization","doi-asserted-by":"publisher","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-Interscience Series in Discrete Mathematics and Optimization. Wiley, New York (1997)"}],"container-title":["Journal of Applied Mathematics and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12190-020-01347-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12190-020-01347-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12190-020-01347-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,21]],"date-time":"2022-10-21T17:59:07Z","timestamp":1666375147000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12190-020-01347-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,4,18]]},"references-count":22,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2020,10]]}},"alternative-id":["1347"],"URL":"https:\/\/doi.org\/10.1007\/s12190-020-01347-2","relation":{},"ISSN":["1598-5865","1865-2085"],"issn-type":[{"value":"1598-5865","type":"print"},{"value":"1865-2085","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,4,18]]},"assertion":[{"value":"4 February 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 April 2020","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}