{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T17:24:11Z","timestamp":1761845051107,"version":"3.37.3"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2019,8,24]],"date-time":"2019-08-24T00:00:00Z","timestamp":1566604800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,8,24]],"date-time":"2019-08-24T00:00:00Z","timestamp":1566604800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Romanian Ministry of Research and Innovation, CNCS - UEFISCDI","award":["PN-III-P4-ID-PCE-2016-0190"],"award-info":[{"award-number":["PN-III-P4-ID-PCE-2016-0190"]}]},{"name":"Hungarian Research Fund, OTKA","award":["NKFIH 125700"],"award-info":[{"award-number":["NKFIH 125700"]}]},{"name":"Higher Education Excellence Program of the Ministry of Human Capacities in the frame of Artificial Intelligence research area of Budapest University of Technology and Economics","award":["BME FIKP-MI\/FM"],"award-info":[{"award-number":["BME FIKP-MI\/FM"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2020,10]]},"DOI":"10.1007\/s11590-019-01468-z","type":"journal-article","created":{"date-parts":[[2019,8,24]],"date-time":"2019-08-24T07:02:22Z","timestamp":1566630142000},"page":"1747-1763","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["A new wide neighborhood primal-dual second-order corrector algorithm for linear optimization"],"prefix":"10.1007","volume":"14","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1094-9837","authenticated-orcid":false,"given":"Zsolt","family":"Darvay","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Behrouz","family":"Kheirfam","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Petra Ren\u00e1ta","family":"Rig\u00f3","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,8,24]]},"reference":[{"issue":"2","key":"1468_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":"1468_CR2","first-page":"51","volume":"5","author":"Zs Darvay","year":"2003","unstructured":"Darvay, Zs: New interior point algorithms in linear programming. Adv. Model. Optim. 5(1), 51\u201392 (2003)","journal-title":"Adv. Model. Optim."},{"issue":"3","key":"1468_CR3","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1007\/s10100-018-0524-0","volume":"26","author":"Zs Darvay","year":"2018","unstructured":"Darvay, Zs, Tak\u00e1cs, P.R.: Large-step interior-point algorithm for linear optimization based on a new wide neighborhood. Cent. Eur. J. Oper. Res. 26(3), 551\u2013563 (2018). https:\/\/doi.org\/10.1007\/s10100-018-0524-0","journal-title":"Cent. Eur. J. Oper. Res."},{"key":"1468_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/b105286","volume-title":"Aspects of Semidefinite Programming. Applied Optimization","author":"E De Klerk","year":"2002","unstructured":"De Klerk, E.: Aspects of Semidefinite Programming. Applied Optimization, vol. 65. Kluwer Academic, Dordrecht (2002)"},{"issue":"4","key":"1468_CR5","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1080\/01630563.2011.652269","volume":"33","author":"Z Feng","year":"2012","unstructured":"Feng, Z.: A new $$\\cal{O}(\\sqrt{n}L)$$ iteration large-update primal-dual interior-point method for second-order cone programming. Numer. Funct. Anal. Optim. 33(4), 397\u2013414 (2012)","journal-title":"Numer. Funct. Anal. Optim."},{"key":"1468_CR6","first-page":"10","volume":"13","author":"D Gay","year":"1985","unstructured":"Gay, D.: Electronic mail distribution of linear programming test problems. COAL Newslett. 13, 10\u201312 (1985)","journal-title":"COAL Newslett."},{"key":"1468_CR7","doi-asserted-by":"publisher","first-page":"375","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, 375\u2013395 (1984)","journal-title":"Combinatorica"},{"issue":"1","key":"1468_CR8","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\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":"1468_CR9","first-page":"1","volume":"6","author":"B Kheirfam","year":"2015","unstructured":"Kheirfam, B., Chitsaz, M.: Corrector\u2013predictor arc-search interior-point algorithm for $$P_*(\\kappa )$$-LCP acting in a wide neighborhood of the central path. Iran. J. Oper. Res. 6(2), 1\u201318 (2015)","journal-title":"Iran. J. Oper. Res."},{"issue":"20","key":"1468_CR10","doi-asserted-by":"publisher","first-page":"6379","DOI":"10.2298\/FIL1720379K","volume":"31","author":"B Kheirfam","year":"2017","unstructured":"Kheirfam, B., Chitsaz, M.: A new second-order corrector interior-point algorithm for $$P_*(\\kappa )$$-LCP. Filomat 31(20), 6379\u20136391 (2017)","journal-title":"Filomat"},{"issue":"4","key":"1468_CR11","doi-asserted-by":"publisher","first-page":"327","DOI":"10.3233\/FI-2017-1543","volume":"153","author":"B Kheirfam","year":"2017","unstructured":"Kheirfam, B., Mohamadi-Sangachin, M.: 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."},{"key":"1468_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-54509-3","volume-title":"A Unified Approach to Interior Point Algorithms for Linear Complementarity Problems","author":"M Kojima","year":"1991","unstructured":"Kojima, M., Megiddo, N., Noma, T., Yoshise, A.: A Unified Approach to Interior Point Algorithms for Linear Complementarity Problems. Lecture Notes in Computer Science, vol. 538. Springer, Berlin (1991)"},{"key":"1468_CR13","doi-asserted-by":"publisher","first-page":"2853","DOI":"10.1137\/080729311","volume":"8","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\\left(\\sqrt{n}\\log \\left(\\frac{{\\rm Tr}(X^0S^0)}{\\epsilon }\\right)\\right)$$ iteration complexity. SIAM J. Optim. 8, 2853\u20132875 (2010)","journal-title":"SIAM J. Optim."},{"key":"1468_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":"1468_CR15","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/s00186-012-0379-4","volume":"75","author":"C Liu","year":"2012","unstructured":"Liu, C., Liu, H.: A new second-order corrector interior-point algorithm for semidefinite programming. Math. Methods Oper. Res. 75, 165\u2013183 (2012)","journal-title":"Math. Methods Oper. Res."},{"key":"1468_CR16","series-title":"SIAM Studies in Applied Mathematics","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611970791","volume-title":"Interior Point Polynomial Methods in Convex Programming: Theory and Algorithms","author":"YE Nesterov","year":"1994","unstructured":"Nesterov, Y.E., Nemirovskii, A.S.: Interior Point Polynomial Methods in Convex Programming: Theory and Algorithms. SIAM Studies in Applied Mathematics, vol. 13. SIAM Publications, Philadelphia (1994)"},{"key":"1468_CR17","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)"},{"issue":"1","key":"1468_CR18","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":"1468_CR19","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/s10107-003-0472-9","volume":"100","author":"FA Potra","year":"2004","unstructured":"Potra, F.A.: A superlinearly convergent predictor\u2013corrector method for degenerate LCP in a wide neighborhood of the central path with $$\\cal{O}(\\sqrt{n}L)$$-iteration complexity. Math. Program. 100, 317\u2013337 (2004)","journal-title":"Math. Program."},{"key":"1468_CR20","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":"1468_CR21","doi-asserted-by":"crossref","unstructured":"Sonnevend, Gy.: An \u201danalytic center\u201d for polyhedrons and new classes of global algorithms for linear (smooth, convex) programming. In: Pr\u00e9kopa, A., Szelezs\u00e1n, J., Strazicky, B. (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, pp. 866-876. Springer, Berlin (1986)","DOI":"10.1007\/BFb0043914"},{"issue":"1","key":"1468_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0377-2217(00)00094-1","volume":"130","author":"T Terlaky","year":"2001","unstructured":"Terlaky, T.: An easy way to teach interior-point methods. Eur. J. Oper. Res. 130(1), 1\u201319 (2001)","journal-title":"Eur. J. Oper. Res."},{"key":"1468_CR23","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-4381-7","volume-title":"Handbook of Semidefinite Programming, Theory, Algorithm, and Applications","author":"H Wolkowicz","year":"2000","unstructured":"Wolkowicz, H., Saigal, R., Vandenberghe, L.: Handbook of Semidefinite Programming, Theory, Algorithm, and Applications. Kluwer Academic Publishers, Dordrecht (2000)"},{"key":"1468_CR24","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)"},{"key":"1468_CR25","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, Chichester (1997)"},{"key":"1468_CR26","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1287\/moor.19.1.53","volume":"19","author":"Y Ye","year":"1994","unstructured":"Ye, Y., Todd, M., Mizuno, S.: An $$O(\\sqrt{n}L)$$-iteration homogeneous and self-dual linear programming algorithm. Math. Oper. Res. 19, 53\u201367 (1994)","journal-title":"Math. Oper. Res."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-019-01468-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-019-01468-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-019-01468-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,26]],"date-time":"2022-09-26T09:03:18Z","timestamp":1664182998000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-019-01468-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,8,24]]},"references-count":26,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2020,10]]}},"alternative-id":["1468"],"URL":"https:\/\/doi.org\/10.1007\/s11590-019-01468-z","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"type":"print","value":"1862-4472"},{"type":"electronic","value":"1862-4480"}],"subject":[],"published":{"date-parts":[[2019,8,24]]},"assertion":[{"value":"22 May 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 August 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 August 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}