{"id":"https://openalex.org/W2068480996","doi":"https://doi.org/10.1137/040620886","title":"Finding Optimal Algorithmic Parameters Using Derivative\u2010Free Optimization","display_name":"Finding Optimal Algorithmic Parameters Using Derivative\u2010Free Optimization","publication_year":2006,"publication_date":"2006-01-01","ids":{"openalex":"https://openalex.org/W2068480996","doi":"https://doi.org/10.1137/040620886","mag":"2068480996"},"language":"en","primary_location":{"id":"doi:10.1137/040620886","is_oa":false,"landing_page_url":"https://doi.org/10.1137/040620886","pdf_url":null,"source":{"id":"https://openalex.org/S928796702","display_name":"SIAM Journal on Optimization","issn_l":"1052-6234","issn":["1052-6234","1095-7189"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Optimization","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/A5089929904","display_name":"Charles Audet","orcid":"https://orcid.org/0000-0002-3043-5393"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Charles Audet","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5027758717","display_name":"Dominique Orban","orcid":"https://orcid.org/0000-0002-8017-7687"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Dominique Orban","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5089929904"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":6.851,"has_fulltext":false,"cited_by_count":130,"citation_normalized_percentile":{"value":0.97163655,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":96,"max":100},"biblio":{"volume":"17","issue":"3","first_page":"642","last_page":"664"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9998999834060669,"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/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.998199999332428,"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"}},{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9980999827384949,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.7734558582305908},{"id":"https://openalex.org/keywords/measure","display_name":"Measure (data warehouse)","score":0.7259308099746704},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.5991120934486389},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5742868185043335},{"id":"https://openalex.org/keywords/flexibility","display_name":"Flexibility (engineering)","score":0.5606508851051331},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5271651148796082},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.508899450302124},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.48247459530830383},{"id":"https://openalex.org/keywords/surrogate-model","display_name":"Surrogate model","score":0.45570454001426697},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.4377744495868683},{"id":"https://openalex.org/keywords/trust-region","display_name":"Trust region","score":0.43140217661857605},{"id":"https://openalex.org/keywords/feasible-region","display_name":"Feasible region","score":0.4108756184577942},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3874596655368805},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.329958438873291},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.1775473952293396}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7734558582305908},{"id":"https://openalex.org/C2780009758","wikidata":"https://www.wikidata.org/wiki/Q6804172","display_name":"Measure (data warehouse)","level":2,"score":0.7259308099746704},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.5991120934486389},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5742868185043335},{"id":"https://openalex.org/C2780598303","wikidata":"https://www.wikidata.org/wiki/Q65921492","display_name":"Flexibility (engineering)","level":2,"score":0.5606508851051331},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5271651148796082},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.508899450302124},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.48247459530830383},{"id":"https://openalex.org/C131675550","wikidata":"https://www.wikidata.org/wiki/Q7646884","display_name":"Surrogate model","level":2,"score":0.45570454001426697},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.4377744495868683},{"id":"https://openalex.org/C89109886","wikidata":"https://www.wikidata.org/wiki/Q1535924","display_name":"Trust region","level":3,"score":0.43140217661857605},{"id":"https://openalex.org/C177067428","wikidata":"https://www.wikidata.org/wiki/Q17013331","display_name":"Feasible region","level":2,"score":0.4108756184577942},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3874596655368805},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.329958438873291},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.1775473952293396},{"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/C178635117","wikidata":"https://www.wikidata.org/wiki/Q747499","display_name":"RADIUS","level":2,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"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/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","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},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/040620886","is_oa":false,"landing_page_url":"https://doi.org/10.1137/040620886","pdf_url":null,"source":{"id":"https://openalex.org/S928796702","display_name":"SIAM Journal on Optimization","issn_l":"1052-6234","issn":["1052-6234","1095-7189"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Optimization","raw_type":"journal-article"},{"id":"pmh:oai:publications.polymtl.ca:23418","is_oa":false,"landing_page_url":"https://publications.polymtl.ca/23418/","pdf_url":null,"source":{"id":"https://openalex.org/S4306401013","display_name":"PolyPublie (\u00c9cole Polytechnique de Montr\u00e9al)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I45683168","host_organization_name":"Polytechnique Montr\u00e9al","host_organization_lineage":["https://openalex.org/I45683168"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Article de revue"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","score":0.7400000095367432,"display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":40,"referenced_works":["https://openalex.org/W88671919","https://openalex.org/W147998453","https://openalex.org/W1551360398","https://openalex.org/W1552227532","https://openalex.org/W1579664581","https://openalex.org/W1786620475","https://openalex.org/W1808259974","https://openalex.org/W1967922776","https://openalex.org/W1985412770","https://openalex.org/W1998855065","https://openalex.org/W2000389939","https://openalex.org/W2001907604","https://openalex.org/W2005874105","https://openalex.org/W2008292066","https://openalex.org/W2014337138","https://openalex.org/W2015530812","https://openalex.org/W2015616421","https://openalex.org/W2016670346","https://openalex.org/W2026079992","https://openalex.org/W2038669746","https://openalex.org/W2048221927","https://openalex.org/W2048799772","https://openalex.org/W2053940560","https://openalex.org/W2063690908","https://openalex.org/W2068484625","https://openalex.org/W2071467620","https://openalex.org/W2085137170","https://openalex.org/W2086315121","https://openalex.org/W2091849172","https://openalex.org/W2094921409","https://openalex.org/W2117311758","https://openalex.org/W2142847239","https://openalex.org/W2149454052","https://openalex.org/W2150329826","https://openalex.org/W2162737890","https://openalex.org/W2256578114","https://openalex.org/W2322554174","https://openalex.org/W2954780004","https://openalex.org/W3216800877","https://openalex.org/W4247680473"],"related_works":["https://openalex.org/W2621796162","https://openalex.org/W2052702129","https://openalex.org/W2784506940","https://openalex.org/W2338031201","https://openalex.org/W2087523368","https://openalex.org/W2107502531","https://openalex.org/W2559130006","https://openalex.org/W2369920403","https://openalex.org/W2119994280","https://openalex.org/W3081404265"],"abstract_inverted_index":{"The":[0,74,96,177],"objectives":[1],"of":[2,47,49,88,112,120,143],"this":[3,80],"paper":[4],"are":[5,20,69,146],"twofold.":[6],"We":[7,116],"devise":[8],"a":[9,26,59,110,141,160,174,191,198],"general":[10],"framework":[11,81],"for":[12,28,40,128],"identifying":[13],"locally":[14,89],"optimal":[15,90,132],"algorithmic":[16],"parameters.":[17],"Algorithmic":[18],"parameters":[19,92,133,178],"treated":[21,57],"as":[22,58],"decision":[23],"variables":[24],"in":[25,71,93,124,197],"problem":[27,192],"which":[29],"no":[30],"derivative":[31],"knowledge":[32],"or":[33],"existence":[34],"is":[35,56,77,104,167],"assumed.":[36],"A":[37,163],"derivative\u2010free":[38,97],"method":[39,98],"optimization":[41],"seeks":[42],"to":[43,78,85,100,136,169,189],"minimize":[44],"some":[45],"measure":[46,55],"performance":[48],"the":[50,66,72,86,102,105,118,121,171],"algorithm":[51],"being":[52],"fine\u2010tuned.":[53],"This":[54],"black\u2010box":[60],"and":[61,123,155,186],"may":[62,151,156],"be":[63],"chosen":[64,99],"by":[65,82],"user.":[67],"Examples":[68],"given":[70],"text.":[73],"second":[75],"objective":[76],"illustrate":[79,117],"specializing":[83],"it":[84],"identification":[87],"trust\u2010region":[91],"unconstrained":[94],"optimization.":[95],"guide":[101,170],"process":[103],"mesh":[106],"adaptive":[107],"direct":[108],"search,":[109],"generalization":[111],"pattern":[113],"search":[114,172],"methods.":[115],"flexibility":[119],"latter":[122],"particular":[125],"make":[126],"provision":[127],"surrogate":[129,165],"objectives.":[130],"Locally,":[131],"with":[134],"respect":[135],"overall":[137],"computational":[138],"time":[139,200],"on":[140],"set":[142],"test":[144],"problems":[145],"identified.":[147],"Each":[148],"function":[149,166],"call":[150],"take":[152],"several":[153],"hours":[154],"not":[157],"always":[158],"return":[159],"predictable":[161],"result.":[162],"tailored":[164],"used":[168,184],"towards":[173],"local":[175],"solution.":[176],"thus":[179],"identified":[180],"differ":[181],"from":[182],"traditionally":[183],"values,":[185],"allow":[187],"one":[188],"solve":[190],"that":[193],"remained":[194],"otherwise":[195],"unsolved":[196],"reasonable":[199],"using":[201],"traditional":[202],"values.":[203]},"counts_by_year":[{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":6},{"year":2022,"cited_by_count":7},{"year":2021,"cited_by_count":13},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":7},{"year":2018,"cited_by_count":7},{"year":2017,"cited_by_count":6},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":19},{"year":2013,"cited_by_count":6},{"year":2012,"cited_by_count":6}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}