{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,9]],"date-time":"2025-06-09T17:10:01Z","timestamp":1749489001760,"version":"3.41.0"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T00:00:00Z","timestamp":1742947200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T00:00:00Z","timestamp":1742947200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2025,7]]},"DOI":"10.1007\/s10589-025-00676-x","type":"journal-article","created":{"date-parts":[[2025,3,29]],"date-time":"2025-03-29T17:53:29Z","timestamp":1743270809000},"page":"997-1031","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A multi-precision quadratic regularization method for unconstrained optimization with rounding error analysis"],"prefix":"10.1007","volume":"91","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5482-6831","authenticated-orcid":false,"given":"Dominique","family":"Monnet","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dominique","family":"Orban","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,3,26]]},"reference":[{"key":"676_CR1","first-page":"1796","volume":"33","author":"X Sun","year":"2020","unstructured":"Sun, X., Wang, N., Chen, C.-Y., Ni, J., Agrawal, A., Cui, X., Venkataramani, S., El Maghraoui, K., Srinivasan, V.V., Gopalakrishnan, K.: Ultra-low precision 4-bit training of deep neural networks. Adv. Neural. Inf. Process. Syst. 33, 1796\u20131807 (2020)","journal-title":"Adv. Neural. Inf. Process. Syst."},{"key":"676_CR2","unstructured":"Wang, N., Choi, J., Brand, D., Chen, C.-Y., Gopalakrishnan, K.: Training deep neural networks with 8-bit floating point numbers. Adv. Neural Inf. Process. Syst. 31 (2018)"},{"issue":"7","key":"676_CR3","doi-asserted-by":"publisher","first-page":"913","DOI":"10.1109\/TC.2010.121","volume":"60","author":"S Galal","year":"2010","unstructured":"Galal, S., Horowitz, M.: Energy-efficient floating-point unit design. IEEE Trans. Comput. 60(7), 913\u2013922 (2010)","journal-title":"IEEE Trans. Comput."},{"key":"676_CR4","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, Ph.L.: Trust Region Methods. SIAM, Philadelphia (2000)"},{"issue":"3","key":"676_CR5","doi-asserted-by":"publisher","first-page":"917","DOI":"10.1007\/s10589-020-00190-2","volume":"76","author":"S Gratton","year":"2020","unstructured":"Gratton, S., Toint, Ph.L.: A note on solving nonlinear optimization problems in variable precision. Comput. Optim. Appl. 76(3), 917\u2013933 (2020)","journal-title":"Comput. Optim. Appl."},{"key":"676_CR6","unstructured":"Sun, S., Nocedal, J.: A trust region method for the optimization of noisy functions. arXiv preprint arXiv:2201.00973 (2022)"},{"issue":"3","key":"676_CR7","doi-asserted-by":"publisher","first-page":"1238","DOI":"10.1137\/130915984","volume":"24","author":"AS Bandeira","year":"2014","unstructured":"Bandeira, A.S., Scheinberg, K., Vicente, L.N.: Convergence of trust-region methods based on probabilistic models. SIAM J. Optim. 24(3), 1238\u20131264 (2014)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"676_CR8","doi-asserted-by":"publisher","first-page":"1579","DOI":"10.1093\/imanum\/drx043","volume":"38","author":"S Gratton","year":"2018","unstructured":"Gratton, S., Royer, C.W., Vicente, L.N., Zhang, Z.: Complexity and global rates of trust-region methods based on probabilistic models. IMA J. Numer. Anal. 38(3), 1579\u20131597 (2018)","journal-title":"IMA J. Numer. Anal."},{"issue":"2","key":"676_CR9","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1287\/ijoo.2019.0016","volume":"1","author":"J Blanchet","year":"2019","unstructured":"Blanchet, J., Cartis, C., Menickelly, M., Scheinberg, K.: Convergence rate analysis of a stochastic trust-region method via supermartingales. INFORMS J. Optim. 1(2), 92\u2013119 (2019)","journal-title":"INFORMS J. Optim."},{"key":"676_CR10","doi-asserted-by":"crossref","unstructured":"Cao, L., Berahas, A.S., Scheinberg, K.: First-and second-order high probability complexity bounds for trust-region methods with noisy oracles. arXiv preprint arXiv:2205.03667 (2022)","DOI":"10.1007\/s10107-023-01999-5"},{"issue":"2","key":"676_CR11","doi-asserted-by":"publisher","first-page":"700","DOI":"10.1007\/s10957-022-02153-5","volume":"196","author":"S Bellavia","year":"2023","unstructured":"Bellavia, S., Gurioli, G., Morini, B., Toint, P.L.: The impact of noise on evaluation complexity: the deterministic trust-region case. J. Optim. Theory Appl. 196(2), 700\u2013729 (2023). https:\/\/doi.org\/10.1007\/s10957-022-02153-5","journal-title":"J. Optim. Theory Appl."},{"issue":"4","key":"676_CR12","doi-asserted-by":"publisher","first-page":"1662","DOI":"10.1093\/imanum\/drr035","volume":"32","author":"C Cartis","year":"2012","unstructured":"Cartis, C., Gould, N.I.M., Toint, Ph.L.: An adaptive cubic regularization algorithm for nonconvex optimization with convex constraints and its function-evaluation complexity. IMA J. Numer. Anal. 32(4), 1662\u20131695 (2012)","journal-title":"IMA J. Numer. Anal."},{"key":"676_CR13","doi-asserted-by":"crossref","unstructured":"Cartis, C., Gould, N.I.M., Toint, Ph.L.: Worst-case evaluation complexity and optimality of second-order methods for nonconvex smooth optimization. In: Proceedings of the International Congress of Mathematicians: Rio de Janeiro 2018, pp. 3711\u20133750 (2018). World Scientific","DOI":"10.1142\/9789813272880_0198"},{"key":"676_CR14","doi-asserted-by":"publisher","DOI":"10.1016\/j.jco.2021.101591","volume":"68","author":"S Bellavia","year":"2022","unstructured":"Bellavia, S., Gurioli, G., Morini, B., Toint, P.L.: Adaptive regularization for nonconvex optimization using inexact function values and randomly perturbed derivatives. J. Complex. 68, 101591 (2022). https:\/\/doi.org\/10.1016\/j.jco.2021.101591","journal-title":"J. Complex."},{"issue":"3","key":"676_CR15","doi-asserted-by":"publisher","first-page":"791","DOI":"10.1007\/s00211-018-0977-z","volume":"140","author":"S Bellavia","year":"2018","unstructured":"Bellavia, S., Gratton, S., Riccietti, E.: A Levenberg-Marquardt method for large nonlinear least-squares problems with dynamic accuracy in functions and gradients. Numer. Math. 140(3), 791\u2013825 (2018)","journal-title":"Numer. Math."},{"issue":"1","key":"676_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10107-020-01466-5","volume":"187","author":"S Gratton","year":"2021","unstructured":"Gratton, S., Simon, E., Toint, Ph.L.: An algorithm for the minimization of nonsmooth nonconvex functions using inexact evaluations and its worst-case complexity. Math. Program. 187(1), 1\u201324 (2021)","journal-title":"Math. Program."},{"issue":"2","key":"676_CR17","doi-asserted-by":"publisher","first-page":"900","DOI":"10.1137\/21M1409536","volume":"32","author":"AY Aravkin","year":"2022","unstructured":"Aravkin, A.Y., Baraldi, R., Orban, D.: A proximal quasi-newton trust-region method for nonsmooth regularized optimization. SIAM J. Optim. 32(2), 900\u2013929 (2022)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"676_CR18","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, Ph.L.: Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models. Math. Program. 163(1), 359\u2013368 (2017)","journal-title":"Math. Program."},{"key":"676_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/IEEESTD.2008.4610935","volume":"754\u20132008","author":"IEEE standard for floating-point arithmetic","year":"2008","unstructured":"IEEE standard for floating-point arithmetic: IEEE Std 754\u20132008, 1\u201370 (2008). https:\/\/doi.org\/10.1109\/IEEESTD.2008.4610935","journal-title":"IEEE Std"},{"key":"676_CR20","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718027","volume-title":"Accuracy and Stability of Numerical Algorithms","author":"NJ Higham","year":"2002","unstructured":"Higham, N.J.: Accuracy and Stability of Numerical Algorithms. SIAM, Philadelphia (2002)"},{"key":"676_CR21","unstructured":"Castaldo, A.M.: Error analysis of various forms of floating point dot products. Technical report, The University of Texas at San Antonio (2007)"},{"issue":"2","key":"676_CR22","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1137\/120894488","volume":"34","author":"C-P Jeannerod","year":"2013","unstructured":"Jeannerod, C.-P., Rump, S.M.: Improved error bounds for inner products in floating-point arithmetic. SIAM J. Matrix Anal. Appl. 34(2), 338\u2013344 (2013)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"676_CR23","unstructured":"Monnet, D., and contributors: MultiPrecisionR2.jl. https:\/\/github.com\/JuliaSmoothOptimizers\/MultiPrecisionR2"},{"key":"676_CR24","doi-asserted-by":"publisher","unstructured":"Orban, D., Siqueira, A.S., and contributors: OptimizationProblems.jl: A collection of optimization problems in JuMP syntax. https:\/\/github.com\/JuliaSmoothOptimizers\/OptimizationProblems.jl (2021). https:\/\/doi.org\/10.5281\/zenodo.3672094","DOI":"10.5281\/zenodo.3672094"},{"key":"676_CR25","unstructured":"Sanders, D.P., and contributors: JuliaIntervals Guaranteed Computations. https:\/\/juliaintervals.github.io\/"},{"key":"676_CR26","unstructured":"JSOSolvers.jl. https:\/\/github.com\/JuliaSmoothOptimizers\/JSOSolvers.jl"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-025-00676-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-025-00676-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-00676-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,9]],"date-time":"2025-06-09T16:52:53Z","timestamp":1749487973000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-025-00676-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3,26]]},"references-count":26,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,7]]}},"alternative-id":["676"],"URL":"https:\/\/doi.org\/10.1007\/s10589-025-00676-x","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"type":"print","value":"0926-6003"},{"type":"electronic","value":"1573-2894"}],"subject":[],"published":{"date-parts":[[2025,3,26]]},"assertion":[{"value":"4 January 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 February 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 March 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"All authors have no Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}