{"id":"https://openalex.org/W2029582167","doi":"https://doi.org/10.1145/1570256.1570335","title":"Benchmarking the nelder-mead downhill simplex algorithm with many local restarts","display_name":"Benchmarking the nelder-mead downhill simplex algorithm with many local restarts","publication_year":2009,"publication_date":"2009-07-08","ids":{"openalex":"https://openalex.org/W2029582167","doi":"https://doi.org/10.1145/1570256.1570335","mag":"2029582167"},"language":"en","primary_location":{"id":"doi:10.1145/1570256.1570335","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1570256.1570335","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference: Late Breaking Papers","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://inria.hal.science/inria-00382104","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5039669927","display_name":"Nikolaus Hansen","orcid":"https://orcid.org/0000-0001-7788-4906"},"institutions":[{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en sciences et technologies du num\u00e9rique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"government","lineage":["https://openalex.org/I1326498283"]},{"id":"https://openalex.org/I4210126360","display_name":"Centre Inria de Saclay","ror":"https://ror.org/0315e5x55","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1326498283","https://openalex.org/I4210126360"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Nikolaus Hansen","raw_affiliation_strings":["INRIA Saclay, Orsay, France","Inria Saclay, Orsay, France#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"INRIA Saclay, Orsay, France","institution_ids":["https://openalex.org/I1326498283","https://openalex.org/I4210126360"]},{"raw_affiliation_string":"Inria Saclay, Orsay, France#TAB#","institution_ids":["https://openalex.org/I4210126360"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5039669927"],"corresponding_institution_ids":["https://openalex.org/I1326498283","https://openalex.org/I4210126360"],"apc_list":null,"apc_paid":null,"fwci":1.7059,"has_fulltext":false,"cited_by_count":27,"citation_normalized_percentile":{"value":0.84897496,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"2403","last_page":"2408"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9965000152587891,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9965000152587891,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9833999872207642,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9646999835968018,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/testbed","display_name":"Testbed","score":0.8433529138565063},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.7729769945144653},{"id":"https://openalex.org/keywords/benchmarking","display_name":"Benchmarking","score":0.7643923163414001},{"id":"https://openalex.org/keywords/simplex-algorithm","display_name":"Simplex algorithm","score":0.7120040059089661},{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.6399852633476257},{"id":"https://openalex.org/keywords/simplex","display_name":"Simplex","score":0.6066634654998779},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5513954162597656},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5399285554885864},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.48657500743865967},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.46415671706199646},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.431079626083374},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2976527214050293},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.24950170516967773}],"concepts":[{"id":"https://openalex.org/C31395832","wikidata":"https://www.wikidata.org/wiki/Q1318674","display_name":"Testbed","level":2,"score":0.8433529138565063},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.7729769945144653},{"id":"https://openalex.org/C86251818","wikidata":"https://www.wikidata.org/wiki/Q816754","display_name":"Benchmarking","level":2,"score":0.7643923163414001},{"id":"https://openalex.org/C144521790","wikidata":"https://www.wikidata.org/wiki/Q134164","display_name":"Simplex algorithm","level":3,"score":0.7120040059089661},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.6399852633476257},{"id":"https://openalex.org/C62438384","wikidata":"https://www.wikidata.org/wiki/Q331350","display_name":"Simplex","level":2,"score":0.6066634654998779},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5513954162597656},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5399285554885864},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.48657500743865967},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.46415671706199646},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.431079626083374},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2976527214050293},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.24950170516967773},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C144133560","wikidata":"https://www.wikidata.org/wiki/Q4830453","display_name":"Business","level":0,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C162853370","wikidata":"https://www.wikidata.org/wiki/Q39809","display_name":"Marketing","level":1,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1145/1570256.1570335","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1570256.1570335","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference: Late Breaking Papers","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.652.4739","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.652.4739","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"https://hal.inria.fr/inria-00382104/file/hansen2009bnm.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.698.9091","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.698.9091","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"https://hal.inria.fr/file/index/docid/382104/filename/hansen2009bnm.pdf","raw_type":"text"},{"id":"pmh:oai:HAL:inria-00382104v1","is_oa":true,"landing_page_url":"https://inria.hal.science/inria-00382104","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ACM-GECCO Genetic and Evolutionary Computation Conference, Jul 2009, Montreal, Canada","raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":{"id":"pmh:oai:HAL:inria-00382104v1","is_oa":true,"landing_page_url":"https://inria.hal.science/inria-00382104","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ACM-GECCO Genetic and Evolutionary Computation Conference, Jul 2009, Montreal, Canada","raw_type":"info:eu-repo/semantics/conferenceObject"},"sustainable_development_goals":[{"score":0.41999998688697815,"id":"https://metadata.un.org/sdg/9","display_name":"Industry, innovation and infrastructure"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":4,"referenced_works":["https://openalex.org/W1499983649","https://openalex.org/W2119833845","https://openalex.org/W2171074980","https://openalex.org/W2171263583"],"related_works":["https://openalex.org/W2185826091","https://openalex.org/W2048470382","https://openalex.org/W2477407501","https://openalex.org/W2384679317","https://openalex.org/W2911215968","https://openalex.org/W1583787753","https://openalex.org/W1570109187","https://openalex.org/W2491692165","https://openalex.org/W2366013513","https://openalex.org/W4244786412"],"abstract_inverted_index":{"We":[0],"benchmark":[1],"the":[2,8,40,65],"Nelder-Mead":[3],"downhill":[4],"simplex":[5],"method":[6],"on":[7,17,71],"noisefree":[9],"BBOB-2009":[10],"testbed.":[11],"A":[12],"multistart":[13],"strategy":[14],"is":[15],"applied":[16],"two":[18],"levels.":[19],"On":[20,39],"a":[21,31],"local":[22],"level,":[23],"at":[24],"least":[25],"ten":[26,57],"restarts":[27,44],"are":[28,45,52],"conducted":[29],"with":[30],"small":[32],"number":[33],"of":[34,81],"iterations":[35],"and":[36,79,88],"reshaped":[37],"simplex.":[38],"global":[41],"level":[42],"independent":[43],"launched":[46],"until":[47],"$10^5":[48],"D$":[49],"function":[50],"evaluations":[51],"exceeded,":[53],"for":[54],"dimension":[55],"$D\\ge20$":[56],"times":[58],"less.":[59],"For":[60],"low":[61],"search":[62],"space":[63],"dimensions":[64],"algorithm":[66],"shows":[67],"very":[68],"good":[69],"results":[70],"many":[72],"functions.":[73],"It":[74],"solves":[75],"24,":[76],"18,":[77],"11":[78],"7":[80],"24":[82],"functions":[83],"in":[84],"2,":[85],"5,":[86],"10":[87],"40-D.":[89]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":4}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}