{"id":"https://openalex.org/W1976753372","doi":"https://doi.org/10.1162/evco_a_00087","title":"Restarted Local Search Algorithms for Continuous Black Box Optimization","display_name":"Restarted Local Search Algorithms for Continuous Black Box Optimization","publication_year":2012,"publication_date":"2012-07-10","ids":{"openalex":"https://openalex.org/W1976753372","doi":"https://doi.org/10.1162/evco_a_00087","mag":"1976753372","pmid":"https://pubmed.ncbi.nlm.nih.gov/22779407"},"language":"en","primary_location":{"id":"doi:10.1162/evco_a_00087","is_oa":false,"landing_page_url":"https://doi.org/10.1162/evco_a_00087","pdf_url":null,"source":{"id":"https://openalex.org/S38677346","display_name":"Evolutionary Computation","issn_l":"1063-6560","issn":["1063-6560","1530-9304"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315718","host_organization_name":"The MIT Press","host_organization_lineage":["https://openalex.org/P4310315718"],"host_organization_lineage_names":["The MIT Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Evolutionary Computation","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","pubmed"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5002338502","display_name":"Petr Po\u0161\u00edk","orcid":"https://orcid.org/0000-0002-9694-3673"},"institutions":[{"id":"https://openalex.org/I44504214","display_name":"Czech Technical University in Prague","ror":"https://ror.org/03kqpb082","country_code":"CZ","type":"education","lineage":["https://openalex.org/I44504214"]}],"countries":["CZ"],"is_corresponding":true,"raw_author_name":"Petr Po\u0161\u00edk","raw_affiliation_strings":["Faculty of Electrical Engineering, Czech Technical University in Prague, Czech Republic"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Electrical Engineering, Czech Technical University in Prague, Czech Republic","institution_ids":["https://openalex.org/I44504214"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5020408578","display_name":"Waltraud Huyer","orcid":null},"institutions":[{"id":"https://openalex.org/I4210088715","display_name":"Hochschule Campus Wien","ror":"https://ror.org/003f4pg83","country_code":"AT","type":"education","lineage":["https://openalex.org/I4210088715"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Waltraud Huyer","raw_affiliation_strings":["Faculty of Mathematics, University of Wien, Austria"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Mathematics, University of Wien, Austria","institution_ids":["https://openalex.org/I4210088715"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5002338502"],"corresponding_institution_ids":["https://openalex.org/I44504214"],"apc_list":null,"apc_paid":null,"fwci":1.7681,"has_fulltext":false,"cited_by_count":18,"citation_normalized_percentile":{"value":0.86036474,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"20","issue":"4","first_page":"575","last_page":"607"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9998999834060669,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9998999834060669,"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/T11975","display_name":"Evolutionary Algorithms and Applications","score":0.9988999962806702,"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/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9980999827384949,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/algorithm","display_name":"Algorithm","score":0.6180105209350586},{"id":"https://openalex.org/keywords/simplex-algorithm","display_name":"Simplex algorithm","score":0.5773331522941589},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5280942320823669},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.516163170337677},{"id":"https://openalex.org/keywords/embedding","display_name":"Embedding","score":0.4938543438911438},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.4616026282310486},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3831755220890045},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3623363673686981},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.20717713236808777},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.18391001224517822}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6180105209350586},{"id":"https://openalex.org/C144521790","wikidata":"https://www.wikidata.org/wiki/Q134164","display_name":"Simplex algorithm","level":3,"score":0.5773331522941589},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5280942320823669},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.516163170337677},{"id":"https://openalex.org/C41608201","wikidata":"https://www.wikidata.org/wiki/Q980509","display_name":"Embedding","level":2,"score":0.4938543438911438},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.4616026282310486},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3831755220890045},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3623363673686981},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.20717713236808777},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.18391001224517822}],"mesh":[{"descriptor_ui":"D000465","descriptor_name":"Algorithms","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D000465","descriptor_name":"Algorithms","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D000465","descriptor_name":"Algorithms","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D019985","descriptor_name":"Benchmarking","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D019985","descriptor_name":"Benchmarking","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D019985","descriptor_name":"Benchmarking","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true}],"locations_count":4,"locations":[{"id":"doi:10.1162/evco_a_00087","is_oa":false,"landing_page_url":"https://doi.org/10.1162/evco_a_00087","pdf_url":null,"source":{"id":"https://openalex.org/S38677346","display_name":"Evolutionary Computation","issn_l":"1063-6560","issn":["1063-6560","1530-9304"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315718","host_organization_name":"The MIT Press","host_organization_lineage":["https://openalex.org/P4310315718"],"host_organization_lineage_names":["The MIT Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Evolutionary Computation","raw_type":"journal-article"},{"id":"pmid:22779407","is_oa":false,"landing_page_url":"https://pubmed.ncbi.nlm.nih.gov/22779407","pdf_url":null,"source":{"id":"https://openalex.org/S4306525036","display_name":"PubMed","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1299303238","host_organization_name":"National Institutes of Health","host_organization_lineage":["https://openalex.org/I1299303238"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Evolutionary computation","raw_type":null},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.225.3153","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.225.3153","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.mat.univie.ac.at/%7Ehuyer/LocAlgs.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.359.9346","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.359.9346","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.mat.univie.ac.at/%7Ehuyer/LocAlgs.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320321006","display_name":"Grantov\u00e1 Agentura \u010cesk\u00e9 Republiky","ror":"https://ror.org/01pv73b02"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W206440355","https://openalex.org/W1499983649","https://openalex.org/W1950681193","https://openalex.org/W1965748532","https://openalex.org/W2010118595","https://openalex.org/W2010334716","https://openalex.org/W2021148323","https://openalex.org/W2026258334","https://openalex.org/W2029582167","https://openalex.org/W2048846831","https://openalex.org/W2068697786","https://openalex.org/W2094453630","https://openalex.org/W2094727221","https://openalex.org/W2100274914","https://openalex.org/W2112036188","https://openalex.org/W2112449769","https://openalex.org/W2123859926","https://openalex.org/W2126927016","https://openalex.org/W2130788193","https://openalex.org/W2144636407","https://openalex.org/W2147690399","https://openalex.org/W2148119325","https://openalex.org/W2171074980","https://openalex.org/W2171263583","https://openalex.org/W2208154600"],"related_works":["https://openalex.org/W2081900870","https://openalex.org/W2133667137","https://openalex.org/W2380756614","https://openalex.org/W2183306018","https://openalex.org/W2549990292","https://openalex.org/W2345479200","https://openalex.org/W2951819827","https://openalex.org/W2887328214","https://openalex.org/W2952680837","https://openalex.org/W1895669308"],"abstract_inverted_index":{"Several":[0],"local":[1,97],"search":[2],"algorithms":[3,73,94],"for":[4,52,89,112],"real-valued":[5],"domains":[6],"(axis":[7],"parallel":[8],"line":[9],"search,":[10,13],"Nelder-Mead":[11],"simplex":[12],"Rosenbrock's":[14],"algorithm,":[15],"quasi-Newton":[16,160],"method,":[17],"NEWUOA,":[18],"and":[19,23,74,84,128],"VXQR)":[20],"are":[21],"described":[22],"thoroughly":[24],"compared":[25],"in":[26,31,119,139],"this":[27],"article,":[28],"embedding":[29],"them":[30],"a":[32,62,159],"multi-start":[33],"method.":[34,161],"Their":[35],"comparison":[36],"aims":[37],"(1)":[38],"to":[39,47,67,86,147],"help":[40],"the":[41,44,49,79,90,110,113,123,132],"researchers":[42],"from":[43],"evolutionary":[45,93],"community":[46],"choose":[48,56,148],"right":[50],"opponent":[51,58],"their":[53],"algorithm":[54,80,150],"(to":[55],"an":[57,149],"that":[59,118],"would":[60],"constitute":[61],"hard-to-beat":[63],"baseline":[64],"algorithm),":[65],"(2)":[66],"describe":[68],"individual":[69],"features":[70],"of":[71,92,126,141],"these":[72,96],"show":[75,117],"how":[76],"they":[77],"influence":[78],"on":[81,152],"different":[82],"problems,":[83],"(3)":[85],"provide":[87],"inspiration":[88],"hybridization":[91],"with":[95],"optimizers.":[98],"The":[99,115],"recently":[100],"proposed":[101],"Comparing":[102],"Continuous":[103],"Optimizers":[104],"(COCO)":[105],"methodology":[106],"was":[107],"adopted":[108],"as":[109,156],"basis":[111],"comparison.":[114],"results":[116],"low":[120],"dimensional":[121],"spaces,":[122],"old":[124],"method":[125],"Nelder":[127],"Mead":[129],"is":[130,145],"still":[131],"most":[133],"successful":[134],"among":[135],"those":[136],"compared,":[137],"while":[138],"spaces":[140],"higher":[142],"dimensions,":[143],"it":[144],"better":[146],"based":[151],"quadratic":[153],"modeling,":[154],"such":[155],"NEWUOA":[157],"or":[158]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":4},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":2}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}