{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,20]],"date-time":"2026-04-20T11:47:50Z","timestamp":1776685670189,"version":"3.51.2"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,5,18]],"date-time":"2021-05-18T00:00:00Z","timestamp":1621296000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,5,18]],"date-time":"2021-05-18T00:00:00Z","timestamp":1621296000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"crossref","award":["18K11176"],"award-info":[{"award-number":["18K11176"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Numer Algor"],"published-print":{"date-parts":[[2022,1]]},"DOI":"10.1007\/s11075-021-01113-w","type":"journal-article","created":{"date-parts":[[2021,5,18]],"date-time":"2021-05-18T06:03:04Z","timestamp":1621317784000},"page":"249-275","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["An infeasible interior-point arc-search algorithm for nonlinear constrained optimization"],"prefix":"10.1007","volume":"89","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8409-036X","authenticated-orcid":false,"given":"Makoto","family":"Yamashita","sequence":"first","affiliation":[]},{"given":"Einosuke","family":"Iida","sequence":"additional","affiliation":[]},{"given":"Yaguang","family":"Yang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,5,18]]},"reference":[{"key":"1113_CR1","doi-asserted-by":"publisher","first-page":"877","DOI":"10.1137\/S1052623497325107","volume":"9","author":"RH Byrd","year":"1999","unstructured":"Byrd, R. H., Hribar, M. E., Nocedal, J.: An interior point algorithm for large-scale nonlinear programming. SIAM J. Optim. 9, 877\u2013900 (1999)","journal-title":"SIAM J. Optim."},{"key":"1113_CR2","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/PL00011391","volume":"89","author":"RH Byrd","year":"2000","unstructured":"Byrd, R. H., Gilbert, J. C., Nocedal, J.: A trust region method based on interior point techniques for nonlinear programming. Math. Progr. 89, 149\u2013185 (2000)","journal-title":"Math. Progr."},{"key":"1113_CR3","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1007\/BF02275347","volume":"89","author":"AS El-Bakry","year":"1996","unstructured":"El-Bakry, A. S., Tapia, R. A., Tsuchiya, T., Zhang, Y.: On the formulation and theory of the Newton interior-point method for nonlinear programming. J. Optim. Theory Appl. 89, 507\u2013541 (1996)","journal-title":"J. Optim. Theory Appl."},{"key":"1113_CR4","doi-asserted-by":"publisher","first-page":"1132","DOI":"10.1137\/S1052623496305560","volume":"8","author":"A Forsgren","year":"1998","unstructured":"Forsgren, A., Gill, P. E.: Primal-dual interior methods for nonconvex nonlinear programming. SIAM J. Optim. 8, 1132\u20131152 (1998)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"1113_CR5","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1145\/2950048","volume":"43","author":"N Gould","year":"2016","unstructured":"Gould, N., Scott, J.: A note on performance profiles for benchmarking software. ACM Trans. Math. Softw. 43(2), 15 (2016)","journal-title":"ACM Trans. Math. Softw."},{"issue":"3","key":"1113_CR6","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1007\/s10589-014-9687-3","volume":"60","author":"NI Gould","year":"2015","unstructured":"Gould, N. I., Orban, D., Toint, P.L.: CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization. Comput. Optim. Appl. 60(3), 545\u2013557 (2015)","journal-title":"Comput. Optim. Appl."},{"issue":"1","key":"1113_CR7","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 horizontal linear complementarity problem in the $N^{-\\infty }$ neighbourhood of the central path. Int. J. Comput. Math. 94(1), 2271\u20132282 (2017)","journal-title":"Int. J. Comput. Math."},{"key":"1113_CR8","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/S0898-1221(01)00278-4","volume":"43","author":"T Lu","year":"2002","unstructured":"Lu, T., Shiou, S.: Inverses of 2 \u00d7 2 block matrices. Comput. Math. Appl. 43, 119\u2013129 (2002)","journal-title":"Comput. Math. Appl."},{"key":"1113_CR9","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1016\/0024-3795(91)90275-2","volume":"152","author":"I Lustig","year":"1991","unstructured":"Lustig, I., Marsten, R., Shannon, D.: Computational experience with a primal-dual interior-point method for linear programming. Linear Algebra Appl. 152, 192\u2013222 (1991)","journal-title":"Linear Algebra Appl."},{"key":"1113_CR10","doi-asserted-by":"publisher","first-page":"432","DOI":"10.1137\/0802022","volume":"2","author":"I Lustig","year":"1992","unstructured":"Lustig, I., Marsten, R., Shannon, D.: On implementing Mehrotra\u2019s predictor-corrector interior-point method for linear programming. SIAM J. Optim. 2, 432\u2013449 (1992)","journal-title":"SIAM J. Optim."},{"key":"1113_CR11","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":"1113_CR12","doi-asserted-by":"publisher","first-page":"1674","DOI":"10.1137\/060649513","volume":"19","author":"J Nocedal","year":"2009","unstructured":"Nocedal, J., Wachter, A., Waltz, R. A.: Adaptive barrier update strategies for nonlinear interior methods. SIAM J. Optim. 19, 1674\u20131693 (2009)","journal-title":"SIAM J. Optim."},{"key":"1113_CR13","first-page":"282","volume":"20","author":"T Plantenga","year":"1998","unstructured":"Plantenga, T.: A trust region method for nonlinear programming based on primal interior-point techniques. SIAM J. Optim. 20, 282\u2013305 (1998)","journal-title":"SIAM J. Optim."},{"key":"1113_CR14","first-page":"1132","volume":"8","author":"AL Tits","year":"1998","unstructured":"Tits, A. L., Wachter, A., Bakhtiarl, S., Urban, T. J., Lawrence, C. T.: A primal-dual method for nonlinear programming with strong global and local convergence properties. Math. Progr. 8, 1132\u20131152 (1998)","journal-title":"Math. Progr."},{"key":"1113_CR15","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/s10107-003-0477-4","volume":"100","author":"M Ulbrich","year":"2004","unstructured":"Ulbrich, M., Ulbrich, S., Vicente, L. N.: A globally convergent primal-dual interior-point filter method for nonlinear programming. Math. Progr. 100, 379\u2013410 (2004)","journal-title":"Math. Progr."},{"key":"1113_CR16","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1023\/A:1008677427361","volume":"13","author":"R Vanderbei","year":"1999","unstructured":"Vanderbei, R., Shanno, D.: An interior-point algorithm for nonconvex nonlinear programming. Comput. Optim. Appl. 13, 231\u2013252 (1999)","journal-title":"Comput. Optim. Appl."},{"key":"1113_CR17","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611971453","volume-title":"Primal-Dual Interior-Point Methods","author":"S Wright","year":"1997","unstructured":"Wright, S.: Primal-Dual Interior-Point Methods. SIAM, Philadelphia (1997)"},{"issue":"1","key":"1113_CR18","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/j.ejor.2011.06.020","volume":"215","author":"Y Yang","year":"2011","unstructured":"Yang, Y.: A polynomial arc-search interior-point algorithm for convex quadratic programming. Eur. J. Oper. Res. 215(1), 25\u201338 (2011)","journal-title":"Eur. J. Oper. Res."},{"key":"1113_CR19","doi-asserted-by":"publisher","first-page":"859","DOI":"10.1007\/s10957-013-0281-0","volume":"158","author":"Y Yang","year":"2013","unstructured":"Yang, Y.: A polynomial arc-search interior-point algorithm for linear programming. J. Optim. Theory Appl. 158, 859\u2013873 (2013)","journal-title":"J. Optim. Theory Appl."},{"key":"1113_CR20","doi-asserted-by":"publisher","first-page":"967","DOI":"10.1007\/s11075-016-0180-1","volume":"74","author":"Y Yang","year":"2017","unstructured":"Yang, Y.: Curvelp-a matlab implementation of an infeasible interior-point algorithm for linear programming. Numer. Algorithms 74, 967\u2013996 (2017)","journal-title":"Numer. Algorithms"},{"key":"1113_CR21","doi-asserted-by":"publisher","first-page":"957","DOI":"10.1007\/s11075-018-0469-3","volume":"79","author":"Y Yang","year":"2018","unstructured":"Yang, Y.: Two computationally efficient polynomial-iteration infeasible interior-point algorithms for linear programming. Numer. Algorithms 79, 957\u2013992 (2018)","journal-title":"Numer. Algorithms"},{"issue":"1","key":"1113_CR22","doi-asserted-by":"publisher","first-page":"781","DOI":"10.1007\/s11590-017-1142-9","volume":"12","author":"Y Yang","year":"2018","unstructured":"Yang, Y., Yamashita, M.: An arc-search O(nL) infeasible-interior-point algorithm for linear programming. Optim. Lett. 12(1), 781\u2013798 (2018)","journal-title":"Optim. Lett."},{"issue":"1","key":"1113_CR23","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/s11590-016-0997-5","volume":"11","author":"X Yang","year":"2017","unstructured":"Yang, X., Liu, H., Zhang, Y.: An arc-search infeasible-interior-point method for symmetric optimization in a wide neighborhood of the central path. Optim. Lett. 11(1), 135\u2013152 (2017)","journal-title":"Optim. Lett."},{"key":"1113_CR24","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, New York (1997)"},{"issue":"5","key":"1113_CR25","doi-asserted-by":"publisher","first-page":"1157","DOI":"10.1007\/s11590-019-01414-z","volume":"13","author":"M Zhang","year":"2019","unstructured":"Zhang, M., Yuan, B., Zhou, Y., Luo, X., Huang, Z.: A primal-dual interior-point algorithm with arc-search for semidefinite programming. Optim. Lett. 13(5), 1157\u20131175 (2019)","journal-title":"Optim. Lett."},{"key":"1113_CR26","doi-asserted-by":"crossref","unstructured":"Zhao, G., Zhu, J.: Analytical properties of the central trajectory in interior point methods. In: Du, D. Z., Sun, J. (eds.) Advances in Optimization and Approximation, pp 362\u2013375. Springer, Boston (1994)","DOI":"10.1007\/978-1-4613-3629-7_20"}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-021-01113-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11075-021-01113-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-021-01113-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,3]],"date-time":"2022-01-03T17:41:21Z","timestamp":1641231681000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11075-021-01113-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,5,18]]},"references-count":26,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,1]]}},"alternative-id":["1113"],"URL":"https:\/\/doi.org\/10.1007\/s11075-021-01113-w","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"value":"1017-1398","type":"print"},{"value":"1572-9265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,5,18]]},"assertion":[{"value":"28 October 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 April 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 May 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}