{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,24]],"date-time":"2026-07-24T06:13:49Z","timestamp":1784873629465,"version":"3.55.0"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,5,21]],"date-time":"2025-05-21T00:00:00Z","timestamp":1747785600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,5,21]],"date-time":"2025-05-21T00:00:00Z","timestamp":1747785600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100016073","name":"Key Technologies Research and Development Program of Anhui Province","doi-asserted-by":"publisher","award":["2023YFA1009300"],"award-info":[{"award-number":["2023YFA1009300"]}],"id":[{"id":"10.13039\/100016073","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12171100"],"award-info":[{"award-number":["12171100"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2025,9]]},"DOI":"10.1007\/s10589-025-00692-x","type":"journal-article","created":{"date-parts":[[2025,5,21]],"date-time":"2025-05-21T08:49:22Z","timestamp":1747817362000},"page":"29-79","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Riemannian Adaptive Regularized Newton Methods with H\u00f6lder Continuous Hessians"],"prefix":"10.1007","volume":"92","author":[{"given":"Chenyu","family":"Zhang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6610-6778","authenticated-orcid":false,"given":"Rujun","family":"Jiang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,5,21]]},"reference":[{"key":"692_CR1","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/s10208-005-0179-9","volume":"7","author":"P-A Absil","year":"2007","unstructured":"Absil, P.-A., Baker, C.G., Gallivan, K.A.: Trust-region methods on Riemannian manifolds. Foundations of Computational Mathematics 7, 303\u2013330 (2007)","journal-title":"Foundations of Computational Mathematics"},{"issue":"2","key":"692_CR2","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1007\/s10915-024-02664-5","volume":"101","author":"C Zhang","year":"2024","unstructured":"Zhang, C., Xiao, R., Huang, W., Jiang, R.: Riemannian trust region methods for sc 1 minimization. Journal of Scientific Computing 101(2), 32 (2024)","journal-title":"Journal of Scientific Computing"},{"key":"692_CR3","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/s10107-020-01505-1","volume":"188","author":"N Agarwal","year":"2021","unstructured":"Agarwal, N., Boumal, N., Bullins, B., Cartis, C.: Adaptive regularization with cubics on manifolds. Mathematical Programming 188, 85\u2013134 (2021)","journal-title":"Mathematical Programming"},{"key":"692_CR4","unstructured":"Qi, C.: Numerical optimization methods on Riemannian manifolds. PhD thesis, Florida State University (2011)"},{"issue":"1","key":"692_CR5","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. Mathematical Programming 108(1), 177\u2013205 (2006)","journal-title":"Mathematical Programming"},{"key":"692_CR6","doi-asserted-by":"crossref","unstructured":"Cartis, C., Gould, N.I.M., Toint, P.L.: Adaptive cubic regularisation methods for unconstrained optimization. Part II: Worst-case function- and derivative-evaluation complexity. Mathematical Programming 130(2), 295\u2013319 (2011)","DOI":"10.1007\/s10107-009-0337-y"},{"key":"692_CR7","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. Mathematical Programming 180, 451\u2013488 (2020)","journal-title":"Mathematical Programming"},{"issue":"1","key":"692_CR8","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 Journal on Optimization 31(1), 518\u2013544 (2021)","journal-title":"SIAM Journal on Optimization"},{"issue":"2","key":"692_CR9","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1137\/20M1321759","volume":"62","author":"Y Carmon","year":"2020","unstructured":"Carmon, Y., Duchi, J.C.: First-order methods for nonconvex quadratic minimization. SIAM Review 62(2), 395\u2013436 (2020)","journal-title":"SIAM Review"},{"issue":"1\u20132","key":"692_CR10","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/s10107-016-1065-8","volume":"163","author":"EG Birgin","year":"2017","unstructured":"Birgin, E.G., Gardenghi, J., Mart\u00ednez, J.M., Santos, S.A., Toint, P.L.: Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models. Mathematical Programming 163(1\u20132), 359\u2013368 (2017)","journal-title":"Mathematical Programming"},{"issue":"1","key":"692_CR11","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1137\/17M1144854","volume":"30","author":"C Cartis","year":"2020","unstructured":"Cartis, C., Gould, N.I.M., Toint, P.L.: Sharp worst-case evaluation complexity bounds for arbitrary-order nonconvex optimization with inexpensive constraints. SIAM Journal on Optimization 30(1), 513\u2013541 (2020)","journal-title":"SIAM Journal on Optimization"},{"key":"692_CR12","volume-title":"Optimal newton-type methods for nonconvex smooth optimization problems","author":"C Cartis","year":"2011","unstructured":"Cartis, C., Gould, N.I., Toint, P.L.: Optimal newton-type methods for nonconvex smooth optimization problems. Technical report, ERGO (2011)"},{"issue":"1\u20132","key":"692_CR13","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. Mathematical Programming 184(1\u20132), 71\u2013120 (2020)","journal-title":"Mathematical Programming"},{"issue":"1","key":"692_CR14","doi-asserted-by":"publisher","first-page":"478","DOI":"10.1137\/16M1087801","volume":"27","author":"GN Grapiglia","year":"2017","unstructured":"Grapiglia, G.N., Nesterov, Y.: Regularized Newton methods for minimizing functions with H\u00f6lder continuous hessians. SIAM Journal on Optimization 27(1), 478\u2013506 (2017)","journal-title":"SIAM Journal on Optimization"},{"issue":"1","key":"692_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1093\/imanum\/drx080","volume":"39","author":"N Boumal","year":"2019","unstructured":"Boumal, N., Absil, P.-A., Cartis, C.: Global rates of convergence for nonconvex optimization on manifolds. IMA Journal of Numerical Analysis 39(1), 1\u201333 (2019)","journal-title":"IMA Journal of Numerical Analysis"},{"key":"692_CR16","unstructured":"Zhang, J., Zhang, S.: A cubic regularized Newton\u2019s method over Riemannian manifolds. arXiv preprint arXiv:1805.05565 (2018)"},{"issue":"2","key":"692_CR17","doi-asserted-by":"publisher","first-page":"1751","DOI":"10.1137\/17M1114296","volume":"28","author":"Y Carmon","year":"2018","unstructured":"Carmon, Y., Duchi, J.C., Hinder, O., Sidford, A.: Accelerated methods for nonconvex optimization. SIAM Journal on Optimization 28(2), 1751\u20131772 (2018)","journal-title":"SIAM Journal on Optimization"},{"issue":"3","key":"692_CR18","doi-asserted-by":"publisher","first-page":"1855","DOI":"10.1093\/imanum\/drac043","volume":"43","author":"Z Yao","year":"2023","unstructured":"Yao, Z., Xu, P., Roosta, F., Wright, S.J., Mahoney, M.W.: Inexact Newton-CG algorithms with complexity guarantees. IMA Journal of Numerical Analysis 43(3), 1855\u20131897 (2023)","journal-title":"IMA Journal of Numerical Analysis"},{"issue":"1\u20132","key":"692_CR19","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/s10107-019-01405-z","volume":"184","author":"P Xu","year":"2020","unstructured":"Xu, P., Roosta, F., Mahoney, M.W.: Newton-type methods for non-convex optimization under inexact Hessian information. Mathematical Programming 184(1\u20132), 35\u201370 (2020)","journal-title":"Mathematical Programming"},{"key":"692_CR20","doi-asserted-by":"crossref","unstructured":"Agarwal, N., Allen-Zhu, Z., Bullins, B., Hazan, E., Ma, T.: Finding approximate local minima faster than gradient descent. In: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, pp. 1195\u20131199 (2017)","DOI":"10.1145\/3055399.3055464"},{"issue":"2","key":"692_CR21","doi-asserted-by":"publisher","first-page":"1448","DOI":"10.1137\/17M1134329","volume":"28","author":"CW Royer","year":"2018","unstructured":"Royer, C.W., Wright, S.J.: Complexity analysis of second-order line-search algorithms for smooth nonconvex optimization. SIAM Journal on Optimization 28(2), 1448\u20131477 (2018)","journal-title":"SIAM Journal on Optimization"},{"issue":"3","key":"692_CR22","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.: Cubic regularization methods with second-order complexity guarantee based on a new subproblem reformulation. Journal of the Operations Research Society of China 10(3), 471\u2013506 (2022)","journal-title":"Journal of the Operations Research Society of China"},{"issue":"3","key":"692_CR23","doi-asserted-by":"publisher","first-page":"626","DOI":"10.1137\/0720042","volume":"20","author":"T Steihaug","year":"1983","unstructured":"Steihaug, T.: The conjugate gradient method and trust regions in large scale optimization. SIAM Journal on Numerical Analysis 20(3), 626\u2013637 (1983)","journal-title":"SIAM Journal on Numerical Analysis"},{"key":"692_CR24","unstructured":"Toint, P.: Towards an efficient sparsity exploiting Newton method for minimization. In: Sparse Matrices and Their Uses, pp. 57\u201388. Academic press, London (1981)"},{"key":"692_CR25","unstructured":"Li, H., Lin, Z.: Restarted nonconvex accelerated gradient descent: No more polylogarithmic factor in the $$O (\\varepsilon ^{-7\/4})$$ complexity. In: International Conference on Machine Learning, pp. 12901\u201312916 (2022). PMLR"},{"key":"692_CR26","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1515\/9781400830244","volume-title":"Optimization Algorithms on Matrix Manifolds","author":"P-A Absil","year":"2008","unstructured":"Absil, P.-A., Mahony, R., Sepulchre, R.: Optimization Algorithms on Matrix Manifolds, p. 224. Princeton University Press, Princeton, NJ (2008)"},{"key":"692_CR27","doi-asserted-by":"publisher","DOI":"10.1017\/9781009166164","volume-title":"An Introduction to Optimization on Smooth Manifolds","author":"N Boumal","year":"2023","unstructured":"Boumal, N.: An Introduction to Optimization on Smooth Manifolds. Cambridge University Press, Cambridge (2023)"},{"key":"692_CR28","doi-asserted-by":"crossref","unstructured":"Cartis, C., Gould, N.I.M., Toint, P.L.: Adaptive cubic regularisation methods for unconstrained optimization. Part I: Motivation, convergence and numerical results. Mathematical Programming 127(2), 245\u2013295 (2011)","DOI":"10.1007\/s10107-009-0286-5"},{"issue":"4","key":"692_CR29","doi-asserted-by":"publisher","first-page":"763","DOI":"10.1007\/s10543-008-0197-5","volume":"48","author":"L Luk\u0161an","year":"2008","unstructured":"Luk\u0161an, L., Matonoha, C., Vl\u010dek, J.: On Lagrange multipliers of trust-region subproblems. BIT Numerical Mathematics 48(4), 763\u2013768 (2008)","journal-title":"BIT Numerical Mathematics"},{"issue":"2","key":"692_CR30","doi-asserted-by":"publisher","first-page":"504","DOI":"10.1137\/S1052623497322735","volume":"9","author":"NIM Gould","year":"1999","unstructured":"Gould, N.I.M., Lucidi, S., Roma, M., Toint, P.L.: Solving the trust-region subproblem using the Lanczos method. SIAM Journal on Optimization 9(2), 504\u2013525 (1999)","journal-title":"SIAM Journal on Optimization"},{"key":"692_CR31","volume-title":"Numerical Optimization","author":"J Nocedal","year":"2006","unstructured":"Nocedal, J., Wright, S.J.: Numerical Optimization. Springer Series in Operations Research and Financial Engineering. Springer, New York (2006)"},{"key":"692_CR32","doi-asserted-by":"publisher","DOI":"10.56021\/9781421407944","volume-title":"Matrix Computations","author":"GH Golub","year":"2013","unstructured":"Golub, G.H., Van Loan, C.F.: Matrix Computations. JHU Press, Philadelphia (2013)"},{"key":"692_CR33","volume-title":"Numerical Linear Algebra","author":"LN Trefethen","year":"2022","unstructured":"Trefethen, L.N., Bau, D.: Numerical Linear Algebra. SIAM, Philadelphia (2022)"},{"key":"692_CR34","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719857","volume-title":"Trust Region Methods","author":"AR Conn","year":"2000","unstructured":"Conn, A.R., Gould, N.I.M., Toint, P.L.: Trust Region Methods. SIAM, Philadelphia (2000)"},{"issue":"1","key":"692_CR35","doi-asserted-by":"publisher","first-page":"191","DOI":"10.3982\/ECTA17564","volume":"91","author":"F Parise","year":"2023","unstructured":"Parise, F., Ozdaglar, A.: Graphon games: A statistical framework for network games and interventions. Econometrica 91(1), 191\u2013225 (2023)","journal-title":"Econometrica"},{"key":"692_CR36","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/j.geb.2022.11.007","volume":"137","author":"R Kor","year":"2023","unstructured":"Kor, R., Zhou, J.: Multi-activity influence and intervention. Games and Economic Behavior 137, 91\u2013115 (2023)","journal-title":"Games and Economic Behavior"},{"key":"692_CR37","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-1099-7","volume-title":"Matrix Theory: Basic Results and Techniques","author":"F Zhang","year":"2011","unstructured":"Zhang, F.: Matrix Theory: Basic Results and Techniques. Springer, New York (2011)"},{"issue":"3","key":"692_CR38","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1007\/s10543-019-00791-2","volume":"60","author":"C Cartis","year":"2020","unstructured":"Cartis, C., Gould, N.I.M., Lange, M.: On monotonic estimates of the norm of the minimizers of regularized quadratic functions in Krylov spaces. BIT Numerical Mathematics 60(3), 583\u2013589 (2020)","journal-title":"BIT Numerical Mathematics"},{"issue":"5","key":"692_CR39","doi-asserted-by":"publisher","first-page":"1059","DOI":"10.1080\/10556788.2016.1238917","volume":"32","author":"Y Hsia","year":"2017","unstructured":"Hsia, Y., Sheu, R.-L., Yuan, Y.-X.: Theory and application of $$p$$-regularized subproblems for $$p>2$$. Optimization Methods and Software 32(5), 1059\u20131077 (2017)","journal-title":"Optimization Methods and Software"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-025-00692-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-025-00692-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-025-00692-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,6]],"date-time":"2025-09-06T15:16:16Z","timestamp":1757171776000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-025-00692-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,5,21]]},"references-count":39,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,9]]}},"alternative-id":["692"],"URL":"https:\/\/doi.org\/10.1007\/s10589-025-00692-x","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,5,21]]},"assertion":[{"value":"22 July 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 April 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 May 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}