{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,2,19]],"date-time":"2024-02-19T17:07:44Z","timestamp":1708362464995},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2018,11,26]],"date-time":"2018-11-26T00:00:00Z","timestamp":1543190400000},"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":["Period Math Hung"],"published-print":{"date-parts":[[2019,9]]},"DOI":"10.1007\/s10998-018-00271-0","type":"journal-article","created":{"date-parts":[[2018,11,26]],"date-time":"2018-11-26T10:09:35Z","timestamp":1543226975000},"page":"94-105","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["A wide neighborhood interior-point algorithm for linear optimization based on a specific kernel function"],"prefix":"10.1007","volume":"79","author":[{"given":"Behrouz","family":"Kheirfam","sequence":"first","affiliation":[]},{"given":"Masoumeh","family":"Haghighi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,11,26]]},"reference":[{"key":"271_CR1","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1137\/040604492","volume":"16","author":"W Ai","year":"2005","unstructured":"W. Ai, S. Zhang, An $$O(\\sqrt{n}L)$$ O ( n L ) iteration primal-dual path-following method, based on wide neighborhoods and large updates, for monotone LCP. SIAM J. Optim. 16, 400\u2013417 (2005)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"271_CR2","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1137\/S1052623403423114","volume":"15","author":"YQ Bai","year":"2004","unstructured":"Y.Q. Bai, M. El Ghami, C. Roos, 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."},{"issue":"3","key":"271_CR3","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1007\/s10100-018-0524-0","volume":"26","author":"Z Darvay","year":"2018","unstructured":"Z. Darvay, P.R. Tak\u00e1cs, Large-step interior-point algorithm for linear optimization based on a new wide neighborhood. Cent. Eur. J. Oper. Res. 26(3), 551\u2013563 (2018)","journal-title":"Cent. Eur. J. Oper. Res."},{"key":"271_CR4","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/j.cam.2013.07.011","volume":"256","author":"Z Feng","year":"2014","unstructured":"Z. Feng, L. Fang, A new $$O(\\sqrt{n}L)$$ O ( n L ) -iteration predictor\u2013corrector algorithm with wide neighborhood for semidefinite programming. J. Comput. Appl. Math. 256, 65\u201376 (2014)","journal-title":"J. Comput. Appl. Math."},{"issue":"4","key":"271_CR5","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/BF02579150","volume":"4","author":"NK Karmarkar","year":"1984","unstructured":"N.K. Karmarkar, A new polynomial-time algorithm for linear programming. Combinatorica 4(4), 373\u2013395 (1984)","journal-title":"Combinatorica"},{"issue":"1","key":"271_CR6","doi-asserted-by":"publisher","first-page":"33","DOI":"10.3233\/FI-2017-1511","volume":"152","author":"B Kheirfam","year":"2017","unstructured":"B. Kheirfam, A predictor\u2013corrector infeasible-interior-point algorithm for semidefinite optimization in a wide neighborhood. Fundam. Inform. 152(1), 33\u201350 (2017)","journal-title":"Fundam. Inform."},{"issue":"2","key":"271_CR7","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/s10998-017-0231-y","volume":"76","author":"B Kheirfam","year":"2018","unstructured":"B. Kheirfam, M. Chitsaz, Polynomial convergence of two higher order interior-point methods for $$P_*(\\kappa )$$ P \u2217 ( \u03ba ) -LCP in a wide neighborhood of the central path. Period. Math. Hung. 76(2), 243\u2013264 (2018)","journal-title":"Period. Math. Hung."},{"issue":"20","key":"271_CR8","doi-asserted-by":"publisher","first-page":"6379","DOI":"10.2298\/FIL1720379K","volume":"31","author":"B Kheirfam","year":"2017","unstructured":"B. Kheirfam, M. Chitsaz, A new second-order corrector interior-point algorithm for $$P_*(\\kappa )$$ P \u2217 ( \u03ba ) -LCP. Filomat 31(20), 6379\u20136391 (2017)","journal-title":"Filomat"},{"issue":"4","key":"271_CR9","doi-asserted-by":"publisher","first-page":"327","DOI":"10.3233\/FI-2017-1543","volume":"153","author":"B Kheirfam","year":"2017","unstructured":"B. Kheirfam, M. Mohammadi-Sanghachin, A wide neighborhood second-order predictor\u2013corrector interior-point algorithm for semidefinite optimization with modified corrector directions. Fundam. Inform. 153(4), 327\u2013346 (2017)","journal-title":"Fundam. Inform."},{"issue":"6","key":"271_CR10","doi-asserted-by":"publisher","first-page":"2853","DOI":"10.1137\/080729311","volume":"20","author":"Y Li","year":"2010","unstructured":"Y. Li, T. Terlaky, 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 }))$$ O ( n log ( tr ( X 0 S 0 ) \u03f5 ) ) iteration complexity. SIAM J. Optim. 20(6), 2853\u20132875 (2010)","journal-title":"SIAM J. Optim."},{"key":"271_CR11","doi-asserted-by":"publisher","first-page":"729","DOI":"10.1007\/s11590-010-0242-6","volume":"5","author":"C Liu","year":"2011","unstructured":"C. Liu, H.W. Liu, W. Cong, An $$O(\\sqrt{n}L)$$ O ( n L ) iteration primal-dual second-order corrector algorithm for linear programming. Optim. Lett. 5, 729\u2013743 (2011)","journal-title":"Optim. Lett."},{"key":"271_CR12","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":"N. Megiddo, Pathways to the optimal set in linear programming, in Progress in Mathematical Programming, Interior-Point and Related Methods, ed. by N. Megiddo (Springer, New York, 1989), pp. 131\u2013158"},{"key":"271_CR13","volume-title":"Self-Regular Functions: A New Paradigm for Primal-Dual Interior-Point Methods","author":"J Peng","year":"2002","unstructured":"J. Peng, C. Roos, T. Terlaky, Self-Regular Functions: A New Paradigm for Primal-Dual Interior-Point Methods (Princeton University Press, Princeton, 2002)"},{"issue":"1","key":"271_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/120884341","volume":"24","author":"FA Potra","year":"2014","unstructured":"F.A. Potra, 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."},{"issue":"1\u20133","key":"271_CR15","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/BF01580724","volume":"40","author":"J Renegar","year":"1988","unstructured":"J. Renegar, A polynomial-time algorithm, based on Newton\u2019s method, for linear programming. Math. Program. 40(1\u20133), 59\u201393 (1988)","journal-title":"Math. Program."},{"key":"271_CR16","doi-asserted-by":"crossref","unstructured":"Gy. Sonnevend, An \u201danalytic center\u201d for polyhedrons and new classes of global algorithms for linear (smooth, convex) programming, in System Modelling and Optimization: Proceedings of the 12th IFIP-Conference held in Budapest, Hungary, September 1985, vol. 84, Lecture Notes in Control and Information Sciences, ed. by A. Pr\u00e9kopa, J. Szelezs\u00e1n, B. Strazicky (Springer, Berlin, 1986), pp. 866\u2013876","DOI":"10.1007\/BFb0043914"},{"key":"271_CR17","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611971453","volume-title":"Primal-Dual Interior-Point Methods","author":"SJ Wright","year":"1997","unstructured":"S.J. Wright, Primal-Dual Interior-Point Methods (SIAM, Philadelphia, 1997)"},{"issue":"1","key":"271_CR18","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/s12190-015-0900-z","volume":"51","author":"X Yang","year":"2016","unstructured":"X. Yang, Y. Zhang, H. Liu, 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":"271_CR19","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1287\/moor.19.1.53","volume":"19","author":"Y Ye","year":"1994","unstructured":"Y. Ye, M. Todd, S. Mizuno, An $${\\cal{O}}(\\sqrt{n}L)$$ O ( n L ) -iteration homogeneous and self-dual linear programming algorithm. Math. Oper. Res. 19, 53\u201367 (1994)","journal-title":"Math. Oper. Res."}],"container-title":["Periodica Mathematica Hungarica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10998-018-00271-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10998-018-00271-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10998-018-00271-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,6]],"date-time":"2022-09-06T22:15:53Z","timestamp":1662502553000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10998-018-00271-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,11,26]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,9]]}},"alternative-id":["271"],"URL":"https:\/\/doi.org\/10.1007\/s10998-018-00271-0","relation":{},"ISSN":["0031-5303","1588-2829"],"issn-type":[{"value":"0031-5303","type":"print"},{"value":"1588-2829","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,11,26]]},"assertion":[{"value":"26 November 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}