{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,31]],"date-time":"2024-07-31T19:11:57Z","timestamp":1722453117322},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2011,12,16]],"date-time":"2011-12-16T00:00:00Z","timestamp":1323993600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2013,3]]},"DOI":"10.1007\/s11590-011-0428-6","type":"journal-article","created":{"date-parts":[[2011,12,15]],"date-time":"2011-12-15T07:57:34Z","timestamp":1323935854000},"page":"421-433","source":"Crossref","is-referenced-by-count":6,"title":["Efficient use of parallelism in algorithmic parameter optimization applications"],"prefix":"10.1007","volume":"7","author":[{"given":"C.","family":"Audet","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C.-K.","family":"Dang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D.","family":"Orban","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,12,16]]},"reference":[{"key":"428_CR1","unstructured":"Abramson, M., Audet, C., Couture, G., Dennis, J. Jr., Le Digabel, S.: The NOMAD project. Software available at http:\/\/www.gerad.ca\/nomad"},{"issue":"2","key":"428_CR2","doi-asserted-by":"crossref","first-page":"948","DOI":"10.1137\/080716980","volume":"20","author":"M. Abramson","year":"2009","unstructured":"Abramson M., Audet C., Dennis J. Jr., Le Digabel S.: OrthoMADS: a deterministic MADS instance with orthogonal directions. SIAM. J. Optim. 20(2), 948\u2013966 (2009). doi: 10.1137\/080716980","journal-title":"SIAM. J. Optim."},{"issue":"2","key":"428_CR3","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1007\/s10898-007-9234-1","volume":"41","author":"C. Audet","year":"2008","unstructured":"Audet C., B\u00e9chard V., Le Digabel S.: Nonsmooth optimization through mesh adaptive direct search and variable neighborhood search. J. Glob. Optim. 41(2), 299\u2013318 (2008). doi: 10.1007\/s10898-007-9234-1","journal-title":"J. Glob. Optim."},{"key":"428_CR4","doi-asserted-by":"crossref","unstructured":"Audet, C., Dang, C.K., Orban, D.: Algorithmic parameter optimization of the DFO method with the OPAL framework. In: Naono, K., Teranishi, K, Cavazos, J, Suda, R. (eds.) Software Automatic Tuning: From Concepts to State-of-the-Art Results, chap. 15, pp. 255\u2013274. Springer, New york (2010)","DOI":"10.1007\/978-1-4419-6935-4_15"},{"issue":"3","key":"428_CR5","doi-asserted-by":"crossref","first-page":"889","DOI":"10.1137\/S1052623400378742","volume":"13","author":"C. Audet","year":"2003","unstructured":"Audet C., Dennis J. Jr: Analysis of generalized pattern searches. SIAM J. Optim 13(3), 889\u2013903 (2003). doi: 10.1137\/S1052623400378742","journal-title":"SIAM J. Optim"},{"issue":"1","key":"428_CR6","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1137\/040603371","volume":"17","author":"C. Audet","year":"2006","unstructured":"Audet C., Dennis J. Jr: Mesh adaptive direct search algorithms for constrained optimization. SIAM J. Optim. 17(1), 188\u2013217 (2006)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"428_CR7","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1137\/070692662","volume":"20","author":"C. Audet","year":"2009","unstructured":"Audet C., Dennis J. Jr: A progressive barrier for derivative-free nonlinear programming. SIAM J. Optim. 20(4), 445\u2013472 (2009). doi: 10.1137\/070692662","journal-title":"SIAM J. Optim."},{"issue":"3","key":"428_CR8","doi-asserted-by":"crossref","first-page":"1150","DOI":"10.1137\/070707518","volume":"19","author":"C. Audet","year":"2008","unstructured":"Audet C., Dennis J. Jr, Le Digabel S.: Parallel space decomposition of the mesh adaptive direct search algorithm. SIAM J. Optim. 19(3), 1150\u20131170 (2008). doi: 10.1137\/070707518","journal-title":"SIAM J. Optim."},{"issue":"2","key":"428_CR9","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/s10589-009-9266-1","volume":"46","author":"C. Audet","year":"2010","unstructured":"Audet C., Dennis J. Jr, Le Digabel S.: Globalization strategies for mesh adaptive direct search. Comput. Optim. Appl. 46(2), 193\u2013215 (2010). doi: 10.1007\/s10589-009-9266-1","journal-title":"Comput. Optim. Appl."},{"issue":"3","key":"428_CR10","doi-asserted-by":"crossref","first-page":"642","DOI":"10.1137\/040620886","volume":"17","author":"C. Audet","year":"2006","unstructured":"Audet C., Orban D.: Finding optimal algorithmic parameters using derivative-free optimization. SIAM J. Optim. 17(3), 642\u2013664 (2006). doi: 10.1137\/040620886","journal-title":"SIAM J. Optim."},{"issue":"4","key":"428_CR11","doi-asserted-by":"crossref","first-page":"1149","DOI":"10.1137\/S1052623499354096","volume":"10","author":"T. Choi","year":"2000","unstructured":"Choi T., Kelley C.: Superlinear convergence and implicit filtering. SIAM J. Optim. 10(4), 1149\u20131162 (2000)","journal-title":"SIAM J. Optim."},{"key":"428_CR12","unstructured":"Clarke, F.: Optimization and Nonsmooth Analysis. Wiley, New York (1983) (reissued in 1990 by SIAM Publications, Philadelphia, as Vol. 5 in the series Classics in Applied Mathematics)"},{"key":"428_CR13","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898719857","volume-title":"Trust-Region Methods. MPS-SIAM Series on Optimization","author":"A. Conn","year":"2000","unstructured":"Conn A., Gould N., Toint P.: Trust-Region Methods. MPS-SIAM Series on Optimization. SIAM, Philadelphia (2000)"},{"key":"428_CR14","doi-asserted-by":"crossref","unstructured":"Conn, A., Scheinberg, K., Vicente, L.: Introduction to Derivative-Free Optimization. MOS\/SIAM Series on Optimization. SIAM, Philadelphia (2009)","DOI":"10.1137\/1.9780898718768"},{"key":"428_CR15","unstructured":"Gilmore, P., Choi, T., Eslinger, O., Kelley, C., Patrick, H., Gablonsky, J.: IFFCO (implicit filtering for constrained optimization). Software available at: http:\/\/www4.ncsu.edu\/~ctk\/iffco.html"},{"issue":"2","key":"428_CR16","doi-asserted-by":"crossref","first-page":"504","DOI":"10.1137\/S1052623497322735","volume":"9","author":"N. Gould","year":"1999","unstructured":"Gould N., Lucidi S., Toint P.: Solving the trust-region subproblem using the Lanczos method. SIAM J. Optim. 9(2), 504\u2013525 (1999)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"428_CR17","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1145\/962437.962439","volume":"29","author":"N. Gould","year":"2003","unstructured":"Gould N., Orban D., Toint P.: CUTEr (and SifDec): a constrained and unconstrained testing environment, revisited. ACM Trans. Math. Softw. 29(4), 373\u2013394 (2003). doi: 10.1145\/962437.962439","journal-title":"ACM Trans. Math. Softw."},{"issue":"4","key":"428_CR18","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1145\/962437.962438","volume":"29","author":"N. Gould","year":"2003","unstructured":"Gould N., Orban D., Toint P.: GALAHAD, a library of thread-safe Fortran 90 packages for large-scale nonlinear optimization. ACM Trans. Math. Softw. 29(4), 353\u2013372 (2003). doi: 10.1145\/962437.962438","journal-title":"ACM Trans. Math. Softw."},{"issue":"3","key":"428_CR19","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1145\/1163641.1163647","volume":"32","author":"G. Gray","year":"2006","unstructured":"Gray G., Kolda T.: Algorithm 856: APPSPACK 4.0: Asynchronous parallel pattern search for derivative-free optimization. ACM Trans. Math. Softw. 32(3), 485\u2013507 (2006). doi: 10.1145\/1163641.1163647","journal-title":"ACM Trans. Math. Softw."},{"issue":"4","key":"428_CR20","doi-asserted-by":"crossref","first-page":"1892","DOI":"10.1137\/060664161","volume":"30","author":"J. Griffin","year":"2008","unstructured":"Griffin J., Kolda T., Lewis R.: Asynchronous parallel generating set search for linearly-constrained optimization. SIAM J. Sci. Comp. 30(4), 1892\u20131924 (2008). doi: 10.1137\/060664161","journal-title":"SIAM J. Sci. Comp."},{"key":"428_CR21","volume-title":"Using MPI: portable parallel programming with the message- passing interface, 2nd edn. Scientific and Engineering Computation Series","author":"W. Gropp","year":"1994","unstructured":"Gropp W., Lusk E., Skjellum A.: Using MPI: portable parallel programming with the message- passing interface, 2nd edn. Scientific and Engineering Computation Series. MIT Press, Cambridge (1994)"},{"key":"428_CR22","unstructured":"Le Digabel, S.: NOMAD user guide. Tech. Rep. G-2009-37, Les cahiers du GERAD (2009)"},{"issue":"4","key":"428_CR23","doi-asserted-by":"crossref","first-page":"44:1","DOI":"10.1145\/1916461.1916468","volume":"37","author":"S. Le Digabel","year":"2011","unstructured":"Le Digabel S.: Algorithm 909: NOMAD: Nonlinear optimization with the MADS algorithm. ACM Trans. Math. Softw. 37(4), 44:1\u201344:15 (2011). doi: 10.1145\/1916461.1916468","journal-title":"ACM Trans. Math. Softw."},{"key":"428_CR24","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1492-2","volume-title":"Parallel Processing of Discrete Problems, IMA Volumes in Mathematics and its Applications, vol. 106","author":"P. Pardalos","year":"1999","unstructured":"Pardalos P.: Parallel Processing of Discrete Problems, IMA Volumes in Mathematics and its Applications, vol. 106. Springer, Berlin (1999)"},{"issue":"1","key":"428_CR25","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1016\/j.parco.2010.08.004","volume":"37","author":"O. Shylo","year":"2011","unstructured":"Shylo O., Middelkoop T., Pardalos P.: Restart strategies in optimization: parallel and serial cases. Parallel Comput. 37(1), 60\u201368 (2011)","journal-title":"Parallel Comput."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-011-0428-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-011-0428-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-011-0428-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,20]],"date-time":"2019-06-20T20:03:43Z","timestamp":1561061023000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-011-0428-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,12,16]]},"references-count":25,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2013,3]]}},"alternative-id":["428"],"URL":"https:\/\/doi.org\/10.1007\/s11590-011-0428-6","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,12,16]]}}}