{"id":"https://openalex.org/W2115022595","doi":"https://doi.org/10.1109/tii.2011.2166799","title":"Comparative Study of Derivative Free Optimization Algorithms","display_name":"Comparative Study of Derivative Free Optimization Algorithms","publication_year":2011,"publication_date":"2011-09-15","ids":{"openalex":"https://openalex.org/W2115022595","doi":"https://doi.org/10.1109/tii.2011.2166799","mag":"2115022595"},"language":"en","primary_location":{"id":"doi:10.1109/tii.2011.2166799","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tii.2011.2166799","pdf_url":null,"source":{"id":"https://openalex.org/S184777250","display_name":"IEEE Transactions on Industrial Informatics","issn_l":"1551-3203","issn":["1551-3203","1941-0050"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Industrial Informatics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"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/A5111424200","display_name":"Nam Pham","orcid":"https://orcid.org/0009-0007-9825-6117"},"institutions":[{"id":"https://openalex.org/I82497590","display_name":"Auburn University","ror":"https://ror.org/02v80fc35","country_code":"US","type":"education","lineage":["https://openalex.org/I82497590"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Nam Pham","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Auburn University, Auburn, AL, USA","Dept. of Electr. & Comput. Eng, Auburn Univ., Auburn, AL, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Auburn University, Auburn, AL, USA","institution_ids":["https://openalex.org/I82497590"]},{"raw_affiliation_string":"Dept. of Electr. & Comput. Eng, Auburn Univ., Auburn, AL, USA","institution_ids":["https://openalex.org/I82497590"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5060342311","display_name":"A. Malinowski","orcid":"https://orcid.org/0000-0001-7010-5738"},"institutions":[{"id":"https://openalex.org/I24648388","display_name":"Bradley University","ror":"https://ror.org/04kmeaw70","country_code":"US","type":"education","lineage":["https://openalex.org/I24648388"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"A. Malinowski","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Bradley University, Peoria, IL, USA","Dept. of Electr. & Comput. Eng., Bradley Univ., Peoria, IL, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Bradley University, Peoria, IL, USA","institution_ids":["https://openalex.org/I24648388"]},{"raw_affiliation_string":"Dept. of Electr. & Comput. Eng., Bradley Univ., Peoria, IL, USA","institution_ids":["https://openalex.org/I24648388"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5009197536","display_name":"Tomasz Bartczak","orcid":"https://orcid.org/0009-0003-3168-2243"},"institutions":[{"id":"https://openalex.org/I4210109085","display_name":"University of Information Technology and Management in Rzeszow","ror":"https://ror.org/01t81sv44","country_code":"PL","type":"education","lineage":["https://openalex.org/I4210109085"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"T. Bartczak","raw_affiliation_strings":["Department of Electronics and Telecommunications, University of Information Technology and Management, Rzeszow, Poland","Dept. of Electron. & Telecommun., Univ. of Inf. Technol. & Manage., Rzeszow, Poland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electronics and Telecommunications, University of Information Technology and Management, Rzeszow, Poland","institution_ids":["https://openalex.org/I4210109085"]},{"raw_affiliation_string":"Dept. of Electron. & Telecommun., Univ. of Inf. Technol. & Manage., Rzeszow, Poland","institution_ids":["https://openalex.org/I4210109085"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":5.2757,"has_fulltext":false,"cited_by_count":63,"citation_normalized_percentile":{"value":0.95565837,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"7","issue":"4","first_page":"592","last_page":"600"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9995999932289124,"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.9995999932289124,"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9944999814033508,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12661","display_name":"Iterative Methods for Nonlinear Equations","score":0.9909999966621399,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/derivative-free-optimization","display_name":"Derivative-free optimization","score":0.6423393487930298},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6267818212509155},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.6179348826408386},{"id":"https://openalex.org/keywords/simplex-algorithm","display_name":"Simplex algorithm","score":0.5986213684082031},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.5825550556182861},{"id":"https://openalex.org/keywords/rate-of-convergence","display_name":"Rate of convergence","score":0.5577069520950317},{"id":"https://openalex.org/keywords/meta-optimization","display_name":"Meta-optimization","score":0.554046094417572},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5505906343460083},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5436469912528992},{"id":"https://openalex.org/keywords/particle-swarm-optimization","display_name":"Particle swarm optimization","score":0.5273058414459229},{"id":"https://openalex.org/keywords/simplex","display_name":"Simplex","score":0.5077582597732544},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.492485374212265},{"id":"https://openalex.org/keywords/continuous-optimization","display_name":"Continuous optimization","score":0.46853795647621155},{"id":"https://openalex.org/keywords/multi-swarm-optimization","display_name":"Multi-swarm optimization","score":0.45488643646240234},{"id":"https://openalex.org/keywords/differential-evolution","display_name":"Differential evolution","score":0.41236284375190735},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3280009627342224},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.2884831428527832},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.17658060789108276}],"concepts":[{"id":"https://openalex.org/C29282572","wikidata":"https://www.wikidata.org/wiki/Q16977029","display_name":"Derivative-free optimization","level":4,"score":0.6423393487930298},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6267818212509155},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.6179348826408386},{"id":"https://openalex.org/C144521790","wikidata":"https://www.wikidata.org/wiki/Q134164","display_name":"Simplex algorithm","level":3,"score":0.5986213684082031},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.5825550556182861},{"id":"https://openalex.org/C57869625","wikidata":"https://www.wikidata.org/wiki/Q1783502","display_name":"Rate of convergence","level":3,"score":0.5577069520950317},{"id":"https://openalex.org/C4935549","wikidata":"https://www.wikidata.org/wiki/Q6822261","display_name":"Meta-optimization","level":3,"score":0.554046094417572},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5505906343460083},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5436469912528992},{"id":"https://openalex.org/C85617194","wikidata":"https://www.wikidata.org/wiki/Q2072794","display_name":"Particle swarm optimization","level":2,"score":0.5273058414459229},{"id":"https://openalex.org/C62438384","wikidata":"https://www.wikidata.org/wiki/Q331350","display_name":"Simplex","level":2,"score":0.5077582597732544},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.492485374212265},{"id":"https://openalex.org/C92995354","wikidata":"https://www.wikidata.org/wiki/Q5165499","display_name":"Continuous optimization","level":4,"score":0.46853795647621155},{"id":"https://openalex.org/C122357587","wikidata":"https://www.wikidata.org/wiki/Q6934508","display_name":"Multi-swarm optimization","level":3,"score":0.45488643646240234},{"id":"https://openalex.org/C74750220","wikidata":"https://www.wikidata.org/wiki/Q2662197","display_name":"Differential evolution","level":2,"score":0.41236284375190735},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3280009627342224},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.2884831428527832},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.17658060789108276},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"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/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tii.2011.2166799","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tii.2011.2166799","pdf_url":null,"source":{"id":"https://openalex.org/S184777250","display_name":"IEEE Transactions on Industrial Informatics","issn_l":"1551-3203","issn":["1551-3203","1941-0050"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Industrial Informatics","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W1512858435","https://openalex.org/W1530715683","https://openalex.org/W1595159159","https://openalex.org/W1699954493","https://openalex.org/W1885335175","https://openalex.org/W1976140324","https://openalex.org/W1994569450","https://openalex.org/W1995832922","https://openalex.org/W2015415797","https://openalex.org/W2024991751","https://openalex.org/W2027393638","https://openalex.org/W2031316504","https://openalex.org/W2056603712","https://openalex.org/W2081989804","https://openalex.org/W2093502197","https://openalex.org/W2100299576","https://openalex.org/W2101905272","https://openalex.org/W2104525533","https://openalex.org/W2108053256","https://openalex.org/W2124061247","https://openalex.org/W2133262661","https://openalex.org/W2134747449","https://openalex.org/W2137340504","https://openalex.org/W2159318234","https://openalex.org/W2163523563","https://openalex.org/W2164479964","https://openalex.org/W2166129212","https://openalex.org/W2166874507","https://openalex.org/W2169369819","https://openalex.org/W2170671245","https://openalex.org/W2171074980","https://openalex.org/W2256578114","https://openalex.org/W6639579346"],"related_works":["https://openalex.org/W2356516493","https://openalex.org/W2389745779","https://openalex.org/W2376444000","https://openalex.org/W1988325824","https://openalex.org/W2365047340","https://openalex.org/W2186293978","https://openalex.org/W2133565636","https://openalex.org/W2019585418","https://openalex.org/W2965688532","https://openalex.org/W2391889613"],"abstract_inverted_index":{"Derivative":[0],"free":[1,35],"optimization":[2,36,93,149],"algorithms":[3,37,150],"are":[4,20,100],"often":[5],"used":[6,52],"when":[7],"it":[8,74,104],"is":[9,28,48,130],"difficult":[10],"to":[11,102],"find":[12],"function":[13],"derivatives,":[14],"or":[15],"if":[16],"finding":[17],"such":[18,151],"derivatives":[19],"time":[21],"consuming.":[22],"The":[23,60,115],"Nelder":[24],"Mead's":[25],"simplex":[26,61,167],"method":[27,62],"one":[29],"of":[30,41,54,70,83,98,107,134],"the":[31,39,108,112,128,131,153,156,160,165,170],"most":[32],"popular":[33,148],"derivative":[34],"in":[38,92,105],"fields":[40],"engineering,":[42],"statistics,":[43],"and":[44,50,58,111,122,164,176],"sciences.":[45],"This":[46,86,137],"algorithm":[47,117,138],"favored":[49],"widely":[51],"because":[53],"its":[55,90],"fast":[56],"convergence":[57,109,113,124],"simplicity.":[59],"converges":[63],"really":[64],"well":[65],"with":[66,80,118,146],"small":[67],"scale":[68],"problems":[69,82],"some":[71],"variables.":[72,85],"However,":[73],"does":[75],"not":[76],"have":[77],"much":[78],"success":[79,120],"large-scale":[81],"multiple":[84],"factor":[87],"has":[88],"reduced":[89],"popularity":[91],"sciences":[94],"significantly.":[95],"Two":[96],"solutions":[97],"quasi-gradients":[99],"introduced":[101],"improve":[103],"terms":[106],"rate":[110,121],"speed.":[114],"improved":[116],"higher":[119],"faster":[123],"which":[125],"still":[126],"maintains":[127],"simplicity":[129],"key":[132],"feature":[133],"this":[135],"paper.":[136],"will":[139,173],"be":[140,174],"compared":[141],"on":[142],"several":[143],"benchmark":[144],"functions":[145],"other":[147],"as":[152],"genetic":[154],"algorithm,":[155,159,163],"differential":[157],"evolution":[158],"particle":[161],"swarm":[162],"original":[166],"method.":[168],"Then,":[169],"comparing":[171],"results":[172],"reported":[175],"discussed.":[177]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":12},{"year":2020,"cited_by_count":6},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":7}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}