{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T14:02:12Z","timestamp":1743084132682,"version":"3.40.3"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030918842"},{"type":"electronic","value":"9783030918859"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[[2021]]},"DOI":"10.1007\/978-3-030-91885-9_3","type":"book-chapter","created":{"date-parts":[[2021,12,2]],"date-time":"2021-12-02T13:03:12Z","timestamp":1638450192000},"page":"31-47","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On the\u00a0Performance of\u00a0the\u00a0ORTHOMADS Algorithm on\u00a0Continuous and\u00a0Mixed-Integer Optimization Problems"],"prefix":"10.1007","author":[{"given":"Marie-Ange","family":"Dahito","sequence":"first","affiliation":[]},{"given":"Laurent","family":"Genest","sequence":"additional","affiliation":[]},{"given":"Alessandro","family":"Maddaloni","sequence":"additional","affiliation":[]},{"given":"Jos\u00e9","family":"Neto","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,1,1]]},"reference":[{"issue":"2","key":"3_CR1","doi-asserted-by":"publisher","first-page":"948","DOI":"10.1137\/080716980","volume":"20","author":"MA Abramson","year":"2009","unstructured":"Abramson, M.A., Audet, C., Dennis, J.E., Jr., Le Digabel, S.: OrthoMADS: a deterministic MADS instance with orthogonal directions. SIAM J. Optim. 20(2), 948\u2013966 (2009). https:\/\/doi.org\/10.1137\/080716980","journal-title":"SIAM J. Optim."},{"key":"3_CR2","doi-asserted-by":"publisher","unstructured":"Amaran, S., Sahinidis, N.V., Sharda, B., Bury, S.J.: Simulation optimization: a review of algorithms and applications. 4OR 12(4), 301\u2013333 (2014). https:\/\/doi.org\/10.1007\/s10288-014-0275-2","DOI":"10.1007\/s10288-014-0275-2"},{"issue":"2","key":"3_CR3","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s11081-007-9030-2","volume":"9","author":"C Audet","year":"2008","unstructured":"Audet, C., B\u00e9chard, V., Chaouki, J.: Spent potliner treatment process optimization using a MADS algorithm. Optim. Eng. 9(2), 143\u2013160 (2008). https:\/\/doi.org\/10.1007\/s11081-007-9030-2","journal-title":"Optim. Eng."},{"issue":"1","key":"3_CR4","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1137\/040603371","volume":"17","author":"C Audet","year":"2006","unstructured":"Audet, C., Dennis, J.E., Jr.: Mesh adaptive direct search algorithms for constrained optimization. SIAM J. Optim. 17(1), 188\u2013217 (2006). https:\/\/doi.org\/10.1137\/040603371","journal-title":"SIAM J. Optim."},{"issue":"1","key":"3_CR5","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1137\/070692662","volume":"20","author":"C Audet","year":"2009","unstructured":"Audet, C., Dennis, J.E., Jr.: A progressive barrier for derivative-free nonlinear programming. SIAM J. Optim. 20(1), 445\u2013472 (2009). https:\/\/doi.org\/10.1137\/070692662","journal-title":"SIAM J. Optim."},{"key":"3_CR6","series-title":"Springer Series in Operations Research and Financial Engineering","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-68913-5","volume-title":"Derivative-Free and Blackbox Optimization","author":"C Audet","year":"2017","unstructured":"Audet, C., Hare, W.: Derivative-Free and Blackbox Optimization. SSORFE, Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-68913-5"},{"key":"3_CR7","unstructured":"Audet, C., Le Digabel, S., Tribes, C.: NOMAD user guide. Technical Report G-2009-37, Les cahiers du GERAD (2009). https:\/\/www.gerad.ca\/nomad\/Downloads\/user_guide.pdf"},{"key":"3_CR8","unstructured":"Bergstra, J., Bardenet, R., Bengio, Y., K\u00e9gl, B.: Algorithms for hyper-parameter optimization. In: Advances in Neural Information Processing Systems, vol. 24 (2011). https:\/\/proceedings.neurips.cc\/paper\/2011\/file\/86e8f7ab32cfd12577bc2619bc635690-Paper.pdf"},{"key":"3_CR9","doi-asserted-by":"publisher","unstructured":"Brockhoff, D., Hansen, N.: The impact of sample volume in random search on the bbob test suite. In: Proceedings of the Genetic and Evolutionary Computation Conference Companion, GECCO 2019, pp. 1912\u20131919. Association for Computing Machinery, New York (2019). https:\/\/doi.org\/10.1145\/3319619.3326894","DOI":"10.1145\/3319619.3326894"},{"issue":"2","key":"3_CR10","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1287\/opre.6.2.244","volume":"6","author":"SH Brooks","year":"1958","unstructured":"Brooks, S.H.: A discussion of random methods for seeking maxima. Oper. Res. 6(2), 244\u2013251 (1958). https:\/\/doi.org\/10.1287\/opre.6.2.244","journal-title":"Oper. Res."},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"Eberhart, R., Kennedy, J.: A new optimizer using particle swarm theory. In: MHS 1995. Proceedings of the Sixth International Symposium on Micro Machine and Human Science, pp. 39\u201343. IEEE (1995). https:\/\/doi.org\/10.1109\/MHS.1995.494215","DOI":"10.1109\/MHS.1995.494215"},{"key":"3_CR12","doi-asserted-by":"publisher","unstructured":"El-Abd, M., Kamel, M.S.: Black-box optimization benchmarking for noiseless function testbed using particle swarm optimization. In: Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference: Late Breaking Papers, GECCO 2009, pp. 2269\u20132274. Association for Computing Machinery, New York (2009). https:\/\/doi.org\/10.1145\/1570256.1570316","DOI":"10.1145\/1570256.1570316"},{"key":"3_CR13","unstructured":"Finck, S., Hansen, N., Ros, R., Auger, A.: Real-parameter black-box optimization benchmarking 2009: presentation of the noiseless functions. Technical Report 2009\/20, Research Center PPE (2009)"},{"key":"3_CR14","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/s10589-010-9329-3","volume":"51","author":"F Gao","year":"2012","unstructured":"Gao, F., Han, L.: Implementing the Nelder-Mead simplex algorithm with adaptive parameters. Comp. Optim. Appl. 51, 259\u2013277 (2012). https:\/\/doi.org\/10.1007\/s10589-010-9329-3","journal-title":"Comp. Optim. Appl."},{"key":"3_CR15","doi-asserted-by":"publisher","unstructured":"Hansen, N.: A global surrogate assisted CMA-ES. In: Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2019, pp. 664\u2013672. Association for Computing Machinery, New York (2019). https:\/\/doi.org\/10.1145\/3321707.3321842","DOI":"10.1145\/3321707.3321842"},{"key":"3_CR16","series-title":"Natural Computing Series","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/978-3-642-33206-7_8","volume-title":"Theory and Principled Methods for the Design of Metaheuristics","author":"N Hansen","year":"2014","unstructured":"Hansen, N., Auger, A.: Principled design of continuous stochastic search: from theory to practice. In: Borenstein, Y., Moraglio, A. (eds.) Theory and Principled Methods for the Design of Metaheuristics. NCS, pp. 145\u2013180. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-33206-7_8"},{"issue":"1","key":"3_CR17","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1080\/10556788.2020.1808977","volume":"36","author":"N Hansen","year":"2021","unstructured":"Hansen, N., Auger, A., Ros, R., Mersmann, O., Tu\u0161ar, T., Brockhoff, D.: COCO: a platform for comparing continuous optimizers in a black-box setting. Optim. Meth. Softw. 36(1), 114\u2013144 (2021). https:\/\/doi.org\/10.1080\/10556788.2020.1808977","journal-title":"Optim. Meth. Softw."},{"key":"3_CR18","doi-asserted-by":"crossref","unstructured":"Kennedy, J., Eberhart, R.: Particle swarm optimization. In: Proceedings of the IEEE International Conference on Neural Networks, vol. 4, pp. 1942\u20131948. Citeseer (1995)","DOI":"10.1109\/ICNN.1995.488968"},{"key":"3_CR19","doi-asserted-by":"publisher","unstructured":"Le Digabel, S.: Algorithm 909: NOMAD: nonlinear optimization with the MADS algorithm. ACM Trans. Math. Softw. 37(4), 44:1\u201344:15 (2011). https:\/\/doi.org\/10.1145\/1916461.1916468","DOI":"10.1145\/1916461.1916468"},{"issue":"1","key":"3_CR20","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1137\/080724083","volume":"20","author":"JJ Mor\u00e9","year":"2009","unstructured":"Mor\u00e9, J.J., Wild, S.M.: Benchmarking derivative-free optimization algorithms. SIAM J. Optim. 20(1), 172\u2013191 (2009). https:\/\/doi.org\/10.1137\/080724083","journal-title":"SIAM J. Optim."},{"issue":"4","key":"3_CR21","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1093\/comjnl\/7.4.308","volume":"7","author":"JA Nelder","year":"1965","unstructured":"Nelder, J.A., Mead, R.: A simplex method for function minimization. Comput. J. 7(4), 308\u2013313 (1965). https:\/\/doi.org\/10.1093\/comjnl\/7.4.308","journal-title":"Comput. J."},{"key":"3_CR22","doi-asserted-by":"publisher","unstructured":"Nocedal, J., Wright, S.J.: Numerical Optimization. Springer, New York (2006). https:\/\/doi.org\/10.1007\/978-0-387-40065-5","DOI":"10.1007\/978-0-387-40065-5"},{"key":"3_CR23","doi-asserted-by":"publisher","unstructured":"Powell, M.J.D.: The NEWUOA software for unconstrained optimization without derivatives. In: Di Pillo, G., Roma, M. (eds.) Large-Scale Nonlinear Optimization, pp. 255\u2013297. Springer, Boston (2006). https:\/\/doi.org\/10.1007\/0-387-30065-1_16","DOI":"10.1007\/0-387-30065-1_16"},{"issue":"2","key":"3_CR24","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1080\/0305215X.2013.765000","volume":"46","author":"RG Regis","year":"2014","unstructured":"Regis, R.G.: Constrained optimization by radial basis function interpolation for high-dimensional expensive black-box problems with infeasible initial points. Eng. Optim. 46(2), 218\u2013243 (2014). https:\/\/doi.org\/10.1080\/0305215X.2013.765000","journal-title":"Eng. Optim."},{"issue":"3","key":"3_CR25","doi-asserted-by":"publisher","first-page":"1247","DOI":"10.1007\/s10898-012-9951-y","volume":"56","author":"LM Rios","year":"2013","unstructured":"Rios, L.M., Sahinidis, N.V.: Derivative-free optimization: a review of algorithms and comparison of software implementations. J. Glob. Optim. 56(3), 1247\u20131293 (2013). https:\/\/doi.org\/10.1007\/s10898-012-9951-y","journal-title":"J. Glob. Optim."},{"key":"3_CR26","doi-asserted-by":"publisher","unstructured":"Ros, R.: Benchmarking the NEWUOA on the BBOB-2009 function testbed. In: Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference: Late Breaking Papers, GECCO 2009, pp. 2421\u20132428. Association for Computing Machinery, New York (2009). https:\/\/doi.org\/10.1145\/1570256.1570338","DOI":"10.1145\/1570256.1570338"},{"issue":"4","key":"3_CR27","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1023\/A:1008202821328","volume":"11","author":"R Storn","year":"1997","unstructured":"Storn, R., Price, K.: Differential evolution-A simple and efficient heuristic for global optimization over continuous spaces. J. Glob. Optim. 11(4), 341\u2013359 (1997). https:\/\/doi.org\/10.1023\/A:1008202821328","journal-title":"J. Glob. Optim."},{"issue":"1","key":"3_CR28","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/S1052623493250780","volume":"7","author":"V Torczon","year":"1997","unstructured":"Torczon, V.: On the convergence of pattern search algorithms. SIAM J. Optim. 7(1), 1\u201325 (1997). https:\/\/doi.org\/10.1137\/S1052623493250780","journal-title":"SIAM J. Optim."},{"key":"3_CR29","doi-asserted-by":"publisher","unstructured":"Tu\u0161ar, T., Brockhoff, D., Hansen, N.: Mixed-integer benchmark problems for single- and bi-objective optimization. In: Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2019, pp. 718\u2013726. Association for Computing Machinery, New York (2019). https:\/\/doi.org\/10.1145\/3321707.3321868","DOI":"10.1145\/3321707.3321868"},{"key":"3_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-99253-2_1","volume-title":"Parallel Problem Solving from Nature \u2013 PPSN XV","author":"K Varelas","year":"2018","unstructured":"Varelas, K., et al.: A comparative study of large-scale variants of CMA-ES. In: Auger, A., Fonseca, C.M., Louren\u00e7o, N., Machado, P., Paquete, L., Whitley, D. (eds.) PPSN 2018. LNCS, vol. 11101, pp. 3\u201315. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-99253-2_1"},{"key":"3_CR31","doi-asserted-by":"publisher","unstructured":"Varelas, K., Dahito, M.A.: Benchmarking multivariate solvers of SciPy on the noiseless testbed. In: Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2019, pp. 1946\u20131954. Association for Computing Machinery, New York (2019). https:\/\/doi.org\/10.1145\/3319619.3326891","DOI":"10.1145\/3319619.3326891"}],"container-title":["Communications in Computer and Information Science","Optimization, Learning Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-91885-9_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,13]],"date-time":"2024-09-13T15:50:43Z","timestamp":1726242643000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-91885-9_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030918842","9783030918859"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-91885-9_3","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"1 January 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"OL2A","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Optimization, Learning Algorithms and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bragan\u00e7a","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 July 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 July 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ol2a2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/ol2a.ipb.pt\/EN_index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"134","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"39","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"13","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"29% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Due to the COVID-19 pandemic the conference was held online.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}