{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,27]],"date-time":"2026-05-27T16:49:14Z","timestamp":1779900554264,"version":"3.53.1"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2023,10,31]],"date-time":"2023-10-31T00:00:00Z","timestamp":1698710400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,10,31]],"date-time":"2023-10-31T00:00:00Z","timestamp":1698710400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100002790","name":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100002790","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002790","name":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100002790","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100010785","name":"Canada First Research Excellence Fund","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100010785","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2024,9]]},"DOI":"10.1007\/s10107-023-02007-6","type":"journal-article","created":{"date-parts":[[2023,10,31]],"date-time":"2023-10-31T14:02:22Z","timestamp":1698760942000},"page":"191-225","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Scalable adaptive cubic regularization methods"],"prefix":"10.1007","volume":"207","author":[{"given":"Jean-Pierre","family":"Dussault","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tangi","family":"Migot","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8017-7687","authenticated-orcid":false,"given":"Dominique","family":"Orban","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,10,31]]},"reference":[{"issue":"1","key":"2007_CR1","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/s10589-014-9672-x","volume":"60","author":"T Bianconcini","year":"2014","unstructured":"Bianconcini, T., Liuzzi, G., Morini, B., Sciandrone, M.: On the use of iterative methods in cubic regularization for unconstrained optimization. Comput. Optim. Appl. 60(1), 35\u201357 (2014). https:\/\/doi.org\/10.1007\/s10589-014-9672-x","journal-title":"Comput. Optim. Appl."},{"issue":"1\u20132","key":"2007_CR2","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/s10107-016-1065-8","volume":"163","author":"EG Birgin","year":"2016","unstructured":"Birgin, E.G., Gardenghi, J.L., Mart\u00ednez, J.M., Santos, S.A., Toint, Ph.L.: Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models. Math. Progr. 163(1\u20132), 359\u2013368 (2016). https:\/\/doi.org\/10.1007\/s10107-016-1065-8","journal-title":"Math. Progr."},{"issue":"3","key":"2007_CR3","doi-asserted-by":"publisher","first-page":"2146","DOI":"10.1137\/17m1113898","volume":"29","author":"Y Carmon","year":"2019","unstructured":"Carmon, Y., Duchi, J.: Gradient descent finds the cubic-regularized nonconvex Newton step. SIAM J. Optim. 29(3), 2146\u20132178 (2019). https:\/\/doi.org\/10.1137\/17m1113898","journal-title":"SIAM J. Optim."},{"key":"2007_CR4","doi-asserted-by":"publisher","unstructured":"Cartis, C., Gould, N.I.M., Toint, Ph.L.: Adaptive cubic regularisation methods for unconstrained optimization. Part I: motivation, convergence and numerical results. Math. Program. 127(2), 245\u2013295 (2011). https:\/\/doi.org\/10.1007\/s10107-009-0286-5","DOI":"10.1007\/s10107-009-0286-5"},{"issue":"2","key":"2007_CR5","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, N.I.M., Toint, Ph.L.: Adaptive cubic regularisation methods for unconstrained optimization. Part II: worst-case function- and derivative-evaluation complexity. Math. Program. 130(2), 295\u2013319 (2011). https:\/\/doi.org\/10.1007\/s10107-009-0337-y","journal-title":"Math. Program."},{"issue":"1","key":"2007_CR6","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/j.jco.2011.06.001","volume":"28","author":"C Cartis","year":"2012","unstructured":"Cartis, C., Gould, N.I.M., Toint, Ph.L.: Complexity bounds for second-order optimality in unconstrained optimization. J. Complex. 28(1), 93\u2013108 (2012). https:\/\/doi.org\/10.1016\/j.jco.2011.06.001","journal-title":"J. Complex."},{"issue":"3","key":"2007_CR7","doi-asserted-by":"publisher","first-page":"1553","DOI":"10.1137\/120869687","volume":"23","author":"C Cartis","year":"2013","unstructured":"Cartis, C., Gould, N.I.M., Toint, Ph.L.: 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 (2013). https:\/\/doi.org\/10.1137\/120869687","journal-title":"SIAM J. Optim."},{"key":"2007_CR8","doi-asserted-by":"publisher","unstructured":"Conn, A.R., Gould, N.I.M., Toint. Ph.L.: Trust-Region Methods, volume 1 of MPS\/SIAM Series on Optimization. SIAM, Philadelphia, USA (2000). https:\/\/doi.org\/10.1137\/1.9780898719857","DOI":"10.1137\/1.9780898719857"},{"issue":"6","key":"2007_CR9","doi-asserted-by":"publisher","first-page":"1269","DOI":"10.1007\/s11590-018-1316-0","volume":"13","author":"A Cristofari","year":"2018","unstructured":"Cristofari, A., Niri, T.D., Lucidi, S.: On global minimizers of quadratic functions with cubic regularization. Optim. Lett. 13(6), 1269\u20131283 (2018). https:\/\/doi.org\/10.1007\/s11590-018-1316-0","journal-title":"Optim. Lett."},{"issue":"2","key":"2007_CR10","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s101070100","volume":"29","author":"ED Dolan","year":"2002","unstructured":"Dolan, E.D., Mor\u00e9, J.J.: Benchmarking optimization software with performance profiles. Math. Progr. Ser. B 29(2), 201\u2013213 (2002). https:\/\/doi.org\/10.1007\/s101070100","journal-title":"Math. Progr. Ser. B"},{"issue":"2","key":"2007_CR11","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1080\/10556788.2017.1322080","volume":"33","author":"J-P Dussault","year":"2018","unstructured":"Dussault, J.-P.: ARCq: a new adaptive regularization by cubics. Optim. Method Softw. 33(2), 322\u2013335 (2018). https:\/\/doi.org\/10.1080\/10556788.2017.1322080","journal-title":"Optim. Method Softw."},{"issue":"2","key":"2007_CR12","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1080\/03155986.2019.1624490","volume":"58","author":"J-P Dussault","year":"2020","unstructured":"Dussault, J.-P.: A unified efficient implementation of trust-region type algorithms for unconstrained optimization. Infor 58(2), 290\u2013309 (2020). https:\/\/doi.org\/10.1080\/03155986.2019.1624490","journal-title":"Infor"},{"issue":"5","key":"2007_CR13","doi-asserted-by":"publisher","first-page":"2950","DOI":"10.1137\/10079687X","volume":"33","author":"DCL Fong","year":"2011","unstructured":"Fong, D.C.L., Saunders, M.A.: LSMR: an iterative algorithm for sparse least-squares problems. SIAM J. Sci. Comput. 33(5), 2950\u20132971 (2011). https:\/\/doi.org\/10.1137\/10079687X","journal-title":"SIAM J. Sci. Comput."},{"issue":"5","key":"2007_CR14","doi-asserted-by":"publisher","first-page":"1831","DOI":"10.1137\/S1064827596313310","volume":"20","author":"A Frommer","year":"1999","unstructured":"Frommer, A., Maass, P.: Fast CG-based methods for Tikhonov-Phillips regularization. SIAM J. Sci. Comput. 20(5), 1831\u20131850 (1999). https:\/\/doi.org\/10.1137\/S1064827596313310","journal-title":"SIAM J. Sci. Comput."},{"issue":"05","key":"2007_CR15","doi-asserted-by":"publisher","first-page":"635","DOI":"10.1142\/S0129183196000533","volume":"07","author":"U Gl\u00e4ssner","year":"1996","unstructured":"Gl\u00e4ssner, U., G\u00fcsken, S., Lippert, T., Ritzenh\u00f6fer, G., Schilling, K., Frommer, A.: How to compute Green\u2019s functions for entire mass trajectories within Krylov solvers. Int. J. Mod. Phys. C 07(05), 635\u2013644 (1996)","journal-title":"Int. J. Mod. Phys. C"},{"issue":"2","key":"2007_CR16","doi-asserted-by":"publisher","first-page":"304","DOI":"10.1080\/10556788.2019.1670177","volume":"35","author":"NIM Gould","year":"2019","unstructured":"Gould, N.I.M., Simoncini, V.: Error estimates for iterative algorithms for minimizing regularized quadratic subproblems. Optim. Method Softw. 35(2), 304\u2013328 (2019). https:\/\/doi.org\/10.1080\/10556788.2019.1670177","journal-title":"Optim. Method Softw."},{"issue":"2","key":"2007_CR17","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, Ph.L.: Solving the trust-region subproblem using the Lanczos method. SIAM J. Optim. 9(2), 504\u2013525 (1999). https:\/\/doi.org\/10.1137\/S1052623497322735","journal-title":"SIAM J. Optim."},{"issue":"4","key":"2007_CR18","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1145\/962437.962438","volume":"29","author":"NIM Gould","year":"2003","unstructured":"Gould, N.I.M., Orban, D., Toint, Ph.L.: GALAHAD, a library of thread-safe Fortran 90 packages for large-scale nonlinear optimization. ACM Trans. Math. Softw. 29(4), 353\u2013372 (2003). https:\/\/doi.org\/10.1145\/962437.962438","journal-title":"ACM Trans. Math. Softw."},{"issue":"1","key":"2007_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10589-011-9446-7","volume":"53","author":"NIM Gould","year":"2012","unstructured":"Gould, N.I.M., Porcelli, M., Toint, Ph.L.: Updating the regularization parameter in the adaptive cubic regularization algorithm. Comput. Optim. Appl. 53(1), 1\u201322 (2012). https:\/\/doi.org\/10.1007\/s10589-011-9446-7","journal-title":"Comput. Optim. Appl."},{"key":"2007_CR20","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, Ph.L.: CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization. Comput. Optim. Appl. 60, 545\u2013557 (2015). https:\/\/doi.org\/10.1007\/s10589-014-9687-3","journal-title":"Comput. Optim. Appl."},{"key":"2007_CR21","unstructured":"Griewank, A.: The modification of Newton\u2019s method for unconstrained optimization by bounding cubic terms. Technical Report NA\/12, Department of Applied Mathematics and Theoretical Physics, University of Cambridge (1981)"},{"issue":"6","key":"2007_CR22","doi-asserted-by":"publisher","first-page":"409","DOI":"10.6028\/jres.049.044","volume":"49","author":"MR Hestenes","year":"1952","unstructured":"Hestenes, M.R., Stiefel, E.: Methods of conjugate gradients for solving linear systems. J. Res. Natl. Bur. Stand. 49(6), 409\u2013436 (1952)","journal-title":"J. Res. Natl. Bur. Stand."},{"key":"2007_CR23","unstructured":"Jegerlehner, B.: Krylov space solvers for shifted linear systems. Technical Report IUHET-353, Indiana University, Department of Physics, Bloomington, IN, 1996. arXiv:hep-lat\/9612014"},{"issue":"2","key":"2007_CR24","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.: An accelerated first-order method with complexity analysis for solving cubic regularization subproblems. Comput. Optim. Appl. 79(2), 471\u2013506 (2021). https:\/\/doi.org\/10.1007\/s10589-021-00274-7","journal-title":"Comput. Optim. Appl."},{"issue":"4","key":"2007_CR25","doi-asserted-by":"publisher","first-page":"255","DOI":"10.6028\/jres.045.026","volume":"45","author":"C Lanczos","year":"1950","unstructured":"Lanczos, C.: An iteration method for the solution of the eigenvalue problem of linear differential and integral operators. J. Res. Natl. Bur. Stand. 45(4), 255\u2013282 (1950)","journal-title":"J. Res. Natl. Bur. Stand."},{"key":"2007_CR26","doi-asserted-by":"publisher","unstructured":"Montoison, A., Orban, D., and contributors. Krylov.jl: A Julia basket of hand-picked Krylov methods, June 2020. https:\/\/doi.org\/10.5281\/zenodo.822073. https:\/\/github.com\/JuliaSmoothOptimizers\/Krylov.jl","DOI":"10.5281\/zenodo.822073"},{"issue":"3","key":"2007_CR27","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1137\/0904038","volume":"4","author":"JJ Mor\u00e9","year":"1983","unstructured":"Mor\u00e9, J.J., Sorensen, D.C.: Computing a trust region step. SIAM J. Sci. Stat. Comput. 4(3), 553\u2013572 (1983). https:\/\/doi.org\/10.1137\/0904038","journal-title":"SIAM J. Sci. Stat. Comput."},{"key":"2007_CR28","doi-asserted-by":"publisher","unstructured":"Orban, D., Siqueira, A.S.: JuliaSmoothOptimizers: Infrastructure and solvers for continuous optimization in Julia, 2019. https:\/\/doi.org\/10.5281\/zenodo.2655082. https:\/\/www.juliasmoothoptimizers.github.io","DOI":"10.5281\/zenodo.2655082"},{"key":"2007_CR29","doi-asserted-by":"publisher","unstructured":"Orban, D., Siqueira, A.S., and contributors. CUTEst.jl: Julia\u2019s CUTEst interface (2020a). https:\/\/doi.org\/10.5281\/zenodo.1188851. https:\/\/github.com\/JuliaSmoothOptimizers\/CUTEst.jl","DOI":"10.5281\/zenodo.1188851"},{"key":"2007_CR30","doi-asserted-by":"publisher","unstructured":"Orban, D., Siqueira, A. S., and contributors. NLPModels.jl: Data structures for optimization models (2020b). https:\/\/doi.org\/10.5281\/zenodo.2558627. https:\/\/github.com\/JuliaSmoothOptimizers\/NLPModels.jl","DOI":"10.5281\/zenodo.2558627"},{"key":"2007_CR31","doi-asserted-by":"publisher","unstructured":"Orban, D., Siqueira, A. S., and contributors. SolverBenchmark.jl: Benchmark tools for solvers (2020c). https:\/\/doi.org\/10.5281\/zenodo.3948381. https:\/\/github.com\/JuliaSmoothOptimizers\/SolverBenchmark.jl","DOI":"10.5281\/zenodo.3948381"},{"key":"2007_CR32","doi-asserted-by":"publisher","unstructured":"Orban, D., Siqueira, A. S., and contributors. SolverTools.jl: Tools for developing nonlinear optimization solvers (2020d). https:\/\/doi.org\/10.5281\/zenodo.3937408. https:\/\/github.com\/JuliaSmoothOptimizers\/SolverTools.jl","DOI":"10.5281\/zenodo.3937408"},{"key":"2007_CR33","doi-asserted-by":"crossref","unstructured":"Ortega, J. M.: Numerical analysis: a second course. Number 3 in Class. Appl. Math. Soc. Indust. Appl. Math., Philadelphia, PA, 1990","DOI":"10.1137\/1.9781611971323"},{"issue":"4","key":"2007_CR34","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1137\/0712047","volume":"12","author":"CC Paige","year":"1975","unstructured":"Paige, C.C., Saunders, M.A.: Solution of sparse indefinite systems of linear equations. SIAM J. Numer. Anal. 12(4), 617\u2013629 (1975). https:\/\/doi.org\/10.1137\/0712047","journal-title":"SIAM J. Numer. Anal."},{"issue":"1","key":"2007_CR35","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1145\/355984.355989","volume":"8","author":"CC Paige","year":"1982","unstructured":"Paige, C.C., Saunders, M.A.: LSQR: an algorithm for sparse linear equations and sparse least squares. ACM Trans. Math. Softw. 8(1), 43\u201371 (1982). https:\/\/doi.org\/10.1145\/355984.355989","journal-title":"ACM Trans. Math. Softw."},{"issue":"3","key":"2007_CR36","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 J. Numer. Anal. 20(3), 626\u2013637 (1983). https:\/\/doi.org\/10.1137\/0720042","journal-title":"SIAM J. Numer. Anal."},{"key":"2007_CR37","unstructured":"Toint, Ph.: Towards an efficient sparsity exploiting Newton method for minimization. In I. S. Duff, editor, Sparse Matrices and Their Uses, pages 57\u201388. Academic press, 1981"},{"issue":"1","key":"2007_CR38","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/j.apnum.2003.11.010","volume":"49","author":"J van den Eshof","year":"2004","unstructured":"van den Eshof, J., Sleijpen, G.L.: Accurate conjugate gradient methods for families of shifted systems. Appl. Numer. Math. 49(1), 17\u201337 (2004). https:\/\/doi.org\/10.1016\/j.apnum.2003.11.010","journal-title":"Appl. Numer. Math."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-023-02007-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10107-023-02007-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-023-02007-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,7]],"date-time":"2024-08-07T15:10:08Z","timestamp":1723043408000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10107-023-02007-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,10,31]]},"references-count":38,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2024,9]]}},"alternative-id":["2007"],"URL":"https:\/\/doi.org\/10.1007\/s10107-023-02007-6","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,10,31]]},"assertion":[{"value":"2 April 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 June 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 October 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}