{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T15:00:02Z","timestamp":1776870002878,"version":"3.51.2"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2020,5,7]],"date-time":"2020-05-07T00:00:00Z","timestamp":1588809600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,5,7]],"date-time":"2020-05-07T00:00:00Z","timestamp":1588809600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2020,7]]},"DOI":"10.1007\/s10589-020-00190-2","type":"journal-article","created":{"date-parts":[[2020,5,7]],"date-time":"2020-05-07T05:34:54Z","timestamp":1588829694000},"page":"917-933","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["A note on solving nonlinear optimization problems in variable precision"],"prefix":"10.1007","volume":"76","author":[{"given":"S.","family":"Gratton","sequence":"first","affiliation":[]},{"given":"Ph. L.","family":"Toint","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,5,7]]},"reference":[{"key":"190_CR1","doi-asserted-by":"publisher","first-page":"2526","DOI":"10.1016\/j.cpc.2008.11.005","volume":"180","author":"M Baboulin","year":"2009","unstructured":"Baboulin, M., Buttari, A., Dongarra, J., Kurzak, J., Langou, J., Luszczek, P., Tomov, S.: Accelerating scientific computations with mixed precision algorithms. Comput. Phys. Commun. 180, 2526\u20132533 (2009)","journal-title":"Comput. Phys. Commun."},{"key":"190_CR2","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\u2013Marquardt method for large nonlinear least-squares problems with dynamic accuracy in functions and gradients. Numer. Math. 140, 791\u2013825 (2018)","journal-title":"Numer. Math."},{"key":"190_CR3","unstructured":"Bellavia, S., Gurioli, G., Morini, B.: Theoretical study of an adaptive cubic regularization method with dynamic inexact Hessian information (2018). arXiv:1808.06239"},{"issue":"4","key":"190_CR4","doi-asserted-by":"publisher","first-page":"2881","DOI":"10.1137\/18M1226282","volume":"29","author":"S Bellavia","year":"2019","unstructured":"Bellavia, S., Gurioli, G., Morini, B., Toint, Ph.L.: Adaptive regularization algorithms with inexact evaluations for nonconvex optimization. SIAM J. Optim. 29(4), 2881\u20132915 (2019)","journal-title":"SIAM J. Optim."},{"key":"190_CR5","unstructured":"Bergou, E., Diouane, Y., Kungurtsev, V., Royer, C.W.: A subsampling line-search method with second-order results (2018). arXiv:1810.07211"},{"issue":"2","key":"190_CR6","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":"190_CR7","unstructured":"Brown, A.A., Bartholomew-Biggs, M.: Some effective methods for unconstrained optimization based on the solution of ordinary differential equations. Technical Report Technical Report 178, Hatfield Polytechnic, Hatfield, UK (1987)"},{"key":"190_CR8","unstructured":"Buckley, A.G.: Test functions for unconstrained minimization. Technical Report CS-3, Computing Science Division, Dalhousie University, Dalhousie, Canada (1989)"},{"key":"190_CR9","unstructured":"Carter, R.G.: A worst-case example using linesearch methods for numerical optimization with inexact gradient evaluations. Technical Report MCS-P283-1291, Argonne National Laboratory, Argonne, USA (1991)"},{"issue":"2","key":"190_CR10","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1137\/0914023","volume":"14","author":"RG Carter","year":"1993","unstructured":"Carter, R.G.: Numerical experience with a class of algorithms for nonlinear optimization using inexact function and gradient information. SIAM J. Sci. Stat. Comput. 14(2), 368\u2013388 (1993)","journal-title":"SIAM J. Sci. Stat. Comput."},{"key":"190_CR11","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: The Proceedings of the 2018 International Conference of Mathematicians (ICM 2018), Rio de Janeiro (2018)","DOI":"10.1142\/9789813272880_0198"},{"issue":"2","key":"190_CR12","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/s10107-017-1137-4","volume":"159","author":"C Cartis","year":"2018","unstructured":"Cartis, C., Scheinberg, K.: Global convergence rate analysis of unconstrained optimization methods based on probabilistic models. Math. Program. Ser. A 159(2), 337\u2013375 (2018)","journal-title":"Math. Program. Ser. A"},{"key":"190_CR13","unstructured":"Chen, X., Jiang, B., Lin, T., Zhang, S.: On adaptive cubic regularization Newton\u2019s methods for convex optimization via random sampling (2018). arXiv:1802.05426"},{"key":"190_CR14","doi-asserted-by":"crossref","unstructured":"Conn, A.R., Gould, N.I.M., Lescrenier, M., Toint, Ph.L.: Performance of a multifrontal scheme for partially separable optimization. In: Gomez, S., Hennart, J.P. (eds.) Advances in Optimization and Numerical Analysis. Proceedings of the Sixth Workshop on Optimization and Numerical Analysis, Oaxaca, Mexico, vol. 275, pp. 79\u201396. Kluwer Academic Publishers, Dordrecht (1994)","DOI":"10.1007\/978-94-015-8330-5_6"},{"key":"190_CR15","doi-asserted-by":"crossref","unstructured":"Conn, A.R., Gould, N.I.M., Toint, Ph.L.: LANCELOT: a Fortran package for large-scale nonlinear optimization (Release A). Number 17 in Springer Series in Computational Mathematics. Springer, Heidelberg (1992)","DOI":"10.1007\/978-3-662-12211-2"},{"key":"190_CR16","volume-title":"Trust-Region Methods. MPS-SIAM Series on Optimization","author":"AR Conn","year":"2000","unstructured":"Conn, A.R., Gould, N.I.M., Toint, Ph.L.: Trust-Region Methods. MPS-SIAM Series on Optimization. SIAM, Philadelphia (2000)"},{"key":"190_CR17","unstructured":"Dixon, L.C.W., Maany, Z.: A family of test problems with sparse Hessian for unconstrained optimization. Technical Report 206, Numerical Optimization Center, Hatfield Polytechnic, Hatfield, UK (1988)"},{"issue":"1","key":"190_CR18","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/BF02684470","volume":"58","author":"C Elster","year":"1997","unstructured":"Elster, C., Neumaier, A.: A method of trust region type for minimizing noisy functions. Computing 58(1), 31\u201346 (1997)","journal-title":"Computing"},{"issue":"7","key":"190_CR19","doi-asserted-by":"publisher","first-page":"913","DOI":"10.1109\/TC.2010.121","volume":"60","author":"S Galal","year":"2011","unstructured":"Galal, S., Horowitz, M.: Energy-efficient floating-point unit design. IEEE Trans. Comput. 60(7), 913\u2013922 (2011)","journal-title":"IEEE Trans. Comput."},{"issue":"3","key":"190_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(3), 545\u2013557 (2015)","journal-title":"Comput. Optim. Appl."},{"key":"190_CR21","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/BF01399316","volume":"39","author":"A Griewank","year":"1982","unstructured":"Griewank, A., Toint, Ph.L.: Partitioned variable metric updates for large structured optimization problems. Numer. Math. 39, 119\u2013137 (1982)","journal-title":"Numer. Math."},{"key":"190_CR22","doi-asserted-by":"crossref","unstructured":"Higham, N.J.: The rise of multiprecision computations. Talk at SAMSI 2017. https:\/\/bit.ly\/higham-samsi17(2017)","DOI":"10.1109\/ARITH.2017.24"},{"key":"190_CR23","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1145\/2742482","volume":"58","author":"L Kugler","year":"2015","unstructured":"Kugler, L.: Is \u201cgood enough\u201d computing good enough? Commun. ACM 58, 12\u201314 (2015)","journal-title":"Commun. ACM"},{"key":"190_CR24","unstructured":"Leyffer, S., Wild, S., Fagan, M., Snir, M., Palem, K., Yoshii, K., Finkel, H.: Moore with less\u2014leapgrogging Moore\u2019s law with inexactness for supercomputing (2016). arXiv:1610.02606v2 (to appear in Proceedings of PMES 2018: 3rd International Workshop on Post Moore\u2019s Era Supercomputing)"},{"issue":"5","key":"190_CR25","doi-asserted-by":"publisher","first-page":"1181","DOI":"10.1137\/0725067","volume":"25","author":"G Li","year":"1988","unstructured":"Li, G.: The secant\/finite difference algorithm for solving sparse nonlinear systems of equations. SIAM J. Numer. Anal. 25(5), 1181\u20131196 (1988)","journal-title":"SIAM J. Numer. Anal."},{"key":"190_CR26","unstructured":"Matsuoka, S.: Private communication (2018)"},{"issue":"1","key":"190_CR27","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1145\/355934.355936","volume":"7","author":"JJ Mor\u00e9","year":"1981","unstructured":"Mor\u00e9, J.J., Garbow, B.S., Hillstrom, K.E.: Testing unconstrained optimization software. ACM Trans. Math. Softw. 7(1), 17\u201341 (1981)","journal-title":"ACM Trans. Math. Softw."},{"key":"190_CR28","doi-asserted-by":"publisher","DOI":"10.1007\/b98874","volume-title":"Numerical Optimization. Series in Operations Research","author":"J Nocedal","year":"1999","unstructured":"Nocedal, J., Wright, S.J.: Numerical Optimization. Series in Operations Research. Springer, Heidelberg (1999)"},{"key":"190_CR29","doi-asserted-by":"publisher","first-page":"20130281","DOI":"10.1098\/rsta.2013.0281","volume":"372","author":"KV Palem","year":"2014","unstructured":"Palem, K.V.: Inexactness and a future of computing. Philos. Trans. R. Soc. A 372, 20130281 (2014)","journal-title":"Philos. Trans. R. Soc. A"},{"key":"190_CR30","first-page":"101","volume":"20","author":"G Poenisch","year":"1981","unstructured":"Poenisch, G., Schwetlick, H.: Computing turning points of curves implicitly defined by nonlinear equations depending on a parameter. Computing 20, 101\u2013121 (1981)","journal-title":"Computing"},{"key":"190_CR31","unstructured":"Pu, J., Galal, S., Yang, X., Shacham, O., Horowitz, M.: FPMax: a 106GFLOPS\/W at 217GFLOPS\/mm2 single-precision FPU, and a 43.7 GFLOPS\/W at 74.6 GFLOPS\/mm2 double-precision FPU, in 28nm UTBB FDSOI. In: Hardware Architecture (2016)"},{"key":"190_CR32","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/BF02165118","volume":"15","author":"JW Schmidt","year":"1970","unstructured":"Schmidt, J.W., Vetters, K.: Albeitungsfreie verfahren fur nichtlineare optimierungsproblem. Numer. Math. 15, 263\u2013282 (1970)","journal-title":"Numer. Math."},{"key":"190_CR33","unstructured":"Spedicato, E.: Computational experience with quasi-Newton algorithms for minimization problems of moderately large size. Technical Report CISE-N-175, CISE Documentation Service, Segrate, Milano (1975)"},{"key":"190_CR34","unstructured":"Wang, N., Choi, J., Brand, D., Chen, C.-Y., Gopalakrishnan, K.: Training deep neural networks with 8-bit floating point numbers. In: 32nd Conference on Neural Information Processing Systems (2018). arXiv:1812.08011"},{"key":"190_CR35","unstructured":"Xu, P., Roosta-Khorasani, F., Mahoney, M.W.: Newton-type methods for non-convex optimization under inexact Hessian information (2017). arXiv:1708.07164v3"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-020-00190-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-020-00190-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-020-00190-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,23]],"date-time":"2022-10-23T06:30:28Z","timestamp":1666506628000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-020-00190-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,5,7]]},"references-count":35,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2020,7]]}},"alternative-id":["190"],"URL":"https:\/\/doi.org\/10.1007\/s10589-020-00190-2","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,5,7]]},"assertion":[{"value":"17 December 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 May 2020","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}