{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T22:10:39Z","timestamp":1648937439948},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2020,4,4]],"date-time":"2020-04-04T00:00:00Z","timestamp":1585958400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,4,4]],"date-time":"2020-04-04T00:00:00Z","timestamp":1585958400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2020,11]]},"DOI":"10.1007\/s11590-020-01573-4","type":"journal-article","created":{"date-parts":[[2020,4,4]],"date-time":"2020-04-04T16:02:26Z","timestamp":1586016146000},"page":"2549-2563","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A wide neighborhood predictor-infeasible corrector interior-point algorithm for linear optimization"],"prefix":"10.1007","volume":"14","author":[{"given":"B.","family":"Kheirfam","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Nasrollahi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,4,4]]},"reference":[{"issue":"2","key":"1573_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. SAIM J. Optim. 16(2), 400\u2013417 (2005)","journal-title":"SAIM J. Optim."},{"issue":"3","key":"1573_CR2","doi-asserted-by":"publisher","first-page":"811","DOI":"10.1007\/s10957-018-1402-6","volume":"180","author":"S Asadi","year":"2019","unstructured":"Asadi, S., Mansouri, H., Darvay, Zs, Zangiabadi, M., Mahdavi-Amiri, N.: Large-neighborhood infeasible predictor-corrector algorithm for horizontal linear complementarity problems over Cartesian product of symmetric cones. J. Optim. Theory Appl. 180(3), 811\u2013829 (2019)","journal-title":"J. Optim. Theory Appl."},{"key":"1573_CR3","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1080\/01630563.2011.652269","volume":"33","author":"ZZ Feng","year":"2012","unstructured":"Feng, Z.Z.: A new $$O(\\sqrt{n}L)$$ iteration large update primal-dual interior-point method for second-order cone programming. Numer. Funct. Anal. Optim. 33, 397\u2013414 (2012)","journal-title":"Numer. Funct. Anal. Optim."},{"key":"1573_CR4","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":"1","key":"1573_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02191759","volume":"83","author":"B Jansen","year":"1994","unstructured":"Jansen, B., Roos, C., Terlaky, T., Vial, J.-P.: Primal-dual algorithms for linear programming based on the logarithmic barrier method. J. Optim. Theory Appl. 83(1), 1\u201326 (1994)","journal-title":"J. Optim. Theory Appl."},{"key":"1573_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, 373\u2013395 (1984)","journal-title":"Combinatorica"},{"issue":"2","key":"1573_CR7","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/s10998-017-0231-y","volume":"76","author":"B Kheirfam","year":"2018","unstructured":"Kheirfam, B., Chitsaz, M.: Polynomial convergence of two higher order interior-point methods for $$P_*(\\kappa )$$-LCP in a wide neighborhood of the central path. Period. Math. Hung. 76(2), 243\u2013264 (2018)","journal-title":"Period. Math. Hung."},{"issue":"1","key":"1573_CR8","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1007\/s10998-018-00271-0","volume":"97","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. 97(1), 94\u2013105 (2019)","journal-title":"Period. Math. Hung."},{"key":"1573_CR9","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. Inf. 152, 33\u201350 (2017)","journal-title":"Fundam. Inf."},{"issue":"12","key":"1573_CR10","doi-asserted-by":"publisher","first-page":"2271","DOI":"10.1080\/00207160.2017.1283020","volume":"94","author":"B Kheirfam","year":"2017","unstructured":"Kheirfam, B.: An arc-search infeasible interior point algorithm for HLCP in the $${\\cal{N}}^-_{\\infty }$$ neighborhood of the central path. Int. J. Comput. Math. 94(12), 2271\u20132282 (2017)","journal-title":"Int. J. Comput. Math."},{"key":"1573_CR11","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 $${\\cal{O}}\\big (\\sqrt{n}\\log (\\frac{tr(X^{0}S^{0})}{\\varepsilon })\\big )$$ iteration complexity. SIAM J. Optim. 8, 2853\u20132875 (2010)","journal-title":"SIAM J. Optim."},{"key":"1573_CR12","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/s40305-017-0172-4","volume":"5","author":"CH Liu","year":"2017","unstructured":"Liu, C.H., Huang, Y.Y., Shang, Y.L.: Polynomial convergence of primal-dual path-following algorithms for symmetric cone programming based on wide neighborhoods and a new class of directions. J. Oer. Res. Soc. China 5, 333\u2013346 (2017)","journal-title":"J. Oer. Res. Soc. China"},{"key":"1573_CR13","doi-asserted-by":"publisher","first-page":"796","DOI":"10.1007\/s10957-013-0303-y","volume":"158","author":"H Liu","year":"2013","unstructured":"Liu, H., Yang, X., Liu, C.: A new wide neighborhood primal-dual infeasible-interior-point method for symmetric cone programming. J. Optim. Theory Appl. 158, 796\u2013815 (2013)","journal-title":"J. Optim. Theory Appl."},{"key":"1573_CR14","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/s40305-016-0118-2","volume":"4","author":"CH Liu","year":"2016","unstructured":"Liu, C.H., Wu, D., Shang, Y.L.: A new infeasible-interior-point algorithm based on wide neighborhoods for symmetric cone programming. J. Oper. Res. Soc. China 4, 147\u2013165 (2016)","journal-title":"J. Oper. Res. Soc. China"},{"issue":"3","key":"1573_CR15","doi-asserted-by":"publisher","first-page":"771","DOI":"10.1007\/s10255-017-0697-7","volume":"33","author":"C Liu","year":"2017","unstructured":"Liu, C., Shang, Y., Han, P.: A new infeasible-interior-point algorithm for linear programming over symmetric cones. Acta Math. Appl. Sinica 33(3), 771\u2013788 (2017)","journal-title":"Acta Math. Appl. Sinica"},{"issue":"1\u20133","key":"1573_CR16","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/BF01588785","volume":"49","author":"IJ Lustig","year":"1990","unstructured":"Lustig, I.J.: Feasible issues in a primal-dual interior-point method for linear programming. Math. Program. 49(1\u20133), 145\u2013162 (1990)","journal-title":"Math. Program."},{"key":"1573_CR17","doi-asserted-by":"publisher","first-page":"964","DOI":"10.1287\/moor.18.4.964","volume":"18","author":"S Mizuno","year":"1993","unstructured":"Mizuno, S., Todd, M.J., Ye, Y.: On adaptive step primalual interior-point algorithms for linear programming. Math. Oper. Res. 18, 964\u2013981 (1993)","journal-title":"Math. Oper. Res."},{"key":"1573_CR18","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)"},{"key":"1573_CR19","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1016\/S0377-2217(02)00388-0","volume":"143","author":"FA Potra","year":"2002","unstructured":"Potra, F.A.: The Mizuno\u2013Todd\u2013Ye algorithm in a larger neighborhood of the central path. Eur. J. Oper. Res. 143, 257\u2013267 (2002)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"1573_CR20","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":"1573_CR21","unstructured":"Roos, C., Terlaky, T., Vial, J.-Ph: Interior Point Methods for Linear Optimization. Springer Science, Heidelberg\/Boston, (2006)"},{"key":"1573_CR22","first-page":"19","volume":"63","author":"G Sonnevend","year":"1989","unstructured":"Sonnevend, G., Stoer, J., Zhao, G.: On the complexity of following the central path of linear programming by linear extrapolation. Methods Oper. Res. 63, 19\u201331 (1989)","journal-title":"Methods Oper. Res."},{"key":"1573_CR23","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, USA (1997)"},{"issue":"1\u20132","key":"1573_CR24","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\u20132), 209\u2013225 (2016)","journal-title":"J. Appl. Math. Comput."},{"key":"1573_CR25","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."},{"key":"1573_CR26","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":"1573_CR27","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/BF01585769","volume":"68","author":"Y Zhang","year":"1995","unstructured":"Zhang, Y., Zhang, D.: On polynomiality of the Mehrotra-type predictor-corrector interior-point algorithms. Math. Program. 68, 303\u2013318 (1995)","journal-title":"Math. Program."},{"key":"1573_CR28","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/s00186-010-0334-1","volume":"73","author":"J Zhang","year":"2011","unstructured":"Zhang, J., Zhang, K.: Polynomial complexity of an interior point algorithm with a second order corrector step for symmetric cone programming. Math. Meth. Oper. Res. 73, 75\u201390 (2011)","journal-title":"Math. Meth. Oper. Res."},{"issue":"4","key":"1573_CR29","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1080\/01630563.2016.1138127","volume":"37","author":"X Yang","year":"2016","unstructured":"Yang, X., Zhang, Y., Liu, H., Shen, P.: A new second-order infeasible primal-dual path-following algorithm for symmetric optimization. Numer. Func. Anal. Optim. 37(4), 499\u2013519 (2016)","journal-title":"Numer. Func. Anal. Optim."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-020-01573-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-020-01573-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-020-01573-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,3]],"date-time":"2021-04-03T23:37:27Z","timestamp":1617493047000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-020-01573-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,4,4]]},"references-count":29,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2020,11]]}},"alternative-id":["1573"],"URL":"https:\/\/doi.org\/10.1007\/s11590-020-01573-4","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,4,4]]},"assertion":[{"value":"25 February 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 March 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 April 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}