{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T17:40:38Z","timestamp":1778694038839,"version":"3.51.4"},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,12,12]],"date-time":"2025-12-12T00:00:00Z","timestamp":1765497600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,12,12]],"date-time":"2025-12-12T00:00:00Z","timestamp":1765497600000},"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":["72394360"],"award-info":[{"award-number":["72394360"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["72394364"],"award-info":[{"award-number":["72394364"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["72394365"],"award-info":[{"award-number":["72394365"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["72225009"],"award-info":[{"award-number":["72225009"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["72171141"],"award-info":[{"award-number":["72171141"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sci Comput"],"published-print":{"date-parts":[[2026,1]]},"DOI":"10.1007\/s10915-025-03154-y","type":"journal-article","created":{"date-parts":[[2025,12,12]],"date-time":"2025-12-12T09:28:43Z","timestamp":1765531723000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Beyond Nonconvexity: A Universal Trust-Region Method with New Analyses"],"prefix":"10.1007","volume":"106","author":[{"given":"Yuntian","family":"Jiang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chang","family":"He","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chuwen","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dongdong","family":"Ge","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8924-3185","authenticated-orcid":false,"given":"Bo","family":"Jiang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yinyu","family":"Ye","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,12,12]]},"reference":[{"key":"3154_CR1","doi-asserted-by":"crossref","unstructured":"Byrd, R.H., Nocedal, J., Waltz, R.A.: Knitro: An integrated package for nonlinear optimization. Large-scale nonlinear optimization pp. 35\u201359 (2006)","DOI":"10.1007\/0-387-30065-1_4"},{"issue":"1","key":"3154_CR2","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/s10107-019-01406-y","volume":"184","author":"Y Carmon","year":"2020","unstructured":"Carmon, Y., Duchi, J.C., Hinder, O., Sidford, A.: Lower bounds for finding stationary points i. Math. Program. 184(1), 71\u2013120 (2020)","journal-title":"Math. Program."},{"issue":"1","key":"3154_CR3","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/s10107-019-01431-x","volume":"185","author":"Y Carmon","year":"2021","unstructured":"Carmon, Y., Duchi, J.C., Hinder, O., Sidford, A.: Lower bounds for finding stationary points ii: first-order methods. Math. Program. 185(1), 315\u2013355 (2021)","journal-title":"Math. Program."},{"key":"3154_CR4","doi-asserted-by":"crossref","unstructured":"Cartis, C., Gould, N.I., Toint, P.L.: Adaptive cubic regularisation methods for unconstrained optimization. part i: motivation, convergence and numerical results. Math. Program. 127(2), 245\u2013295 (2011)","DOI":"10.1007\/s10107-009-0286-5"},{"key":"3154_CR5","doi-asserted-by":"crossref","unstructured":"Cartis, C., Gould, N.I., Toint, P.L.: Adaptive cubic regularisation methods for unconstrained optimization. part ii: worst-case function-and derivative-evaluation complexity. Math. Program. 130(2), 295\u2013319 (2011)","DOI":"10.1007\/s10107-009-0337-y"},{"key":"3154_CR6","volume-title":"Evaluation Complexity of Algorithms for Nonconvex Optimization: Theory","author":"C Cartis","year":"2022","unstructured":"Cartis, C., Gould, N.I., Toint, P.L.: Evaluation Complexity of Algorithms for Nonconvex Optimization: Theory. SIAM, Computation and Perspectives (2022)"},{"issue":"3","key":"3154_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1961189.1961199","volume":"2","author":"CC Chang","year":"2011","unstructured":"Chang, C.C., Lin, C.J.: Libsvm: a library for support vector machines. ACM Trans. Intell. Syst. Technol. 2(3), 1\u201327 (2011). https:\/\/doi.org\/10.1145\/1961189.1961199","journal-title":"ACM Trans. Intell. Syst. Technol."},{"key":"3154_CR8","doi-asserted-by":"crossref","unstructured":"Conn, A.R., Gould, N.I., Toint, P.L.: Trust Region Methods. SIAM (2000)","DOI":"10.1137\/1.9780898719857"},{"key":"3154_CR9","doi-asserted-by":"publisher","first-page":"1713","DOI":"10.1007\/s11590-018-1286-2","volume":"12","author":"FE Curtis","year":"2018","unstructured":"Curtis, F.E., Lubberts, Z., Robinson, D.P.: Concise complexity analyses for trust region methods. Optimization Letters 12, 1713\u20131724 (2018)","journal-title":"Optimization Letters"},{"issue":"1","key":"3154_CR10","doi-asserted-by":"publisher","first-page":"518","DOI":"10.1137\/19M130563X","volume":"31","author":"FE Curtis","year":"2021","unstructured":"Curtis, F.E., Robinson, D.P., Royer, C.W., Wright, S.J.: Trust-region Newton-cg with strong second-order complexity guarantees for nonconvex optimization. SIAM J. Optim. 31(1), 518\u2013544 (2021)","journal-title":"SIAM J. Optim."},{"key":"3154_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10107-016-1026-2","volume":"162","author":"FE Curtis","year":"2017","unstructured":"Curtis, F.E., Robinson, D.P., Samadi, M.: A trust region algorithm with a worst-case iteration complexity of $$\\cal{O} (\\epsilon ^{-3\/2})$$ for nonconvex optimization. Math. Program. 162, 1\u201332 (2017)","journal-title":"Math. Program."},{"issue":"3","key":"3154_CR12","doi-asserted-by":"publisher","first-page":"2191","DOI":"10.1137\/22M1492428","volume":"33","author":"FE Curtis","year":"2023","unstructured":"Curtis, F.E., Wang, Q.: Worst-case complexity of TRACE with inexact subproblem solutions for nonconvex smooth optimization. SIAM J. Optim. 33(3), 2191\u20132221 (2023)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"3154_CR13","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1137\/22M1519444","volume":"34","author":"N Doikov","year":"2024","unstructured":"Doikov, N., Mishchenko, K., Nesterov, Y.: Super-universal regularized Newton method. SIAM J. Optim. 34(1), 27\u201356 (2024)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"3154_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10107-023-01943-7","volume":"204","author":"N Doikov","year":"2024","unstructured":"Doikov, N., Nesterov, Y.: Gradient regularization of Newton method with bregman distances. Math. Program. 204(1), 1\u201325 (2024)","journal-title":"Math. Program."},{"key":"3154_CR15","doi-asserted-by":"crossref","unstructured":"Dussault, J.P.: A unified efficient implementation of trust-region type algorithms for unconstrained optimization. INFOR: Information Systems and Operational Research 58(2), 290\u2013309 (2020)","DOI":"10.1080\/03155986.2019.1624490"},{"key":"3154_CR16","doi-asserted-by":"crossref","unstructured":"Dussault, J.P., Migot, T., Orban, D.: Scalable adaptive cubic regularization methods. Mathematical Programming (2023)","DOI":"10.1007\/s10107-023-02007-6"},{"key":"3154_CR17","unstructured":"Fan, J., Yuan, Y.X.: A new trust region algorithm with trust region radius converging to zero. In: Proceedings of the 5th International Conference on Optimization: Techniques and Applications, pp. 786\u2013794. Hong Kong (2001)"},{"issue":"3","key":"3154_CR18","doi-asserted-by":"publisher","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."},{"issue":"1\u20132","key":"3154_CR19","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1007\/s10107-014-0794-9","volume":"152","author":"GN Grapiglia","year":"2015","unstructured":"Grapiglia, G.N., Yuan, J., Yuan, Y.X.: On the convergence and worst-case complexity of trust-region and regularization methods for unconstrained optimization. Math. Program. 152(1\u20132), 491\u2013520 (2015). https:\/\/doi.org\/10.1007\/s10107-014-0794-9","journal-title":"Math. Program."},{"issue":"2","key":"3154_CR20","doi-asserted-by":"publisher","first-page":"971","DOI":"10.1093\/imanum\/drae021","volume":"45","author":"S Gratton","year":"2024","unstructured":"Gratton, S., Jerad, S., Toint, P.L.: Yet another fast variant of Newton\u2019s method for nonconvex optimization. IMA J. Numer. Anal. 45(2), 971\u20131008 (2024)","journal-title":"IMA J. Numer. Anal."},{"key":"3154_CR21","unstructured":"Griewank, A.: The modification of Newton\u2019s method for unconstrained optimization by bounding cubic terms. Tech. rep., Technical report NA\/12 (1981)"},{"key":"3154_CR22","first-page":"6640","volume":"35","author":"F Hamad","year":"2022","unstructured":"Hamad, F., Hinder, O.: A consistently adaptive trust-region method. Adv. Neural. Inf. Process. Syst. 35, 6640\u20136653 (2022)","journal-title":"Adv. Neural. Inf. Process. Syst."},{"key":"3154_CR23","first-page":"25320","volume":"35","author":"S Hanzely","year":"2022","unstructured":"Hanzely, S., Kamzolov, D., Pasechnyuk, D., Gasnikov, A., Richt\u00e1rik, P., Tak\u00e1c, M.: A damped Newton method achieves global $$\\cal{O} (1\/k^2)$$ and local quadratic convergence rate. Adv. Neural. Inf. Process. Syst. 35, 25320\u201325334 (2022)","journal-title":"Adv. Neural. Inf. Process. Syst."},{"key":"3154_CR24","unstructured":"He, C., Jiang, Y., Zhang, C., Ge, D., Jiang, B., Ye, Y.: Homogeneous second-order descent framework: A fast alternative to Newton-type methods. Mathematical Programming (to appear.)"},{"key":"3154_CR25","unstructured":"Kurutach, T., Clavera, I., Duan, Y., Tamar, A., Abbeel, P.: Model-ensemble trust-region policy optimization. arXiv preprint arXiv:1802.10592 (2018)"},{"key":"3154_CR26","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-85450-8","volume-title":"Linear and Nonlinear Programming, International Series in Operations Research & Management Science","author":"DG Luenberger","year":"2021","unstructured":"Luenberger, D.G., Ye, Y.: Linear and Nonlinear Programming, International Series in Operations Research & Management Science, vol. 228. Springer International Publishing, Cham (2021)"},{"issue":"3","key":"3154_CR27","doi-asserted-by":"publisher","first-page":"1440","DOI":"10.1137\/22M1488752","volume":"33","author":"K Mishchenko","year":"2023","unstructured":"Mishchenko, K.: Regularized Newton method with global $$\\cal{O} (1\/k^2)$$ convergence. SIAM J. Optim. 33(3), 1440\u20131462 (2023)","journal-title":"SIAM J. Optim."},{"key":"3154_CR28","doi-asserted-by":"crossref","unstructured":"Nesterov, Y.: Lectures On Convex Optimization, vol. 137. Springer (2018)","DOI":"10.1007\/978-3-319-91578-4_2"},{"key":"3154_CR29","doi-asserted-by":"crossref","unstructured":"Nesterov, Y., Nemirovskii, A.: Interior-Point Polynomial Algorithms in Convex Programming. SIAM (1994)","DOI":"10.1137\/1.9781611970791"},{"issue":"1","key":"3154_CR30","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/s10107-006-0706-8","volume":"108","author":"Y Nesterov","year":"2006","unstructured":"Nesterov, Y., Polyak, B.T.: Cubic regularization of Newton method and its global performance. Math. Program. 108(1), 177\u2013205 (2006)","journal-title":"Math. Program."},{"key":"3154_CR31","doi-asserted-by":"crossref","unstructured":"Nocedal, J., Wright, S.J.: Numerical Optimization. Springer (1999)","DOI":"10.1007\/b98874"},{"key":"3154_CR32","doi-asserted-by":"crossref","unstructured":"Ragonneau, T.M., Zhang, Z.: PDFO: a cross-platform package for Powell\u2019s derivative-free optimization solvers. Mathematical Programming Computation pp. 1\u201325 (2024)","DOI":"10.1007\/s12532-024-00257-9"},{"issue":"1","key":"3154_CR33","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/s10107-019-01362-7","volume":"180","author":"CW Royer","year":"2020","unstructured":"Royer, C.W., O\u2019Neill, M., Wright, S.J.: A Newton-CG algorithm with complexity guarantees for smooth unconstrained optimization. Math. Program. 180(1), 451\u2013488 (2020). https:\/\/doi.org\/10.1007\/s10107-019-01362-7","journal-title":"Math. Program."},{"key":"3154_CR34","unstructured":"Schulman, J., Levine, S., Abbeel, P., Jordan, M., Moritz, P.: Trust region policy optimization. In: International conference on machine learning, pp. 1889\u20131897. PMLR (2015)"},{"issue":"1","key":"3154_CR35","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1137\/0722003","volume":"22","author":"GA Shultz","year":"1985","unstructured":"Shultz, G.A., Schnabel, R.B., Byrd, R.H.: A family of trust-region-based algorithms for unconstrained minimization with strong global convergence properties. SIAM J. Numer. Anal. 22(1), 47\u201367 (1985)","journal-title":"SIAM J. Numer. Anal."},{"issue":"2","key":"3154_CR36","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1137\/0719026","volume":"19","author":"DC Sorensen","year":"1982","unstructured":"Sorensen, D.C.: Newton\u2019s method with a model trust region modification. SIAM J. Numer. Anal. 19(2), 409\u2013426 (1982)","journal-title":"SIAM J. Numer. Anal."},{"key":"3154_CR37","unstructured":"Sun, W., Yuan, Y.X.: Optimization Theory and Methods: Nonlinear Programming. No. volume 1 in Springer Optimization and Its Applications. Springer, New York (2006)"},{"key":"3154_CR38","doi-asserted-by":"publisher","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":"3154_CR39","doi-asserted-by":"crossref","unstructured":"Ye, Y.: A new complexity result on minimization of a quadratic function with a sphere constraint. In: Recent Advances in Global Optimization, vol. 176, pp. 19\u201331. Princeton University Press (1991)","DOI":"10.1515\/9781400862528.19"},{"issue":"3","key":"3154_CR40","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1006\/jcom.1994.1014","volume":"10","author":"Y Ye","year":"1994","unstructured":"Ye, Y.: Combining binary search and Newton\u2019s method to compute real roots for a class of real functions. J. Complex. 10(3), 271\u2013280 (1994)","journal-title":"J. Complex."},{"key":"3154_CR41","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1093\/oso\/9780198505143.003.0023","volume":"99","author":"YX Yuan","year":"2000","unstructured":"Yuan, Y.X.: A review of trust region algorithms for optimization. ICIAM 99, 271\u2013282 (2000)","journal-title":"ICIAM"},{"key":"3154_CR42","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/s10107-015-0893-2","volume":"151","author":"YX Yuan","year":"2015","unstructured":"Yuan, Y.X.: Recent advances in trust region algorithms. Math. Program. 151, 249\u2013281 (2015)","journal-title":"Math. Program."},{"key":"3154_CR43","unstructured":"Zhang, C., He, C., Jiang, Y., Xue, C., Jiang, B., Ge, D., Ye, Y.: A homogenous second-order descent method for nonconvex optimization. Mathematics of Operations Research (to appear.)"}],"container-title":["Journal of Scientific Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-025-03154-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10915-025-03154-y","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-025-03154-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,10]],"date-time":"2026-01-10T05:36:34Z","timestamp":1768023394000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10915-025-03154-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,12]]},"references-count":43,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,1]]}},"alternative-id":["3154"],"URL":"https:\/\/doi.org\/10.1007\/s10915-025-03154-y","relation":{},"ISSN":["0885-7474","1573-7691"],"issn-type":[{"value":"0885-7474","type":"print"},{"value":"1573-7691","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,12,12]]},"assertion":[{"value":"12 April 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 November 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 November 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 December 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"This research is partially supported by the National Natural Science Foundation of China (grants 72394360, 72394364, 72394365, 72225009, and 72171141), and Natural Science Foundation of Shanghai (No. 23ZR1445900).","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Funding"}},{"value":"The authors declare that they have no financial or non-financial conflicts of interest.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of Interest"}},{"value":"No human participants or animals were involved in this research, and therefore no ethical approval or informed consent was required.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical Approval"}}],"article-number":"28"}}