{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,4]],"date-time":"2026-07-04T06:20:30Z","timestamp":1783146030691,"version":"3.54.6"},"reference-count":39,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T00:00:00Z","timestamp":1777420800000},"content-version":"vor","delay-in-days":118,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001665","name":"French National Research Agency","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100007567","name":"City University of Hong Kong","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100007567","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["EURO Journal on Computational Optimization"],"published-print":{"date-parts":[[2026]]},"DOI":"10.1016\/j.ejco.2026.100128","type":"journal-article","created":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:22:41Z","timestamp":1777594961000},"page":"100128","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["A fast Newton method under local Lipschitz smoothness"],"prefix":"10.1016","volume":"14","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5021-2357","authenticated-orcid":false,"given":"Serge","family":"Gratton","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4892-0514","authenticated-orcid":false,"given":"Sadok","family":"Jerad","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6166-1860","authenticated-orcid":false,"given":"Philippe","family":"Toint","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.ejco.2026.100128_bib0005","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1137\/16M1058200","article-title":"Solving the trust-region subproblem by a generalized eigenvalue problem","volume":"27","author":"Adachin","year":"2017","journal-title":"SIAM J. Optim."},{"issue":"1\u20132","key":"10.1016\/j.ejco.2026.100128_bib0010","first-page":"359","article-title":"Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models","volume":"163","author":"Birgin","year":"2016","journal-title":"Math. Program."},{"issue":"1\u20132","key":"10.1016\/j.ejco.2026.100128_bib0015","first-page":"71","article-title":"Lower bounds for finding stationary points i","volume":"184","author":"Carmon","year":"2019","journal-title":"Math. Program."},{"issue":"2","key":"10.1016\/j.ejco.2026.100128_bib0020","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/s10107-009-0337-y","article-title":"Adaptive cubic regularisation methods for unconstrained optimization. Part II: worst-case function- and derivative-evaluation complexity","volume":"130","author":"Cartis","year":"2010","journal-title":"Math. Program."},{"issue":"1","key":"10.1016\/j.ejco.2026.100128_bib0025","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1137\/17M1144854","article-title":"Sharp worst-case evaluation complexity bounds for arbitrary-order nonconvex optimization with inexpensive constraints","volume":"30","author":"Cartis","year":"2020","journal-title":"SIAM J. Optim."},{"key":"10.1016\/j.ejco.2026.100128_bib0030","series-title":"MOS-SIAM Series on Optimization","article-title":"Evaluation complexity of algorithms for nonconvex optimization","author":"Cartis","year":"2022"},{"key":"10.1016\/j.ejco.2026.100128_bib0035","series-title":"Proceedings of the 40th International Conference on Machine Learning","first-page":"5396","article-title":"Generalized-smooth nonconvex optimization is as efficient as smooth nonconvex optimization","volume":"vol. 202","author":"Chen","year":"2023"},{"issue":"3","key":"10.1016\/j.ejco.2026.100128_bib0040","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1016\/j.acha.2012.06.003","article-title":"A fast divide-and-conquer algorithm for computing the spectra of real symmetric tridiagonal matrices","volume":"34","author":"Coakley","year":"2013","journal-title":"Appl. Comput. Harmon. Anal."},{"key":"10.1016\/j.ejco.2026.100128_bib0045","series-title":"Trust Region Methods","author":"Conn","year":"2000"},{"key":"10.1016\/j.ejco.2026.100128_bib0050","doi-asserted-by":"crossref","DOI":"10.1007\/s10107-025-02270-9","article-title":"Minimizing quasi-self-concordant functions by gradient regularization of Newton method","author":"Doikov","year":"2025","journal-title":"Math. Program."},{"issue":"1","key":"10.1016\/j.ejco.2026.100128_bib0055","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1137\/22M1519444","article-title":"Super-universal regularized newton method","volume":"34","author":"Doikov","year":"2024","journal-title":"SIAM J. Optim."},{"key":"10.1016\/j.ejco.2026.100128_bib0060","series-title":"Gradient Regularization of Newton Method with Bregman Distances","author":"Doikov","year":"2023"},{"issue":"3","key":"10.1016\/j.ejco.2026.100128_bib0065","doi-asserted-by":"crossref","first-page":"891","DOI":"10.1137\/040608015","article-title":"Optimality measures for performance profiles","volume":"16","author":"Dolan","year":"2006","journal-title":"SIAM J. Optim."},{"key":"10.1016\/j.ejco.2026.100128_bib0070","series-title":"Scalable Adaptive Cubic Regularization Methods","author":"Dussault","year":"2023"},{"key":"10.1016\/j.ejco.2026.100128_bib0075","series-title":"Proceedings of Thirty Sixth Conference on Learning Theory, Volume 195 of Proceedings of Machine Learning Research","first-page":"89","article-title":"Beyond uniform smoothness: a stopped analysis of adaptive sgd","author":"Faw","year":"2023"},{"issue":"3","key":"10.1016\/j.ejco.2026.100128_bib0080","doi-asserted-by":"crossref","first-page":"1621","DOI":"10.1137\/22M1499522","article-title":"Convergence properties of an objective-function-free optimization regularization algorithm, including anO(\u03f5\u22123\/2)complexity bound","volume":"33","author":"Gratton","year":"2023","journal-title":"SIAM J. Optim."},{"issue":"5","key":"10.1016\/j.ejco.2026.100128_bib0085","first-page":"1","article-title":"A stochastic objective-function-free adaptive regularization method with optimal complexity","volume":"6","author":"Gratton","year":"2025","journal-title":"Open J. Math. Optim."},{"issue":"2","key":"10.1016\/j.ejco.2026.100128_bib0090","doi-asserted-by":"crossref","first-page":"971","DOI":"10.1093\/imanum\/drae021","article-title":"Yet another fast variant of newton\u2019s method for nonconvex optimization","volume":"45","author":"Gratton","year":"2025","journal-title":"IMA J. Numer. Anal."},{"issue":"4","key":"10.1016\/j.ejco.2026.100128_bib0095","doi-asserted-by":"crossref","first-page":"871","DOI":"10.1080\/10556788.2025.2490640","article-title":"S2MPJ and CUTEst optimization problems for Matlab, Python and Julia","volume":"40","author":"Gratton","year":"2025","journal-title":"Optim. Methods Softw."},{"issue":"2","key":"10.1016\/j.ejco.2026.100128_bib0100","doi-asserted-by":"crossref","first-page":"920","DOI":"10.1093\/imanum\/drac005","article-title":"Adaptive regularization minimization algorithms with nonsmooth norms","volume":"43","author":"Graton","year":"2022","journal-title":"IMA J. Numer. Anal."},{"key":"10.1016\/j.ejco.2026.100128_bib0105","series-title":"Proceedings of the 40th International Conference on Machine Learning","first-page":"17343","article-title":"Revisiting gradient clipping: stochastic bias and tight convergence guarantees","author":"Koloskova","year":"2023"},{"key":"10.1016\/j.ejco.2026.100128_bib0110","first-page":"40238","article-title":"Convex and non-convex optimization under generalized smoothness","volume":"36","author":"Haochuan","year":"2023","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"10.1016\/j.ejco.2026.100128_bib0115","first-page":"52166","article-title":"Convergence of adam under relaxed assumptions","volume":"36","author":"Haochuan","year":"2023","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"10.1016\/j.ejco.2026.100128_bib0120","series-title":"Proceedings of the 37th International Conference on Machine Learning, Volume 119 of Proceedings of Machine Learning Research","first-page":"6702","article-title":"Adaptive gradient descent without descent","author":"Malitsky","year":"2020"},{"issue":"3","key":"10.1016\/j.ejco.2026.100128_bib0125","doi-asserted-by":"crossref","first-page":"1440","DOI":"10.1137\/22M1488752","article-title":"Regularized newton method with globalo(1\/k2)convergence","volume":"33","author":"Mishchenko","year":"2023","journal-title":"SIAM J. Optim."},{"issue":"1","key":"10.1016\/j.ejco.2026.100128_bib0130","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/s10107-007-0143-3","article-title":"Regularized newton method for unconstrained convex optimization","volume":"120","author":"Polyak","year":"2007","journal-title":"Math. Program."},{"issue":"2","key":"10.1016\/j.ejco.2026.100128_bib0135","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3310362","article-title":"A note on using performance and data profiles for training algorithms","volume":"45","author":"Porcelli","year":"2019","journal-title":"ACM Trans. Math. Softw."},{"key":"10.1016\/j.ejco.2026.100128_bib0140","series-title":"ICASSP 2025 - 2025 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)","first-page":"1","article-title":"Variance-reduced clipping for non-convex optimization","author":"Reisizadeh","year":"2025"},{"issue":"1\u20132","key":"10.1016\/j.ejco.2026.100128_bib0145","first-page":"451","article-title":"A newton-CG algorithm with complexity guarantees for smooth unconstrained optimization","volume":"180","author":"Royer","year":"2019","journal-title":"Math. Program."},{"key":"10.1016\/j.ejco.2026.100128_bib0150","series-title":"Proceedings of the 26th International Conference on Artificial Intelligence and Statistics","first-page":"3693","article-title":"Convergence of steinvariational gradient descent under a weaker smoothness condition","volume":"vol. 206","author":"Sun","year":"2023"},{"issue":"1\u20132","key":"10.1016\/j.ejco.2026.100128_bib0155","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/s10589-014-9656-x","article-title":"A regularized newton method without line search for unconstrained optimization","volume":"59","author":"Ueda","year":"2014","journal-title":"Comput. Optim. Appl."},{"issue":"2","key":"10.1016\/j.ejco.2026.100128_bib0160","doi-asserted-by":"crossref","DOI":"10.1007\/s10915-025-03069-8","article-title":"Gradient norm regularization second-order algorithms for solving nonconvex-strongly concave minimax problems","volume":"105","author":"Wang","year":"2025","journal-title":"J. Sci. Comput."},{"issue":"14","key":"10.1016\/j.ejco.2026.100128_bib0165","first-page":"16049","article-title":"Trust region methods for nonconvex stochastic optimization beyond lipschitz smoothness","volume":"38","author":"Xie","year":"2024","journal-title":"Proc. AAAI Conf. Artif. Intell."},{"issue":"2","key":"10.1016\/j.ejco.2026.100128_bib0170","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1287\/ijoo.2019.0043","article-title":"Inexact nonconvex newton-type methods","volume":"3","author":"Yao","year":"2021","journal-title":"INFORMS J. Optim."},{"issue":"3","key":"10.1016\/j.ejco.2026.100128_bib0175","doi-asserted-by":"crossref","first-page":"1855","DOI":"10.1093\/imanum\/drac043","article-title":"Inexact newton-CG algorithms with complexity guarantees","volume":"43","author":"Yao","year":"2022","journal-title":"IMA J. Numer. Anal."},{"key":"10.1016\/j.ejco.2026.100128_bib0180","series-title":"Advances in Neural Information Processing Systems","first-page":"15511","article-title":"Improved analysis of clipping algorithms for non-convex optimization","volume":"vol. 33","author":"Zhang","year":"2020"},{"issue":"1","key":"10.1016\/j.ejco.2026.100128_bib0185","doi-asserted-by":"crossref","first-page":"715","DOI":"10.1287\/moor.2024.0510","article-title":"AdaBB: adaptive Barzilai-Borwein method for convex optimization","volume":"51","author":"Zhou","year":"2026","journal-title":"Math. Oper. Res."},{"key":"10.1016\/j.ejco.2026.100128_bib0190","series-title":"International Conference on Learning Representations","article-title":"Why gradient clipping accelerates training: a theoretical justification for adaptivity","author":"Zhang","year":"2020"},{"key":"10.1016\/j.ejco.2026.100128_bib0195","series-title":"The Thirty-Ninth Annual Conference on Neural Information Processing Systems","article-title":"A regularized newton method for nonconvex optimization with global and local complexity guarantees","author":"Zhou","year":"2025"}],"container-title":["EURO Journal on Computational Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S219244062600002X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S219244062600002X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,7,4]],"date-time":"2026-07-04T06:02:53Z","timestamp":1783144973000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S219244062600002X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"references-count":39,"alternative-id":["S219244062600002X"],"URL":"https:\/\/doi.org\/10.1016\/j.ejco.2026.100128","relation":{},"ISSN":["2192-4406"],"issn-type":[{"value":"2192-4406","type":"print"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A fast Newton method under local Lipschitz smoothness","name":"articletitle","label":"Article Title"},{"value":"EURO Journal on Computational Optimization","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ejco.2026.100128","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 The Authors. Published by Elsevier B.V. on behalf of Association of European Operational Research Societies (EURO).","name":"copyright","label":"Copyright"}],"article-number":"100128"}}