{"id":"https://openalex.org/W2268853128","doi":"https://doi.org/10.1162/evco_a_00174","title":"Evolving a Nelder\u2013Mead Algorithm for Optimization with Genetic Programming","display_name":"Evolving a Nelder\u2013Mead Algorithm for Optimization with Genetic Programming","publication_year":2016,"publication_date":"2016-01-25","ids":{"openalex":"https://openalex.org/W2268853128","doi":"https://doi.org/10.1162/evco_a_00174","mag":"2268853128","pmid":"https://pubmed.ncbi.nlm.nih.gov/26807484"},"language":"en","primary_location":{"id":"doi:10.1162/evco_a_00174","is_oa":false,"landing_page_url":"https://doi.org/10.1162/evco_a_00174","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/A5062968744","display_name":"Iztok Fajfar","orcid":"https://orcid.org/0000-0003-4416-5432"},"institutions":[{"id":"https://openalex.org/I153976015","display_name":"University of Ljubljana","ror":"https://ror.org/05njb9z20","country_code":"SI","type":"education","lineage":["https://openalex.org/I153976015"]}],"countries":["SI"],"is_corresponding":true,"raw_author_name":"Iztok Fajfar","raw_affiliation_strings":["Faculty of Electrical Engineering, University of Ljubljana, Ljubljana, 1000, Slovenia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Electrical Engineering, University of Ljubljana, Ljubljana, 1000, Slovenia","institution_ids":["https://openalex.org/I153976015"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5085873782","display_name":"Janez Puhan","orcid":"https://orcid.org/0000-0003-3288-8254"},"institutions":[{"id":"https://openalex.org/I153976015","display_name":"University of Ljubljana","ror":"https://ror.org/05njb9z20","country_code":"SI","type":"education","lineage":["https://openalex.org/I153976015"]}],"countries":["SI"],"is_corresponding":true,"raw_author_name":"Janez Puhan","raw_affiliation_strings":["Faculty of Electrical Engineering, University of Ljubljana, Ljubljana, 1000, Slovenia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Electrical Engineering, University of Ljubljana, Ljubljana, 1000, Slovenia","institution_ids":["https://openalex.org/I153976015"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5053517383","display_name":"\u00c1rp\u00e1d B\u0171rmen","orcid":"https://orcid.org/0000-0002-3035-1376"},"institutions":[{"id":"https://openalex.org/I153976015","display_name":"University of Ljubljana","ror":"https://ror.org/05njb9z20","country_code":"SI","type":"education","lineage":["https://openalex.org/I153976015"]}],"countries":["SI"],"is_corresponding":true,"raw_author_name":"\u00c1rp\u00e1d B\u0171rmen","raw_affiliation_strings":["Faculty of Electrical Engineering, University of Ljubljana, Ljubljana, 1000, Slovenia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Electrical Engineering, University of Ljubljana, Ljubljana, 1000, Slovenia","institution_ids":["https://openalex.org/I153976015"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5053517383","https://openalex.org/A5062968744","https://openalex.org/A5085873782"],"corresponding_institution_ids":["https://openalex.org/I153976015"],"apc_list":null,"apc_paid":null,"fwci":4.4171,"has_fulltext":false,"cited_by_count":42,"citation_normalized_percentile":{"value":0.94806163,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"25","issue":"3","first_page":"351","last_page":"373"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11975","display_name":"Evolutionary Algorithms and Applications","score":1.0,"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/T11975","display_name":"Evolutionary Algorithms and Applications","score":1.0,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9994000196456909,"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.993399977684021,"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/simplex-algorithm","display_name":"Simplex algorithm","score":0.8076874017715454},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5628214478492737},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5549712777137756},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5469716191291809},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.524359941482544},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.5060576796531677},{"id":"https://openalex.org/keywords/genetic-programming","display_name":"Genetic programming","score":0.484553724527359},{"id":"https://openalex.org/keywords/simplex","display_name":"Simplex","score":0.47961366176605225},{"id":"https://openalex.org/keywords/quadratic-programming","display_name":"Quadratic programming","score":0.4751403331756592},{"id":"https://openalex.org/keywords/sequential-quadratic-programming","display_name":"Sequential quadratic programming","score":0.46563875675201416},{"id":"https://openalex.org/keywords/test-functions-for-optimization","display_name":"Test functions for optimization","score":0.42425310611724854},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.40392571687698364},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.33033913373947144},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.31422436237335205},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.19689100980758667},{"id":"https://openalex.org/keywords/multi-swarm-optimization","display_name":"Multi-swarm optimization","score":0.13623031973838806}],"concepts":[{"id":"https://openalex.org/C144521790","wikidata":"https://www.wikidata.org/wiki/Q134164","display_name":"Simplex algorithm","level":3,"score":0.8076874017715454},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5628214478492737},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5549712777137756},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5469716191291809},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.524359941482544},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.5060576796531677},{"id":"https://openalex.org/C110332635","wikidata":"https://www.wikidata.org/wiki/Q629498","display_name":"Genetic programming","level":2,"score":0.484553724527359},{"id":"https://openalex.org/C62438384","wikidata":"https://www.wikidata.org/wiki/Q331350","display_name":"Simplex","level":2,"score":0.47961366176605225},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.4751403331756592},{"id":"https://openalex.org/C198927703","wikidata":"https://www.wikidata.org/wiki/Q4373881","display_name":"Sequential quadratic programming","level":3,"score":0.46563875675201416},{"id":"https://openalex.org/C150185637","wikidata":"https://www.wikidata.org/wiki/Q7705773","display_name":"Test functions for optimization","level":4,"score":0.42425310611724854},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.40392571687698364},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.33033913373947144},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.31422436237335205},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.19689100980758667},{"id":"https://openalex.org/C122357587","wikidata":"https://www.wikidata.org/wiki/Q6934508","display_name":"Multi-swarm optimization","level":3,"score":0.13623031973838806},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","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}],"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":"D003627","descriptor_name":"Data Interpretation, Statistical","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D003627","descriptor_name":"Data Interpretation, Statistical","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D003627","descriptor_name":"Data Interpretation, Statistical","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D008957","descriptor_name":"Models, Genetic","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D008957","descriptor_name":"Models, Genetic","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D008957","descriptor_name":"Models, Genetic","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D012984","descriptor_name":"Software","qualifier_ui":"Q000592","qualifier_name":"standards","is_major_topic":false},{"descriptor_ui":"D012984","descriptor_name":"Software","qualifier_ui":"Q000592","qualifier_name":"standards","is_major_topic":false},{"descriptor_ui":"D012984","descriptor_name":"Software","qualifier_ui":"Q000592","qualifier_name":"standards","is_major_topic":false},{"descriptor_ui":"D019295","descriptor_name":"Computational Biology","qualifier_ui":"Q000379","qualifier_name":"methods","is_major_topic":false},{"descriptor_ui":"D019295","descriptor_name":"Computational Biology","qualifier_ui":"Q000379","qualifier_name":"methods","is_major_topic":false},{"descriptor_ui":"D019295","descriptor_name":"Computational Biology","qualifier_ui":"Q000379","qualifier_name":"methods","is_major_topic":false}],"locations_count":2,"locations":[{"id":"doi:10.1162/evco_a_00174","is_oa":false,"landing_page_url":"https://doi.org/10.1162/evco_a_00174","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:26807484","is_oa":false,"landing_page_url":"https://pubmed.ncbi.nlm.nih.gov/26807484","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}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W34247295","https://openalex.org/W138562460","https://openalex.org/W181733065","https://openalex.org/W1483736078","https://openalex.org/W1536647479","https://openalex.org/W1576818901","https://openalex.org/W1602506590","https://openalex.org/W1635118735","https://openalex.org/W1820078070","https://openalex.org/W1967064569","https://openalex.org/W1969186573","https://openalex.org/W1988526212","https://openalex.org/W1996387510","https://openalex.org/W2015415797","https://openalex.org/W2024991751","https://openalex.org/W2025555031","https://openalex.org/W2030792885","https://openalex.org/W2037343293","https://openalex.org/W2056603712","https://openalex.org/W2057830724","https://openalex.org/W2058919894","https://openalex.org/W2069861537","https://openalex.org/W2092224777","https://openalex.org/W2131422526","https://openalex.org/W2132196970","https://openalex.org/W2138522309","https://openalex.org/W2160960847","https://openalex.org/W2169369819","https://openalex.org/W2171074980","https://openalex.org/W2531563875","https://openalex.org/W2613722321","https://openalex.org/W4254315320","https://openalex.org/W4285719527"],"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/W1570109187","https://openalex.org/W1583787753","https://openalex.org/W2491692165","https://openalex.org/W2366013513","https://openalex.org/W4244786412"],"abstract_inverted_index":{"We":[0,70],"used":[1,34],"genetic":[2],"programming":[3],"to":[4,12,88,103],"evolve":[5],"a":[6,64],"direct":[7],"search":[8],"optimization":[9,19,52],"algorithm,":[10],"similar":[11],"that":[13,72],"of":[14,67,75],"the":[15,30,59,76,91,95,108,117],"standard":[16,65],"downhill":[17],"simplex":[18],"method":[20,62,111],"proposed":[21],"by":[22,93],"Nelder":[23],"and":[24,43],"Mead":[25],"(":[26],"1965":[27],").":[28],"In":[29],"training":[31],"process,":[32],"we":[33],"several":[35],"ten-dimensional":[36],"quadratic":[37],"functions":[38],"with":[39],"randomly":[40,45],"displaced":[41],"parameters":[42],"different":[44],"generated":[46],"starting":[47],"simplices.":[48],"The":[49,98],"genetically":[50,77],"obtained":[51],"algorithm":[53,79,92,100],"showed":[54],"overall":[55],"better":[56,115],"performance":[57],"than":[58,107,116],"original":[60,109,118],"Nelder-Mead":[61,110],"on":[63],"set":[66],"test":[68],"functions.":[69],"observed":[71],"many":[73],"parts":[74],"produced":[78],"were":[80],"seldom":[81],"or":[82],"never":[83],"executed,":[84],"which":[85],"allowed":[86],"us":[87],"greatly":[89],"simplify":[90],"removing":[94],"redundant":[96],"parts.":[97],"resulting":[99],"turns":[101],"out":[102],"be":[104],"considerably":[105],"simpler":[106],"while":[112],"still":[113],"performing":[114],"method.":[119]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":9},{"year":2021,"cited_by_count":6},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":1}],"updated_date":"2026-05-21T09:19:25.381259","created_date":"2025-10-10T00:00:00"}