{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T22:44:02Z","timestamp":1743029042892,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642019692"},{"type":"electronic","value":"9783642019708"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-01970-8_49","type":"book-chapter","created":{"date-parts":[[2009,5,19]],"date-time":"2009-05-19T18:26:23Z","timestamp":1242757583000},"page":"501-510","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Experience with Approximations in the Trust-Region Parallel Direct Search Algorithm"],"prefix":"10.1007","author":[{"given":"S. M.","family":"Shontz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"V. E.","family":"Howle","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P. D.","family":"Hough","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"49_CR1","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1137\/0801027","volume":"1","author":"J.E. Dennis Jr.","year":"1991","unstructured":"Dennis Jr., J.E., Torczon, V.: Direct Search Methods on Parallel Machines. SIAM J. Optimiz.\u00a01(4), 448\u2013474 (1991)","journal-title":"SIAM J. Optimiz."},{"issue":"11","key":"49_CR2","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/0895-7177(93)90204-C","volume":"18","author":"L. Ingber","year":"1993","unstructured":"Ingber, L.: Simulated Annealing: Practice Versus Theory. Math. Comput. Model.\u00a018(11), 29\u201357 (1993)","journal-title":"Math. Comput. Model."},{"key":"49_CR3","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1007\/BF01582012","volume":"33","author":"P.J.M. Laarhoven","year":"1985","unstructured":"Laarhoven, P.J.M.: Parallel Variable Metric Algorithms for Unconstrained Optimization. Math. Program.\u00a033, 68\u201381 (1985)","journal-title":"Math. Program."},{"key":"49_CR4","unstructured":"Phua, P.K.-H., Zeng, Y.: Parallel Quasi-Newton Algorithms for Large-Scale Optimization. Tech. Report TRB2\/95, National Univ. of Singapore, Singapore (1995)"},{"key":"49_CR5","unstructured":"Straeter, T.A.: A Parallel Variable Metric Optimization Algorithm. Tech. Report NASA TN D-7329, NASA, Langley Research Center, Hampton, VA (1973)"},{"key":"49_CR6","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/BF01589407","volume":"42","author":"R.H. Byrd","year":"1988","unstructured":"Byrd, R.H., Schnabel, R.B., Shultz, G.A.: Parallel Quasi-Newton Methods For Unconstrained Optimization. Math. Program.\u00a042, 273\u2013306 (1988)","journal-title":"Math. Program."},{"issue":"1","key":"49_CR7","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1137\/S1052623498343799","volume":"13","author":"P.D. Hough","year":"2002","unstructured":"Hough, P.D., Meza, J.C.: A Class of Trust-Region Methods for Parallel Optimization. SIAM J. Optimiz.\u00a013(1), 264\u2013282 (2002)","journal-title":"SIAM J. Optimiz."},{"issue":"1","key":"49_CR8","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/BF01197433","volume":"15","author":"N. Alexandrov","year":"1998","unstructured":"Alexandrov, N., Dennis Jr., J.E., Lewis, R.M., Torczon, V.: A Trust Region Framework for Managing the Use of Approximation Models in Optimization. J. Struct. Optimiz.\u00a015(1), 16\u201323 (1998)","journal-title":"J. Struct. Optimiz."},{"key":"49_CR9","unstructured":"Dennis Jr., J.E.: Surrogate Modelling and Space Mapping for Engineering Optimization: A Summary of the Danish Technical University November 2000 Workshop. Tech. Report CAAM-TR00-35, Rice University, Houston, TX (2000)"},{"issue":"1","key":"49_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01197708","volume":"17","author":"A.J. Booker","year":"1999","unstructured":"Booker, A.J., Dennis Jr., J.E., Frank, P.D., Serafini, D.B., Torczon, V., Trosset, M.W.: A Rigorous Framework for Optimization of Expensive Functions by Surrogates. J. Struct. Optimiz.\u00a017(1), 1\u201313 (1999)","journal-title":"J. Struct. Optimiz."},{"key":"49_CR11","doi-asserted-by":"crossref","unstructured":"Giunta, A.A., Eldred, M.S.: Implementation of a Trust Region Model Management Strategy in the DAKOTA Optimization Toolkit. In: Proceedings of 8th AIAA\/NASA\/ISSMO Symposium on Multidisciplinary Analysis and Optimization, Long Beach, CA (2000)","DOI":"10.2514\/6.2000-4935"},{"key":"49_CR12","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1080\/10556780008805795","volume":"14","author":"S.G. Nash","year":"2000","unstructured":"Nash, S.G.: A Multigrid Approach to Discretized Optimization Problems. Optim. Method. Softw.\u00a014, 99\u2013116 (2000)","journal-title":"Optim. Method. Softw."},{"key":"49_CR13","unstructured":"Siefert, C.M.: Model-Assisted Pattern Search. Honors Thesis, Department of Computer Science, College of William & Mary, Williamsburg, VA (2000), \nhttp:\/\/www.cs.wm.edu\/~va\/CS495\/siefert.ps.gz"},{"key":"49_CR14","doi-asserted-by":"crossref","unstructured":"Koteras, J.R., Guillerud, A.S., Crane, N.K., Hales, J.D., Reinert, R.K.: Presto Users Guide 2.7. Tech. Report SAND2007-3749, Sandia National Laboratories, Albuquerque, NM (2007)","DOI":"10.2172\/926372"},{"key":"49_CR15","doi-asserted-by":"crossref","unstructured":"Brown, K.H., Summers, R.M., Glass, M.W., Guillerud, A.S., Heinstein, M.W., Jones, R.E.: ACME: Algorithms for Contact in a Multiphysics Environment, API Version 1.0. Tech. Report SAND2001-3318, Sandia National Laboratories, Albuquerque, NM (2001)","DOI":"10.2172\/789572"},{"key":"49_CR16","unstructured":"Owen, S.J.: CUBIT Geometry and Mesh Generation Toolkit (2006), \nhttp:\/\/www.cubit.sandia.gov"},{"key":"49_CR17","doi-asserted-by":"crossref","unstructured":"Meza, J.C., Hough, P.D., Williams, P.J., Oliva, R.A.: OPT++ 2.4 Documentation (2007), \nhttp:\/\/csmr.ca.sandia.gov\/opt++\/opt++2.4_doc\/html\/index.html","DOI":"10.1145\/1236463.1236467"},{"key":"49_CR18","unstructured":"Martinez-Canales, M.L., Swiler, L.P., Hough, P.D., Gray, G.A., Chiesa, M.L., Heaphy, R., Thomas, S.W., Trucano, T.G., Lee, H.K.H., Taddy, M., Gramacy, R.B.: Penetrator Reliability Investigation and Design Exploration. Tech. Report SAND2006-7669, Sandia National Laboratories, Livermore, CA (2006)"},{"key":"49_CR19","volume-title":"Practical Optimization","author":"P.E. Gill","year":"1981","unstructured":"Gill, P.E., Murray, W., Wright, M.H.: Practical Optimization. Academic Press, London (1981)"}],"container-title":["Lecture Notes in Computer Science","Computational Science \u2013 ICCS 2009"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-01970-8_49","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,24]],"date-time":"2021-12-24T09:13:23Z","timestamp":1640337203000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-01970-8_49"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642019692","9783642019708"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-01970-8_49","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]},"assertion":[{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}