{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T05:00:17Z","timestamp":1772773217688,"version":"3.50.1"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T00:00:00Z","timestamp":1772755200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T00:00:00Z","timestamp":1772755200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100006407","name":"Natural Science Foundation of Henan Province","doi-asserted-by":"publisher","award":["252300421993"],"award-info":[{"award-number":["252300421993"]}],"id":[{"id":"10.13039\/501100006407","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12071133"],"award-info":[{"award-number":["12071133"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Key Scientific Research Project for Colleges and Universities in Henan Province","award":["25B110005"],"award-info":[{"award-number":["25B110005"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comp. Appl. Math."],"published-print":{"date-parts":[[2026,8]]},"DOI":"10.1007\/s40314-026-03697-2","type":"journal-article","created":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T03:54:44Z","timestamp":1772769284000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A line-search filter adaptive regularization algorithm using cubics based on affine scaling interior-point methods for constrained optimization"],"prefix":"10.1007","volume":"45","author":[{"given":"Yonggang","family":"Pei","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yubing","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Detong","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,3,6]]},"reference":[{"issue":"1","key":"3697_CR1","doi-asserted-by":"publisher","first-page":"764","DOI":"10.1093\/imanum\/drz076","volume":"41","author":"S Bellavia","year":"2021","unstructured":"Bellavia S, Gurioli G, Morini B (2021) Adaptive cubic regularization methods with dynamic inexact Hessian information and applications to finite-sum minimization. IMA J Numer Anal 41(1):764\u2013799. https:\/\/doi.org\/10.1093\/imanum\/drz076","journal-title":"IMA J Numer Anal"},{"issue":"2","key":"3697_CR2","doi-asserted-by":"publisher","first-page":"1352","DOI":"10.1137\/20M1354556","volume":"31","author":"AS Berahas","year":"2021","unstructured":"Berahas AS, Curtis FE, Robinson D, Zhou B (2021) Sequential quadratic optimization for nonlinear equality constrained stochastic optimization. SIAM J Optim 31(2):1352\u20131379. https:\/\/doi.org\/10.1137\/20M1354556","journal-title":"SIAM J Optim"},{"issue":"1","key":"3697_CR3","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1137\/23M1549006","volume":"35","author":"AS Berahas","year":"2025","unstructured":"Berahas AS, Xie M, Zhou B (2025) A sequential quadratic programming method with high-probability complexity bounds for nonlinear equality-constrained stochastic optimization. SIAM J Optim 35(1):240\u2013269. https:\/\/doi.org\/10.1137\/23M1549006","journal-title":"SIAM J Optim"},{"issue":"3","key":"3697_CR4","doi-asserted-by":"publisher","first-page":"885","DOI":"10.1007\/s10957-018-1341-2","volume":"178","author":"EH Bergou","year":"2018","unstructured":"Bergou EH, Diouane Y, Gratton S (2018) A line-search algorithm inspired by the adaptive cubic regularization framework and complexity analysis. J Optim Theory Appl 178(3):885\u2013913. https:\/\/doi.org\/10.1007\/s10957-018-1341-2","journal-title":"J Optim Theory Appl"},{"issue":"2","key":"3697_CR5","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/s10107-009-0286-5","volume":"127","author":"C Cartis","year":"2011","unstructured":"Cartis C, Gould NIM, Toint PL (2011) Adaptive cubic regularisation methods for unconstrained optimization. Part I: motivation, convergence and numerical results. Math Program 127(2):245\u2013295. https:\/\/doi.org\/10.1007\/s10107-009-0286-5","journal-title":"Math Program"},{"issue":"2","key":"3697_CR6","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/s10107-009-0337-y","volume":"130","author":"C Cartis","year":"2011","unstructured":"Cartis C, Gould NIM, Toint PL (2011) Adaptive cubic regularisation methods for unconstrained optimization. Part II: worst-case function- and derivative-evaluation complexity. Math Program 130(2):295\u2013319. https:\/\/doi.org\/10.1007\/s10107-009-0337-y","journal-title":"Math Program"},{"issue":"4","key":"3697_CR7","doi-asserted-by":"publisher","first-page":"1662","DOI":"10.1093\/imanum\/drr035","volume":"32","author":"C Cartis","year":"2012","unstructured":"Cartis C, Gould NIM, Toint PL (2012) An adaptive cubic regularization algorithm for nonconvex optimization with convex constraints and its function-evaluation complexity. IMA J Numer Anal 32(4):1662\u20131695. https:\/\/doi.org\/10.1093\/imanum\/drr035","journal-title":"IMA J Numer Anal"},{"issue":"2","key":"3697_CR8","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1080\/10556788.2011.602076","volume":"27","author":"C Cartis","year":"2012","unstructured":"Cartis C, Gould NIM, Toint PL (2012) Evaluation complexity of adaptive cubic regularization methods for convex unconstrained optimization. Optim Methods Softw 27(2):197\u2013219. https:\/\/doi.org\/10.1080\/10556788.2011.602076","journal-title":"Optim Methods Softw"},{"issue":"3","key":"3697_CR9","doi-asserted-by":"publisher","first-page":"1553","DOI":"10.1137\/120869687","volume":"23","author":"C Cartis","year":"2013","unstructured":"Cartis C, Gould NIM, Toint PL (2013) On the evaluation complexity of cubic regularization methods for potentially rank-deficient nonlinear least-squares problems and its relevance to constrained nonlinear optimization. SIAM J Optim 23(3):1553\u20131574. https:\/\/doi.org\/10.1137\/120869687","journal-title":"SIAM J Optim"},{"issue":"2","key":"3697_CR10","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1080\/10556788.2019.1678033","volume":"35","author":"C Cartis","year":"2020","unstructured":"Cartis C, Gould NIM, Toint PL (2020) A concise second-order complexity analysis for unconstrained optimization using high-order regularized models. Optim Methods Softw 35(2):243\u2013256. https:\/\/doi.org\/10.1080\/10556788.2019.1678033","journal-title":"Optim Methods Softw"},{"issue":"2","key":"3697_CR11","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1137\/0806023","volume":"6","author":"TF Coleman","year":"1996","unstructured":"Coleman TF, Li Y (1996) An interior trust region approach for nonlinear minimization subject to bounds. SIAM J Optim 6(2):418\u2013445. https:\/\/doi.org\/10.1137\/0806023","journal-title":"SIAM J Optim"},{"issue":"4","key":"3697_CR12","doi-asserted-by":"publisher","first-page":"1040","DOI":"10.1137\/S1052623494240456","volume":"6","author":"TF Coleman","year":"1996","unstructured":"Coleman TF, Li Y (1996) A reflective Newton method for minimizing a quadratic function subject to bounds on some of the variables. SIAM J Optim 6(4):1040\u20131058. https:\/\/doi.org\/10.1137\/S1052623494240456","journal-title":"SIAM J Optim"},{"issue":"1","key":"3697_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/PL00011369","volume":"88","author":"TF Coleman","year":"2000","unstructured":"Coleman TF, Li Y (2000) A trust region and affine scaling interior point method for nonconvex minimization with linear inequality constraints. Math Program 88(1):1\u201331. https:\/\/doi.org\/10.1007\/PL00011369","journal-title":"Math Program"},{"issue":"3","key":"3697_CR14","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1007\/s101070050069","volume":"85","author":"TF Coleman","year":"1999","unstructured":"Coleman TF, Liu J (1999) An interior Newton method for quadratic programming. Math Program 85(3):491\u2013523. https:\/\/doi.org\/10.1007\/s101070050069","journal-title":"Math Program"},{"key":"3697_CR15","first-page":"747","volume":"174","author":"II Dikin","year":"1967","unstructured":"Dikin II (1967) Iterative solution of problems of linear and quadratic programming. Dokl Akad Nauk SSSR 174:747\u2013748","journal-title":"Dokl Akad Nauk SSSR"},{"issue":"2","key":"3697_CR16","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"ED Dolan","year":"2002","unstructured":"Dolan ED, Mor\u00e9 JJ (2002) Benchmarking optimization software with performance profiles. Math Program 91(2):201\u2013213. https:\/\/doi.org\/10.1007\/s101070100263","journal-title":"Math Program"},{"issue":"3","key":"3697_CR17","doi-asserted-by":"publisher","first-page":"635","DOI":"10.1137\/S1052623499357258","volume":"13","author":"R Fletcher","year":"2002","unstructured":"Fletcher R, Gould NIM, Leyffer S, Toint PL, W\u00e4chter A (2002) Global convergence of a trust-region SQP-filter algorithm for general nonlinear programming. SIAM J Optim 13(3):635\u2013659. https:\/\/doi.org\/10.1137\/S1052623499357258","journal-title":"SIAM J Optim"},{"issue":"1","key":"3697_CR18","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1137\/S105262340038081X","volume":"13","author":"R Fletcher","year":"2002","unstructured":"Fletcher R, Leyffer S, Toint PL (2002) On the global convergence of a filter-SQP algorithm. SIAM J Optim 13(1):44\u201359. https:\/\/doi.org\/10.1137\/S105262340038081X","journal-title":"SIAM J Optim"},{"issue":"4","key":"3697_CR19","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1137\/S0036144502414942","volume":"44","author":"A Forsgren","year":"2002","unstructured":"Forsgren A, Gill PE, Wright MH (2002) Interior methods for nonlinear optimization. SIAM Rev 44(4):525\u2013597. https:\/\/doi.org\/10.1137\/S0036144502414942","journal-title":"SIAM Rev"},{"issue":"3","key":"3697_CR20","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1007\/s10589-014-9687-3","volume":"60","author":"NIM Gould","year":"2015","unstructured":"Gould NIM, Orban D, Toint PL (2015) Cutest: a constrained and unconstrained testing environment with safe threads for mathematical optimization. Comput Optim Appl 60(3):545\u2013557. https:\/\/doi.org\/10.1007\/s10589-014-9687-3","journal-title":"Comput Optim Appl"},{"issue":"1\u20132","key":"3697_CR21","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/s12190-008-0089-5","volume":"29","author":"C Gu","year":"2009","unstructured":"Gu C, Zhu D (2009) A filter interior-point algorithm with projected Hessian updating for nonlinear optimization. J Appl Math Comput 29(1\u20132):67\u201380. https:\/\/doi.org\/10.1007\/s12190-008-0089-5","journal-title":"J Appl Math Comput"},{"issue":"2","key":"3697_CR22","doi-asserted-by":"publisher","first-page":"879","DOI":"10.1016\/j.apm.2010.07.042","volume":"35","author":"C Gu","year":"2011","unstructured":"Gu C, Zhu D (2011) A secant algorithm with line search filter method for nonlinear optimization. Appl Math Model 35(2):879\u2013894. https:\/\/doi.org\/10.1016\/j.apm.2010.07.042","journal-title":"Appl Math Model"},{"key":"3697_CR23","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1016\/j.cam.2017.02.028","volume":"321","author":"X Huang","year":"2017","unstructured":"Huang X, Zhu D (2017) An interior affine scaling cubic regularization algorithm for derivative-free optimization subject to bound constraints. J Comput Appl Math 321:108\u2013127. https:\/\/doi.org\/10.1016\/j.cam.2017.02.028","journal-title":"J Comput Appl Math"},{"issue":"2","key":"3697_CR24","doi-asserted-by":"publisher","first-page":"812","DOI":"10.1137\/21M1436324","volume":"43","author":"X Jia","year":"2022","unstructured":"Jia X, Liang X, Shen C, Zhang L-H (2022) Solving the cubic regularization model by a nested restarting Lanczos method. SIAM J Matrix Anal Appl 43(2):812\u2013839. https:\/\/doi.org\/10.1137\/21M1436324","journal-title":"SIAM J Matrix Anal Appl"},{"issue":"2","key":"3697_CR25","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1007\/s10589-021-00274-7","volume":"79","author":"R Jiang","year":"2021","unstructured":"Jiang R, Yue M-C, Zhou Z (2021) An accelerated first-order method with complexity analysis for solving cubic regularization subproblems. Comput Optim Appl 79(2):471\u2013506. https:\/\/doi.org\/10.1007\/s10589-021-00274-7","journal-title":"Comput Optim Appl"},{"issue":"3","key":"3697_CR26","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1007\/s40305-022-00398-5","volume":"10","author":"R-J Jiang","year":"2022","unstructured":"Jiang R-J, Zhou Z-S, Zhou Z-R (2022) Cubic regularization methods with second-order complexity guarantee based on a new subproblem reformulation. J Oper Res Soc China 10(3):471\u2013506. https:\/\/doi.org\/10.1007\/s40305-022-00398-5","journal-title":"J Oper Res Soc China"},{"issue":"4","key":"3697_CR27","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/BF02579150","volume":"4","author":"N Karmarkar","year":"1984","unstructured":"Karmarkar N (1984) A new polynomial-time algorithm for linear programming. Combinatorica 4(4):373\u2013395. https:\/\/doi.org\/10.1007\/BF02579150","journal-title":"Combinatorica"},{"issue":"4","key":"3697_CR28","doi-asserted-by":"publisher","first-page":"3345","DOI":"10.1137\/19M1291388","volume":"30","author":"F Lieder","year":"2020","unstructured":"Lieder F (2020) Solving large-scale cubic regularization by a generalized eigenvalue problem. SIAM J Optim 30(4):3345\u20133358. https:\/\/doi.org\/10.1137\/19M1291388","journal-title":"SIAM J Optim"},{"issue":"2","key":"3697_CR29","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1007\/s10589-010-9363-1","volume":"51","author":"S Lu","year":"2012","unstructured":"Lu S, Wei Z, Li L (2012) A trust region algorithm with adaptive cubic regularization methods for nonsmooth convex minimization. Comput Optim Appl 51(2):551\u2013573. https:\/\/doi.org\/10.1007\/s10589-010-9363-1","journal-title":"Comput Optim Appl"},{"issue":"2","key":"3697_CR30","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/s10898-016-0475-8","volume":"68","author":"JM Mart\u00ednez","year":"2017","unstructured":"Mart\u00ednez JM, Raydan M (2017) Cubic-regularization counterpart of a variable-norm trust-region method for unconstrained minimization. J Glob Optim 68(2):367\u2013385. https:\/\/doi.org\/10.1007\/s10898-016-0475-8","journal-title":"J Glob Optim"},{"key":"3697_CR31","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1017\/S0962492906370018","volume":"17","author":"AS Nemirovski","year":"2008","unstructured":"Nemirovski AS, Todd MJ (2008) Interior-point methods for optimization. Acta Numer 17:191\u2013234. https:\/\/doi.org\/10.1017\/S0962492906370018","journal-title":"Acta Numer"},{"key":"3697_CR32","volume-title":"Numerical optimization","author":"J Nocedal","year":"2006","unstructured":"Nocedal J, Wright SJ (2006) Numerical optimization. Springer"},{"issue":"3","key":"3697_CR33","doi-asserted-by":"publisher","first-page":"953","DOI":"10.1007\/s10957-019-01624-6","volume":"184","author":"S Park","year":"2020","unstructured":"Park S, Jung SH, Pardalos PM (2020) Combining stochastic adaptive cubic regularization with negative curvature for nonconvex optimization. J Optim Theory Appl 184(3):953\u2013971. https:\/\/doi.org\/10.1007\/s10957-019-01624-6","journal-title":"J Optim Theory Appl"},{"issue":"4","key":"3697_CR34","doi-asserted-by":"publisher","first-page":"1481","DOI":"10.1007\/s11075-022-01475-9","volume":"93","author":"Y Pei","year":"2023","unstructured":"Pei Y, Song S, Zhu D (2023) A filter sequential adaptive cubic regularization algorithm for nonlinear constrained optimization. Numer Algorithms 93(4):1481\u20131507. https:\/\/doi.org\/10.1007\/s11075-022-01475-9","journal-title":"Numer Algorithms"},{"issue":"1\u20134","key":"3697_CR35","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1007\/BF02739235","volume":"5","author":"K Schittkowski","year":"1986","unstructured":"Schittkowski K (1986) NLPQL: a FORTRAN subroutine solving constrained nonlinear programming problems. Ann Oper Res 5(1\u20134):485\u2013500. https:\/\/doi.org\/10.1007\/BF02739235","journal-title":"Ann Oper Res"},{"issue":"1","key":"3697_CR36","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/S1052623403426556","volume":"16","author":"A W\u00e4chter","year":"2005","unstructured":"W\u00e4chter A, Biegler LT (2005) Line search filter methods for nonlinear programming: motivation and global convergence. SIAM J Optim 16(1):1\u201331. https:\/\/doi.org\/10.1137\/S1052623403426556","journal-title":"SIAM J Optim"},{"key":"3697_CR37","unstructured":"Wilson RB (1963) A simplicial algorithm for concave programming. Ph.D. dissertation, Graduate School of Business Administration"},{"key":"3697_CR38","doi-asserted-by":"publisher","DOI":"10.1002\/9781118032701","volume-title":"Interior point algorithms","author":"Y Ye","year":"1997","unstructured":"Ye Y (1997) Interior point algorithms. Wiley, New York"},{"issue":"1","key":"3697_CR39","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/j.amc.2004.04.056","volume":"166","author":"D Zhu","year":"2005","unstructured":"Zhu D (2005) An affine scaling projective reduced Hessian algorithm for minimum optimization with nonlinear equality and linear inequality constraints. Appl Math Comput 166(1):131\u2013163. https:\/\/doi.org\/10.1016\/j.amc.2004.04.056","journal-title":"Appl Math Comput"}],"container-title":["Computational and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-026-03697-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40314-026-03697-2","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-026-03697-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T03:54:47Z","timestamp":1772769287000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40314-026-03697-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,3,6]]},"references-count":39,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2026,8]]}},"alternative-id":["3697"],"URL":"https:\/\/doi.org\/10.1007\/s40314-026-03697-2","relation":{},"ISSN":["2238-3603","1807-0302"],"issn-type":[{"value":"2238-3603","type":"print"},{"value":"1807-0302","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,3,6]]},"assertion":[{"value":"2 August 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 January 2026","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 February 2026","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 March 2026","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"283"}}