{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,13]],"date-time":"2025-03-13T17:10:13Z","timestamp":1741885813561,"version":"3.38.0"},"reference-count":53,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2025,1,13]],"date-time":"2025-01-13T00:00:00Z","timestamp":1736726400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,13]],"date-time":"2025-01-13T00:00:00Z","timestamp":1736726400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"NASA\u2019s IRAD 2023 fund","award":["SSMX2223D."],"award-info":[{"award-number":["SSMX2223D."]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2025,4]]},"DOI":"10.1007\/s10589-025-00648-1","type":"journal-article","created":{"date-parts":[[2025,1,13]],"date-time":"2025-01-13T23:27:39Z","timestamp":1736810859000},"page":"969-995","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An arc-search interior-point algorithm for nonlinear constrained optimization"],"prefix":"10.1007","volume":"90","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2943-9389","authenticated-orcid":false,"given":"Yaguang","family":"Yang","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,1,13]]},"reference":[{"key":"648_CR1","unstructured":"Alizadeh, F.: Combinatorial optimization with interior-point methods and semi-definite matrices, Ph.D. thesis, Department of Computer Science, University of Minnesota, Minneapolis, MN, (1993)"},{"issue":"2","key":"648_CR2","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/s10589-007-9089-x","volume":"40","author":"HY Benson","year":"2008","unstructured":"Benson, H.Y., Shanno, D.F.: Interior-point methods for nonconvex nonlinear programming: regularization and warmstarts. Comput. Optim. Appl. 40(2), 143\u2013189 (2008)","journal-title":"Comput. Optim. Appl."},{"key":"648_CR3","doi-asserted-by":"crossref","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":"648_CR4","doi-asserted-by":"crossref","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. Program. 89, 149\u2013185 (2000)","journal-title":"Math. Program."},{"issue":"1","key":"648_CR5","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/s10107-003-0376-8","volume":"99","author":"RH Byrd","year":"2004","unstructured":"Byrd, R.H., Marazzi, M., Nocedal, J.: On the convergence of Newton iterations to nonstationary points. Math. Program. 99(1), 127\u2013148 (2004)","journal-title":"Math. Program."},{"key":"648_CR6","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1007\/s12532-012-0041-4","volume":"4","author":"FE Curtis","year":"2012","unstructured":"Curtis, F.E.: A penalty-interior-point algorithm for nonlinear constrained optimization. Math. Program. Comput. 4, 181\u2013209 (2012)","journal-title":"Math. Program. Comput."},{"key":"648_CR7","doi-asserted-by":"crossref","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":"648_CR8","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1137\/S0036144502414942","volume":"44","author":"A Forsgren","year":"2002","unstructured":"Forsgren, A., Gill, P.E., Wright, M.H.: Interior methods for nonlinear optimization. SIAM Rev. 44, 525\u2013597 (2002)","journal-title":"SIAM Rev."},{"issue":"1","key":"648_CR9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10589-010-9339-1","volume":"51","author":"PE Gill","year":"2012","unstructured":"Gill, P.E., Robinson, D.P.: A primal-dual augmented Lagrangian. Comput. Optim. Appl. 51(1), 1\u201325 (2012)","journal-title":"Comput. Optim. Appl."},{"key":"648_CR10","unstructured":"Golub, G.H., Van Loan, C.F.: Matrix Computations, Johns Hopkins Studies in Mathematical Sciences, 3rd Edition, (1996)"},{"issue":"3","key":"648_CR11","doi-asserted-by":"crossref","first-page":"545","DOI":"10.1007\/s10589-014-9687-3","volume":"60","author":"NIM Gould","year":"2015","unstructured":"Gould, N.I.M., 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."},{"key":"648_CR12","doi-asserted-by":"crossref","unstructured":"Hock, W., Schittkowski, K.: Test examples for nonlinear programming codes. Lecture Notes in Economics and Mathematical Systems, vol. 187. Springer, Berlin (1981)","DOI":"10.1007\/978-3-642-48320-2"},{"key":"648_CR13","doi-asserted-by":"crossref","unstructured":"Iida, E., Yamashita, M.: An infeasible interior-point arc-search method with Nesterov\u2019s restarting strategy for linear programming problems, Computational Optimization and Applications, (2024)","DOI":"10.1007\/s10589-024-00561-z"},{"key":"648_CR14","doi-asserted-by":"crossref","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, 2271\u20132282 (2017)","journal-title":"Int. J. Comput. Math."},{"key":"648_CR15","doi-asserted-by":"publisher","DOI":"10.1007\/s10915-021-01609-6","author":"B Kheirfam","year":"2021","unstructured":"Kheirfam, B.: A polynomial-iteration infeasible interior-point algorithm with arc-search for semidefinite optimization. J. Sci. Comput. (2021). https:\/\/doi.org\/10.1007\/s10915-021-01609-6","journal-title":"J. Sci. Comput."},{"key":"648_CR16","doi-asserted-by":"crossref","first-page":"1039","DOI":"10.1007\/BF01587074","volume":"44","author":"M Kojima","year":"1989","unstructured":"Kojima, M., Mizuno, S., Yoshise, A.: A polynomial-time algorithm for a class of linear complementarity problem. Math. Program. 44, 1039\u20131091 (1989)","journal-title":"Math. Program."},{"issue":"5","key":"648_CR17","doi-asserted-by":"crossref","first-page":"1228","DOI":"10.2514\/1.18196","volume":"30","author":"J Laurent-Varin","year":"2007","unstructured":"Laurent-Varin, J., Bonnans, J.F., B\u00e9rend, N., Haddou, M., Talbot, C.: Interior-Point Approach to Trajectory Optimization. J. Guid. Control. Dyn. 30(5), 1228\u20131238 (2007)","journal-title":"J. Guid. Control. Dyn."},{"key":"648_CR18","first-page":"1301","volume":"89","author":"Xin-Wei Liu","year":"2020","unstructured":"Liu, Xin-Wei., Dai, Yu-Hong.: A globally convergent primal-dual interior-point relaxation method for nonlinear programs. Math. Comput. 89, 1301\u20131329 (2020)","journal-title":"Math. Comput."},{"issue":"4","key":"648_CR19","doi-asserted-by":"crossref","first-page":"1163","DOI":"10.1137\/S1052623402400641","volume":"14","author":"X Liu","year":"2004","unstructured":"Liu, X., Sun, J.: A robust primal-dual interior-point algorithm for nonlinear programs. SIAM J. Optim. 14(4), 1163\u20131186 (2004)","journal-title":"SIAM J. Optim."},{"key":"648_CR20","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/S0898-1221(01)00278-4","volume":"43","author":"TT Lu","year":"2002","unstructured":"Lu, T.T., Shiou, S.H.: Inverses of 2 $$\\times $$ 2 Block Matrices. Comput. Math. Appl. 43, 119\u2013129 (2002)","journal-title":"Comput. Math. Appl."},{"key":"648_CR21","first-page":"240","volume-title":"Optimization by Vector Space Methods","author":"D Luenberger","year":"1969","unstructured":"Luenberger, D.: Optimization by Vector Space Methods, pp. 240\u2013242. John Wiley & Sons, New York (1969)"},{"key":"648_CR22","doi-asserted-by":"crossref","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":"648_CR23","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/BF01582568","volume":"64","author":"RDC Monteiro","year":"1994","unstructured":"Monteiro, R.D.C.: A globally convergent primal-dual interior point algorithm for convex programming. Math. Program. 64, 123\u2013147 (1994)","journal-title":"Math. Program."},{"key":"648_CR24","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/BF01587076","volume":"44","author":"R Monteiro","year":"1989","unstructured":"Monteiro, R., Adler, I.: Interior path following primal-dual algorithms. Part II: convex quadratic programming. Math. Program. 44, 43\u201366 (1989)","journal-title":"Math. Program."},{"key":"648_CR25","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1137\/0804013","volume":"4","author":"W Murray","year":"1994","unstructured":"Murray, W., Wright, M.H.: Line search procedures for the Logarithmic barrier function. SIAM J. Optim. 4, 229\u2013246 (1994)","journal-title":"SIAM J. Optim."},{"key":"648_CR26","doi-asserted-by":"crossref","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":"648_CR27","volume-title":"Numerical Optimization","author":"J Nocedal","year":"2006","unstructured":"Nocedal, J., Wright, S.J.: Numerical Optimization. Springer, New York (2006)"},{"issue":"1","key":"648_CR28","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2558904","volume":"41","author":"MA Patterson","year":"2014","unstructured":"Patterson, M.A., Rao, A.V.: GPOPS-II: A MATLAB software for solving multiple-phase optimal control problems using hp-adaptive gaussian quadrature collocation methods and sparse nonlinear programming. ACM Trans. Math. Softw. 41(1), 1 (2014)","journal-title":"ACM Trans. Math. Softw."},{"key":"648_CR29","doi-asserted-by":"crossref","first-page":"282","DOI":"10.1137\/S1064827595284403","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. Sci. Comput. 20, 282\u2013305 (1998)","journal-title":"SIAM J. Sci. Comput."},{"key":"648_CR30","unstructured":"Rump, S.M.: INTLAB - INTerval LABoratory, (2023) https:\/\/www.tuhh.de\/ti3\/rump\/intlab\/"},{"issue":"2","key":"648_CR31","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1007\/s101070050116","volume":"87","author":"DF Shanno","year":"2000","unstructured":"Shanno, D.F., Vanderbei, R.J.: Interior-point methods for nonconvex nonlinear programming: orderings and higher-order methods. Math. Program. 87(2), 303\u2013316 (2000)","journal-title":"Math. Program."},{"issue":"1","key":"648_CR32","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1137\/S1052623401392123","volume":"14","author":"AL Tits","year":"2003","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. SIAM J. Optim. 14(1), 173\u2013199 (2003)","journal-title":"SIAM J. Optim."},{"key":"648_CR33","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1007\/s101070100261","volume":"91","author":"MJ Todd","year":"2002","unstructured":"Todd, M.J.: The many facets of linear programming. Math. Program. 91, 417\u2013436 (2002)","journal-title":"Math. Program."},{"key":"648_CR34","doi-asserted-by":"crossref","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. Program. 100, 379\u2013410 (2004)","journal-title":"Math. Program."},{"key":"648_CR35","doi-asserted-by":"crossref","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."},{"issue":"3","key":"648_CR36","doi-asserted-by":"crossref","first-page":"565","DOI":"10.1007\/PL00011386","volume":"88","author":"A W\u00e4chter","year":"2000","unstructured":"W\u00e4chter, A., Biegler, L.T.: Failure of global convergence for a class of interior point methods for nonlinear programming. Math. Program. 88(3), 565\u2013574 (2000)","journal-title":"Math. Program."},{"issue":"1","key":"648_CR37","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/S1052623403426556","volume":"16","author":"A W\u00e4chter","year":"2005","unstructured":"W\u00e4chter, A., Biegler, L.T.: Line search filter methods for nonlinear programming: motivation and global convergence. SIAM J. Optim. 16(1), 1\u201331 (2005)","journal-title":"SIAM J. Optim."},{"key":"648_CR38","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/s10107-004-0559-y","volume":"106","author":"A W\u00e4chter","year":"2006","unstructured":"W\u00e4chter, A., Biegler, L.T.: On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming. Math. Program. 106, 25\u201357 (2006)","journal-title":"Math. Program."},{"key":"648_CR39","doi-asserted-by":"crossref","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":"2","key":"648_CR40","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1080\/10556789808805723","volume":"10","author":"H Yamashita","year":"1998","unstructured":"Yamashita, H.: A globally convergent primal-dual interior point method for constrained optimization. Optim. Methods Softw. 10(2), 443\u2013469 (1998)","journal-title":"Optim. Methods Softw."},{"key":"648_CR41","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1007\/s11075-021-01113-w","volume":"89","author":"M Yamashita","year":"2018","unstructured":"Yamashita, M., Iida, E., Yang, Y.: An infeasible interior-point arc-search algorithm for nonlinear constrained optimization. Numer. Algorithms 89, 249\u2013275 (2018)","journal-title":"Numer. Algorithms"},{"key":"648_CR42","doi-asserted-by":"crossref","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, 135\u2013152 (2017)","journal-title":"Optim. Lett."},{"key":"648_CR43","doi-asserted-by":"crossref","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, 25\u201338 (2011)","journal-title":"Eur. J. Oper. Res."},{"key":"648_CR44","doi-asserted-by":"crossref","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":"648_CR45","doi-asserted-by":"crossref","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":"648_CR46","doi-asserted-by":"crossref","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"},{"key":"648_CR47","doi-asserted-by":"crossref","DOI":"10.1201\/9781003042518","volume-title":"Arc-Search Techniques for Interior-Point Methods","author":"Y Yang","year":"2020","unstructured":"Yang, Y.: Arc-Search Techniques for Interior-Point Methods. CRC Press, Baco Raton (2020)"},{"key":"648_CR48","doi-asserted-by":"crossref","first-page":"885","DOI":"10.1007\/s11081-022-09712-9","volume":"24","author":"Y Yang","year":"2023","unstructured":"Yang, Y.: A polynomial time infeasible interior-point arc-search algorithm for convex optimization. Optim. Eng. 24, 885\u2013914 (2023)","journal-title":"Optim. Eng."},{"key":"648_CR49","unstructured":"Yang, Y.: On optimal LISA orbit design, (2025) arXiv:2501.00936 [gr-qc]"},{"key":"648_CR50","unstructured":"Yang, Y., Pritchett, R., Hatten, N.: An infeasible interior-point arc-search algorithm for spacecraft trajectory optimization. In: 2024 INFORMS Optimization Society Conference, Houston, March 22-24, (2024). Available on https:\/\/ntrs.nasa.gov\/citations\/20240002037"},{"issue":"3","key":"648_CR51","doi-asserted-by":"crossref","first-page":"782","DOI":"10.1137\/S1052623400369235","volume":"12","author":"EA Yildirim","year":"2002","unstructured":"Yildirim, E.A., Wright, S.J.: Warm-start strategies in interior-point methods for linear programming. SIAM J. Optim. 12(3), 782\u2013810 (2002)","journal-title":"SIAM J. Optim."},{"key":"648_CR52","doi-asserted-by":"crossref","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, 1157\u20131175 (2019)","journal-title":"Optim. Lett."},{"key":"648_CR53","doi-asserted-by":"crossref","first-page":"1117","DOI":"10.1007\/s11081-021-09626-y","volume":"23","author":"M Zhang","year":"2022","unstructured":"Zhang, M., Huang, K., Lv, Y.: A wide neighborhood arc-search interior-point algorithm for convex quadratic programming with box constraints and linear constraints. Optim. Eng. 23, 1117\u20131137 (2022)","journal-title":"Optim. Eng."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-025-00648-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-025-00648-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-025-00648-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,13]],"date-time":"2025-03-13T16:37:16Z","timestamp":1741883836000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-025-00648-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1,13]]},"references-count":53,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,4]]}},"alternative-id":["648"],"URL":"https:\/\/doi.org\/10.1007\/s10589-025-00648-1","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"type":"print","value":"0926-6003"},{"type":"electronic","value":"1573-2894"}],"subject":[],"published":{"date-parts":[[2025,1,13]]},"assertion":[{"value":"1 July 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 January 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 January 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Author declares no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}