{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T13:38:57Z","timestamp":1740145137548,"version":"3.37.3"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2022,10,13]],"date-time":"2022-10-13T00:00:00Z","timestamp":1665619200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,10,13]],"date-time":"2022-10-13T00:00:00Z","timestamp":1665619200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"national natural science foundation of china","doi-asserted-by":"publisher","award":["11871115","11971073","11771056"],"award-info":[{"award-number":["11871115","11971073","11771056"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2023,7]]},"DOI":"10.1007\/s11590-022-01941-2","type":"journal-article","created":{"date-parts":[[2022,10,13]],"date-time":"2022-10-13T10:02:39Z","timestamp":1665655359000},"page":"1455-1468","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A step-truncated method in a wide neighborhood interior-point algorithm for linear programming"],"prefix":"10.1007","volume":"17","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2719-2140","authenticated-orcid":false,"given":"Jianbin","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianhua","family":"Yuan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenbao","family":"Ai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,10,13]]},"reference":[{"key":"1941_CR1","doi-asserted-by":"publisher","first-page":"812","DOI":"10.1360\/02ys0141","volume":"47","author":"W Ai","year":"2004","unstructured":"Ai, W.: Neighborhood-following algorithms for linear programming. Sci. China Ser. A Math. 47, 812\u2013820 (2004)","journal-title":"Sci. China Ser. A Math."},{"key":"1941_CR2","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, 400\u2013417 (2005)","journal-title":"SIAM J. Optim."},{"key":"1941_CR3","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1137\/S1052623403423114","volume":"15","author":"YQ Bai","year":"2004","unstructured":"Bai, Y.Q., Ghami, M.E., Roos, C.: A comparative study of kernel functions for primal-dual interior-point algorithms in linear optimization. SIAM J. Optim. 15, 101\u2013128 (2004)","journal-title":"SIAM J. Optim."},{"key":"1941_CR4","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/s10957-008-9389-z","volume":"138","author":"YQ Bai","year":"2008","unstructured":"Bai, Y.Q., Lesaja, G., Roos, C., Wang, G.Q., Ghami, M.E.: A class of large-update and small-update primal-dual interior-point algorithms for linear optimization. J. Optim. Theory Appl. 138, 341\u2013359 (2008)","journal-title":"J. Optim. Theory Appl."},{"key":"1941_CR5","doi-asserted-by":"publisher","first-page":"1747","DOI":"10.1007\/s11590-019-01468-z","volume":"14","author":"Z Darvay","year":"2020","unstructured":"Darvay, Z., Kheirfam, B., Rig\u00f3, P.: A new wide neighborhood primal-dual second-order corrector algorithm for linear optimization. Optim. Lett. 14, 1747\u20131763 (2020)","journal-title":"Optim. Lett."},{"key":"1941_CR6","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1007\/s10100-018-0524-0","volume":"26","author":"Z Darvay","year":"2018","unstructured":"Darvay, Z., Rig\u00f3, P.: Large-step interior-point algorithm for linear optimization based on a new wide neighbourhood. CEJOR 26, 551\u2013563 (2018)","journal-title":"CEJOR"},{"key":"1941_CR7","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/BF00249643","volume":"6","author":"J Gondzio","year":"1996","unstructured":"Gondzio, J.: Multiple centrality corrections in a primal-dual method for linear programming. Comput. Optim. Appl. 6, 137\u2013156 (1996)","journal-title":"Comput. Optim. Appl."},{"key":"1941_CR8","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1137\/1034048","volume":"34","author":"CC Gonzaga","year":"1992","unstructured":"Gonzaga, C.C.: Path-following methods for linear programming. SIAM Rev. 34, 167\u2013224 (1992)","journal-title":"SIAM Rev."},{"key":"1941_CR9","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1137\/S1052623496304141","volume":"10","author":"CC Gonzaga","year":"1999","unstructured":"Gonzaga, C.C.: Complexity of predictor-corrector algorithms for LCP based on a large neighborhood of the central path. SIAM J. Optim. 10, 183\u2013194 (1999)","journal-title":"SIAM J. Optim."},{"key":"1941_CR10","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1137\/S1052623493243569","volume":"7","author":"CC Gonzaga","year":"1997","unstructured":"Gonzaga, C.C., Tapia, R.A.: On the quadratic convergence of the simplified Mizuno-Todd-Ye algorithm for linear programming. SIAM J. Optim. 7, 66\u201385 (1997)","journal-title":"SIAM J. Optim."},{"key":"1941_CR11","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/BF01580610","volume":"60","author":"O G\u00fcler","year":"1993","unstructured":"G\u00fcler, O., Ye, Y.: Convergence behavior of interior-point algorithms. Math. Program. 60, 215\u2013228 (1993)","journal-title":"Math. Program."},{"key":"1941_CR12","doi-asserted-by":"publisher","first-page":"570","DOI":"10.1137\/S1052623494266869","volume":"6","author":"PF Hung","year":"1996","unstructured":"Hung, P.F., Ye, Y.: An asymptotical O($$\\sqrt{n}$$L)-iteration path-following linear programming algorithm that uses wide neighborhoods. SIAM J. Optim. 6, 570\u2013586 (1996)","journal-title":"SIAM J. Optim."},{"key":"1941_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{Tr(X^0S^0)}{\\epsilon }$$L) iteration complexity. SIAM J. Optim. 20, 2853\u20132875 (2010)","journal-title":"SIAM J. Optim."},{"key":"1941_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., 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":"1941_CR15","doi-asserted-by":"publisher","first-page":"1685","DOI":"10.1016\/j.apnum.2012.05.009","volume":"62","author":"H Liu","year":"2012","unstructured":"Liu, H., Liu, X., Liu, C.: Mehrotra-type predictor-corrector algorithms for sufficient linear complementarity problem. Appl. Numer. Math. 62, 1685\u20131700 (2012)","journal-title":"Appl. Numer. Math."},{"key":"1941_CR16","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":"1941_CR17","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/BF01299392","volume":"3","author":"Z Luo","year":"1994","unstructured":"Luo, Z., Wu, S.: A modified predictor-corrector method for linear programming. Comput. Optim. Appl. 3, 83\u201391 (1994)","journal-title":"Comput. Optim. Appl."},{"key":"1941_CR18","doi-asserted-by":"publisher","first-page":"669","DOI":"10.1007\/s12190-016-1055-2","volume":"55","author":"X Ma","year":"2017","unstructured":"Ma, X., Liu, H.: A superlinearly convergent wide-neighborhood predictor-corrector interior-point algorithm for linear programming. J. Appl. Math. Comput. 55, 669\u2013682 (2017)","journal-title":"J. Appl. Math. Comput."},{"key":"1941_CR19","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1137\/0802028","volume":"2","author":"S Mehrotra","year":"1992","unstructured":"Mehrotra, S.: On the implementation of a primal-dual interior point method. SIAM J. Optim. 2, 575\u2013601 (1992)","journal-title":"SIAM J. Optim."},{"key":"1941_CR20","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/BF01585565","volume":"69","author":"J Miao","year":"1995","unstructured":"Miao, J.: A quadratically convergent $${O}((\\kappa + 1)\\sqrt{n} {L})$$-iteration algorithm for the P*($$\\kappa$$)-matrix linear complementarity problem. Math. Program. 69, 355\u2013368 (1995)","journal-title":"Math. Program."},{"key":"1941_CR21","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 primal-dual interior-point algorithms for linear programming. Math. Oper. Res. 18, 964\u2013981 (1993)","journal-title":"Math. Oper. Res."},{"key":"1941_CR22","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)"},{"key":"1941_CR23","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\u201328 (2014)","journal-title":"SIAM J. Optim."},{"key":"1941_CR24","doi-asserted-by":"publisher","first-page":"1377","DOI":"10.1137\/050628787","volume":"18","author":"M Salahi","year":"2008","unstructured":"Salahi, M., Peng, J., Terlaky, T.: On Mehrotra-type predictor\u2013corrector algorithms. SIAM J. Optim. 18, 1377\u20131397 (2008)","journal-title":"SIAM J. Optim."},{"key":"1941_CR25","first-page":"646","volume":"183","author":"M Salahi","year":"2006","unstructured":"Salahi, M., Mahdavi-Amiri, N.: Polynomial time second order Mehrotra-type predictor-corrector algorithms. Appl. Math. Comput. 183, 646\u2013658 (2006)","journal-title":"Appl. Math. Comput."},{"key":"1941_CR26","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, vol. 54. SIAM, New York (1997)"},{"key":"1941_CR27","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1007\/BF01585182","volume":"62","author":"Y Ye","year":"1993","unstructured":"Ye, Y., Anstreicher, K.: On quadratic and $${O}(\\sqrt{n}{L})$$ convergence of a predictor-corrector algorithm for LCP. Math. Program. 62, 537\u2013551 (1993)","journal-title":"Math. Program."},{"key":"1941_CR28","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. Springer, Berlin (1997)"},{"key":"1941_CR29","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/BF01581242","volume":"59","author":"Y Ye","year":"1993","unstructured":"Ye, Y., G\u00fcler, O., Tapia, R.A., Zhang, Y.: A quadratically convergent O($$\\sqrt{n}$$L)-iteration algorithm for linear programming. Math. Program. 59, 151\u2013162 (1993)","journal-title":"Math. Program."},{"key":"1941_CR30","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.J., 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":"1941_CR31","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/BF00940179","volume":"73","author":"Y Zhang","year":"1992","unstructured":"Zhang, Y., Tapia, R.A.: Superlinear and quadratic convergence of primal-dual interior-point methods for linear programming revisited. J. Optim. Theory Appl. 73, 229\u2013242 (1992)","journal-title":"J. Optim. Theory Appl."},{"key":"1941_CR32","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1137\/0803006","volume":"3","author":"Y Zhang","year":"1993","unstructured":"Zhang, Y., Tapia, R.A.: A superlinearly convergent polynomial primal-dual interior-point algorithm for linear programming. SIAM J. Optim. 3, 118\u2013133 (1993)","journal-title":"SIAM J. Optim."},{"key":"1941_CR33","doi-asserted-by":"publisher","first-page":"304","DOI":"10.1137\/0802015","volume":"2","author":"Y Zhang","year":"2006","unstructured":"Zhang, Y., Tapia, R.A., Dennis, J.E.: On the superlinear and quadratic convergence of primal-dual interior point linear programming algorithms. SIAM J. Optim. 2, 304\u2013324 (2006)","journal-title":"SIAM J. Optim."},{"key":"1941_CR34","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."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-022-01941-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11590-022-01941-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-022-01941-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,26]],"date-time":"2023-05-26T15:16:18Z","timestamp":1685114178000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11590-022-01941-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10,13]]},"references-count":34,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2023,7]]}},"alternative-id":["1941"],"URL":"https:\/\/doi.org\/10.1007\/s11590-022-01941-2","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"type":"print","value":"1862-4472"},{"type":"electronic","value":"1862-4480"}],"subject":[],"published":{"date-parts":[[2022,10,13]]},"assertion":[{"value":"14 July 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 September 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 October 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}