{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,7]],"date-time":"2025-07-07T09:46:51Z","timestamp":1751881611284},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1997,3,1]],"date-time":"1997-03-01T00:00:00Z","timestamp":857174400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computing"],"published-print":{"date-parts":[[1997,3]]},"DOI":"10.1007\/bf02684470","type":"journal-article","created":{"date-parts":[[2007,8,8]],"date-time":"2007-08-08T05:10:29Z","timestamp":1186549829000},"page":"31-46","source":"Crossref","is-referenced-by-count":22,"title":["A method of trust region type for minimizing noisy functions"],"prefix":"10.1007","volume":"58","author":[{"given":"C.","family":"Elster","sequence":"first","affiliation":[]},{"given":"A.","family":"Neumaier","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF02684470_CR1","volume-title":"Algorithms for minimization without derivatives","author":"R. P. Brent","year":"1973","unstructured":"Brent, R. P.: Algorithms for minimization without derivatives. Englewood Cliffs: Prentice-Hall, 1973."},{"key":"BF02684470_CR2","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1016\/0010-4485(73)90150-4","volume":"5","author":"L. C. W. Dixon","year":"1973","unstructured":"Dixon, L. C. W.: ACSIM \u2014 an accelerated constrained simplex technique. Comput. Aided Des.5, 22\u201332 (1973).","journal-title":"Comput. Aided Des."},{"key":"BF02684470_CR3","doi-asserted-by":"crossref","first-page":"585","DOI":"10.1093\/imanum\/15.4.585","volume":"15","author":"C. Elster","year":"1995","unstructured":"Elster, C., Neumaier, A.: A grid algorithm for bound constrained optimization of noisy functions. IMA J. Numer. Anal.15, 585\u2013608 (1995).","journal-title":"IMA J. Numer. Anal."},{"key":"BF02684470_CR4","volume-title":"Practical methods of optimization","author":"R. Fletcher","year":"1987","unstructured":"Fletcher, R.: Practical methods of optimization, New York: Wiley, 1987."},{"key":"BF02684470_CR5","volume-title":"Practical optimization","author":"E. Gill","year":"1981","unstructured":"Gill, E., Murray, W., Wright, M.H.: Practical optimization. London: Academic Press, 1981."},{"key":"BF02684470_CR6","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1007\/BF01932287","volume":"17","author":"T. Glad","year":"1977","unstructured":"Glad, T., Goldstein, A.: Optimization of functions whose values are subject to small errors. BIT17, 160\u2013169, (1977).","journal-title":"BIT"},{"key":"BF02684470_CR7","unstructured":"Karidis, J. P., Turns, S. R.: Efficient optimization of computationally expensive objective functions. IBM Research Report RC10698 (#47972): Yorktown Heights, NY (1984)."},{"key":"BF02684470_CR8","first-page":"256","volume-title":"Mathematical programming: the state of the art","author":"J. J. Mor\u00e9","year":"1983","unstructured":"Mor\u00e9, J. J.: Recent developments in algorithms and software for trust region methods. In: Mathematical programming: the state of the art (Bachem, A. et al., eds.), pp. 256\u2013287. Berlin: Springer, 1983."},{"key":"BF02684470_CR9","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1145\/355934.355936","volume":"7","author":"J. J. Mor\u00e9","year":"1981","unstructured":"Mor\u00e9, J. J., Garbow, B. S., Hillstrom, K. E.: Testing unconstrained optimization software. ACM Trans. Math. Software7, 17\u201341 (1981).","journal-title":"ACM Trans. Math. Software"},{"key":"BF02684470_CR10","doi-asserted-by":"crossref","first-page":"553","DOI":"10.1137\/0904038","volume":"4","author":"J. J. Mor\u00e9","year":"1983","unstructured":"Mor\u00e9, J. J., Sorensen, D. C.: Computing a trust region step. SIAM J. Sci. Stat. Comput4, 553\u2013572 (1983).","journal-title":"SIAM J. Sci. Stat. Comput"},{"key":"BF02684470_CR11","unstructured":"Numerical Algorithm Group (NAG), Fortran Library Mark 14. Oxford, 1990."},{"key":"BF02684470_CR12","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1093\/comjnl\/7.4.308","volume":"7","author":"J. A. Nelder","year":"1965","unstructured":"Nelder, J. A., Mead, R.: A simplex method for function minimization. Comput. J.7, 308 (1965).","journal-title":"Comput. J."},{"key":"BF02684470_CR13","first-page":"199","volume-title":"Acta numerica 1992","author":"J. Nocedal","year":"1992","unstructured":"Nocedal, J.: Theory of algorithms for unconstrained optimization. In: Acta numerica 1992 (Iserles, A., ed.), pp. 199\u2013242. Cambridge: Cambridge University Press, 1992."},{"key":"BF02684470_CR14","first-page":"220","volume-title":"ICIAM 1987 Proceedings","author":"M. J. D. Powell","year":"1988","unstructured":"Powell, M. J. D.: A review of algorithms for nonlinear equations and unconstrained optimization. In: ICIAM 1987 Proceedings (McKenna, J., Temam, R., eds.), pp. 220\u2013232. Philadelphia: SIAM, 1988."},{"key":"BF02684470_CR15","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1137\/0801010","volume":"1","author":"V. Torczon","year":"1991","unstructured":"Torczon, V.: On the convergence of the multidimensional search algorithm. SIAM J. Optim.1, 123\u2013145 (1991).","journal-title":"SIAM J. Optim."},{"key":"BF02684470_CR16","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1093\/imamat\/12.3.339","volume":"12","author":"D. Winfield","year":"1973","unstructured":"Winfield, D.: Function minimization by interpolation in a data table. J. Inst. Math. Appl.12, 339\u2013348 (1973).","journal-title":"J. Inst. Math. Appl."}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02684470.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02684470\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02684470","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,18]],"date-time":"2019-05-18T22:22:40Z","timestamp":1558218160000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02684470"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,3]]},"references-count":16,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1997,3]]}},"alternative-id":["BF02684470"],"URL":"https:\/\/doi.org\/10.1007\/bf02684470","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"value":"0010-485X","type":"print"},{"value":"1436-5057","type":"electronic"}],"subject":[],"published":{"date-parts":[[1997,3]]}}}