{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,18]],"date-time":"2026-06-18T15:59:27Z","timestamp":1781798367409,"version":"3.54.5"},"reference-count":69,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2022,9,10]],"date-time":"2022-09-10T00:00:00Z","timestamp":1662768000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"NSERC CRD","award":["RDCPJ\u00a0490744-15"],"award-info":[{"award-number":["RDCPJ\u00a0490744-15"]}]},{"name":"NSERC Alliance","award":["544900-19"],"award-info":[{"award-number":["544900-19"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Math. Softw."],"published-print":{"date-parts":[[2022,9,30]]},"abstract":"<jats:p>\n            <jats:monospace>NOMAD<\/jats:monospace>\n            is a state-of-the-art software package for optimizing blackbox problems. In continuous development since 2001, it constantly evolved with the integration of new algorithmic features published in scientific publications. These features are motivated by real applications encountered by industrial partners. The latest major release of\n            <jats:monospace>NOMAD<\/jats:monospace>\n            , version\u00a03, dates to 2008. Minor releases are produced as new features are incorporated. The present work describes\n            <jats:monospace>NOMAD<\/jats:monospace>\n            \u00a04, a complete redesign of the previous version, with a new architecture providing more flexible code, added functionalities, and reusable code. We introduce algorithmic components, which are building blocks for more complex algorithms and can initiate other components, launch nested algorithms, or perform specialized tasks. They facilitate the implementation of new ideas, including the\n            <jats:monospace>MegaSearchPoll<\/jats:monospace>\n            component, warm and hot restarts, and a revised version of the\n            <jats:sc>PsdMads<\/jats:sc>\n            algorithm. Another main improvement of\n            <jats:monospace>NOMAD<\/jats:monospace>\n            \u00a04 is the usage of parallelism, to simultaneously compute multiple blackbox evaluations and to maximize usage of available cores. Running different algorithms, tuning their parameters, and comparing their performance for optimization are simpler than before, while overall optimization performance is maintained between versions\u00a03 and\u00a04.\n            <jats:monospace>NOMAD<\/jats:monospace>\n            is freely available at www.gerad.ca\/nomad\n and the whole project is visible at github.com\/bbopt\/nomad.\n          <\/jats:p>","DOI":"10.1145\/3544489","type":"journal-article","created":{"date-parts":[[2022,6,17]],"date-time":"2022-06-17T09:00:33Z","timestamp":1655456433000},"page":"1-22","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":66,"title":["Algorithm\u00a01027:\n            <tt>NOMAD<\/tt>\n            Version\u00a04: Nonlinear Optimization with the MADS Algorithm"],"prefix":"10.1145","volume":"48","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3043-5393","authenticated-orcid":false,"given":"Charles","family":"Audet","sequence":"first","affiliation":[{"name":"GERAD and Polytechnique Montr\u00e9al, D\u00e9partement de Math\u00e9matiques et G\u00e9nie Industriel, Montr\u00e9al, Qu\u00e9bec, Canada"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3148-5090","authenticated-orcid":false,"given":"S\u00e9bastien","family":"Le Digabel","sequence":"additional","affiliation":[{"name":"GERAD and Polytechnique Montr\u00e9al, D\u00e9partement de Math\u00e9matiques et G\u00e9nie Industriel, Montr\u00e9al, Qu\u00e9bec, Canada"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5944-3987","authenticated-orcid":false,"given":"Viviane Rochon","family":"Montplaisir","sequence":"additional","affiliation":[{"name":"GERAD and Polytechnique Montr\u00e9al, D\u00e9partement de Math\u00e9matiques et G\u00e9nie Industriel, Montr\u00e9al, Qu\u00e9bec, Canada"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8740-6155","authenticated-orcid":false,"given":"Christophe","family":"Tribes","sequence":"additional","affiliation":[{"name":"GERAD and Polytechnique Montr\u00e9al, D\u00e9partement de Math\u00e9matiques et G\u00e9nie Industriel, Montr\u00e9al, Qu\u00e9bec, Canada"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2022,9,10]]},"reference":[{"key":"e_1_3_2_2_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevD.87.042001"},{"key":"e_1_3_2_3_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11590-008-0089-2"},{"key":"e_1_3_2_4_2","doi-asserted-by":"publisher","DOI":"10.1137\/080716980"},{"key":"e_1_3_2_5_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11590-013-0688-4"},{"key":"e_1_3_2_6_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejco.2021.100011"},{"key":"e_1_3_2_7_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2017.10.058"},{"key":"e_1_3_2_8_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4939-1124-0"},{"key":"e_1_3_2_9_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11081-007-9030-2"},{"key":"e_1_3_2_10_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10898-007-9234-1"},{"key":"e_1_3_2_11_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11590-019-01452-7"},{"key":"e_1_3_2_12_2","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623499352024"},{"key":"e_1_3_2_13_2","doi-asserted-by":"publisher","DOI":"10.1137\/040603371"},{"key":"e_1_3_2_14_2","doi-asserted-by":"publisher","DOI":"10.1137\/070692662"},{"key":"e_1_3_2_15_2","doi-asserted-by":"publisher","DOI":"10.1137\/070707518"},{"key":"e_1_3_2_16_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-007-6664-8_4"},{"key":"e_1_3_2_17_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-020-00249-0"},{"key":"e_1_3_2_18_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-68913-5"},{"key":"e_1_3_2_19_2","doi-asserted-by":"publisher","DOI":"10.1137\/120895056"},{"key":"e_1_3_2_20_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11590-017-1226-6"},{"key":"e_1_3_2_21_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10898-017-0574-1"},{"issue":"1","key":"e_1_3_2_22_2","first-page":"103","article-title":"The mesh adaptive direct search algorithm for periodic variables","volume":"8","author":"Audet C.","year":"2012","unstructured":"C. Audet and S. Le Digabel. 2012. The mesh adaptive direct search algorithm for periodic variables. Pacific Journal of Optimization 8, 1 (2012), 103\u2013119. http:\/\/www.ybook.co.jp\/online2\/oppjo\/vol8\/p103.html.","journal-title":"Pacific Journal of Optimization"},{"key":"e_1_3_2_23_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-014-9708-2"},{"key":"e_1_3_2_24_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11081-015-9283-0"},{"key":"e_1_3_2_25_2","doi-asserted-by":"publisher","DOI":"10.1137\/18M1175872"},{"key":"e_1_3_2_26_2","doi-asserted-by":"publisher","DOI":"10.1137\/060677513"},{"key":"e_1_3_2_27_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2009.11.010"},{"key":"e_1_3_2_28_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-018-0016-0"},{"key":"e_1_3_2_29_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-021-00272-9"},{"key":"e_1_3_2_30_2","doi-asserted-by":"publisher","DOI":"10.2514\/6.2007-1927"},{"key":"e_1_3_2_31_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cep.2010.07.014"},{"key":"e_1_3_2_32_2","doi-asserted-by":"publisher","DOI":"10.1080\/10556788.2011.623162"},{"key":"e_1_3_2_33_2","doi-asserted-by":"publisher","DOI":"10.1109\/99.660313"},{"key":"e_1_3_2_34_2","doi-asserted-by":"publisher","DOI":"10.2172\/4377177"},{"key":"e_1_3_2_35_2","doi-asserted-by":"publisher","DOI":"10.1186\/1471-2105-15-47"},{"key":"e_1_3_2_36_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.calphad.2011.06.003"},{"key":"e_1_3_2_37_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11081-015-9301-2"},{"key":"e_1_3_2_38_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.tca.2013.02.004"},{"key":"e_1_3_2_39_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jct.2011.03.021"},{"key":"e_1_3_2_40_2","doi-asserted-by":"publisher","DOI":"10.1145\/962437.962439"},{"key":"e_1_3_2_41_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(00)00100-4"},{"key":"e_1_3_2_42_2","doi-asserted-by":"publisher","DOI":"10.1002\/cjce.5450810608"},{"key":"e_1_3_2_43_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.actaastro.2020.01.018"},{"key":"e_1_3_2_44_2","doi-asserted-by":"publisher","DOI":"10.5555\/578283"},{"key":"e_1_3_2_45_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11081-010-9118-y"},{"key":"e_1_3_2_46_2","volume-title":"Sondes locales intensives lors de l\u2019ex\u00e9cution de l\u2019algorithme MADS dans un environnement parall\u00e8le","author":"Lameynardie G.","year":"2020","unstructured":"G. Lameynardie. 2020. Sondes locales intensives lors de l\u2019ex\u00e9cution de l\u2019algorithme MADS dans un environnement parall\u00e8le. Master\u2019s Thesis. Polytechnique Montr\u00e9al. https:\/\/publications.polymtl.ca\/5442\/."},{"key":"e_1_3_2_47_2","doi-asserted-by":"publisher","DOI":"10.1145\/1916461.1916468"},{"key":"e_1_3_2_48_2","volume-title":"Modelling of a Solar Thermal Power Plant for Benchmarking Blackbox Optimization Solvers","author":"Garneau M. Lemyre","year":"2015","unstructured":"M. Lemyre Garneau. 2015. Modelling of a Solar Thermal Power Plant for Benchmarking Blackbox Optimization Solvers. Master\u2019s Thesis. Polytechnique Montr\u00e9al. https:\/\/publications.polymtl.ca\/1996\/."},{"key":"e_1_3_2_49_2","doi-asserted-by":"publisher","DOI":"10.1007\/s40314-017-0505-2"},{"key":"e_1_3_2_50_2","volume-title":"Test Problems for Nonsmooth Unconstrained and Linearly Constrained Optimization","author":"Luk\u0161an L.","year":"2000","unstructured":"L. Luk\u0161an and J. Vl\u010dek. 2000. Test Problems for Nonsmooth Unconstrained and Linearly Constrained Optimization. Technical Report V-798. ICS AS CR."},{"issue":"2","key":"e_1_3_2_51_2","first-page":"239","article-title":"A comparison of three methods for selecting values of input variables in the analysis of output from a computer code","volume":"21","author":"McKay M. D.","year":"1979","unstructured":"M. D. McKay, R. J. Beckman, and W. J. Conover. 1979. A comparison of three methods for selecting values of input variables in the analysis of output from a computer code. Technometrics 21, 2 (1979), 239\u2013245. http:\/\/www.jstor.org\/stable\/1268522.","journal-title":"Technometrics"},{"key":"e_1_3_2_52_2","doi-asserted-by":"publisher","DOI":"10.3847\/1538-4357\/ab5856"},{"key":"e_1_3_2_53_2","doi-asserted-by":"publisher","DOI":"10.1007\/11579427_66"},{"key":"e_1_3_2_54_2","doi-asserted-by":"publisher","DOI":"10.1162\/evco.1996.4.1.1"},{"key":"e_1_3_2_55_2","doi-asserted-by":"publisher","DOI":"10.1002\/2013WR013857"},{"key":"e_1_3_2_56_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0305-0548(97)00031-2"},{"key":"e_1_3_2_57_2","doi-asserted-by":"publisher","DOI":"10.1137\/080724083"},{"key":"e_1_3_2_58_2","doi-asserted-by":"publisher","DOI":"10.1093\/mnras\/stz1244"},{"key":"e_1_3_2_59_2","doi-asserted-by":"publisher","DOI":"10.1115\/1.2826677"},{"key":"e_1_3_2_60_2","volume-title":"Optimisation et ordonnancement en optimisation sans d\u00e9riv\u00e9es","author":"Cann L. A. Sarrazin-Mc","year":"2018","unstructured":"L. A. Sarrazin-Mc Cann. 2018. Optimisation et ordonnancement en optimisation sans d\u00e9riv\u00e9es. Master\u2019s Thesis. Polytechnique Montr\u00e9al. https:\/\/publications.polymtl.ca\/3099\/."},{"key":"e_1_3_2_61_2","doi-asserted-by":"publisher","DOI":"10.1061\/(ASCE)WR.1943-5452.0000854"},{"key":"e_1_3_2_62_2","unstructured":"B. Talgorn. 2019. sgtelib: Surrogate Model Library for Derivative-Free Optimization. https:\/\/github.com\/bbopt\/sgtelib."},{"key":"e_1_3_2_63_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11081-017-9370-5"},{"key":"e_1_3_2_64_2","doi-asserted-by":"publisher","DOI":"10.1115\/1.4028756"},{"key":"e_1_3_2_65_2","doi-asserted-by":"publisher","DOI":"10.2307\/2291282"},{"key":"e_1_3_2_66_2","doi-asserted-by":"publisher","DOI":"10.1002\/ceat.200700322"},{"key":"e_1_3_2_67_2","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623493250780"},{"key":"e_1_3_2_68_2","doi-asserted-by":"publisher","DOI":"10.1080\/03052150500289305"},{"key":"e_1_3_2_69_2","doi-asserted-by":"publisher","DOI":"10.1002\/pst.1721"},{"key":"e_1_3_2_70_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.compchemeng.2010.01.008"}],"container-title":["ACM Transactions on Mathematical Software"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3544489","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3544489","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:02:54Z","timestamp":1750186974000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3544489"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,9,10]]},"references-count":69,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,9,30]]}},"alternative-id":["10.1145\/3544489"],"URL":"https:\/\/doi.org\/10.1145\/3544489","relation":{},"ISSN":["0098-3500","1557-7295"],"issn-type":[{"value":"0098-3500","type":"print"},{"value":"1557-7295","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,9,10]]},"assertion":[{"value":"2021-04-22","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2022-06-08","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2022-09-10","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}