{"id":"https://openalex.org/W3183503617","doi":"https://doi.org/10.1080/10556788.2022.2142582","title":"Full-low evaluation methods for derivative-free optimization","display_name":"Full-low evaluation methods for derivative-free optimization","publication_year":2022,"publication_date":"2022-11-11","ids":{"openalex":"https://openalex.org/W3183503617","doi":"https://doi.org/10.1080/10556788.2022.2142582","mag":"3183503617"},"language":"en","primary_location":{"id":"doi:10.1080/10556788.2022.2142582","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10556788.2022.2142582","pdf_url":null,"source":{"id":"https://openalex.org/S103047102","display_name":"Optimization methods & software","issn_l":"1026-7670","issn":["1026-7670","1029-4937","1055-6788"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Optimization Methods and Software","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/A5029030164","display_name":"Albert S. Berahas","orcid":"https://orcid.org/0000-0002-2371-9398"},"institutions":[{"id":"https://openalex.org/I27837315","display_name":"University of Michigan","ror":"https://ror.org/00jmfr291","country_code":"US","type":"education","lineage":["https://openalex.org/I27837315"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"A. S. Berahas","raw_affiliation_strings":["Department of Industrial & Operations Engineering, University of Michigan, Ann Arbor, MI, USA"],"raw_orcid":"https://orcid.org/0000-0002-2371-9398","affiliations":[{"raw_affiliation_string":"Department of Industrial & Operations Engineering, University of Michigan, Ann Arbor, MI, USA","institution_ids":["https://openalex.org/I27837315"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5078281814","display_name":"Oumaima Sohab","orcid":"https://orcid.org/0000-0003-3633-5518"},"institutions":[{"id":"https://openalex.org/I186143895","display_name":"Lehigh University","ror":"https://ror.org/012afjb06","country_code":"US","type":"education","lineage":["https://openalex.org/I186143895"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"O. Sohab","raw_affiliation_strings":["Department of Industrial and Systems Engineering, Lehigh University, Bethlehem, PA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Industrial and Systems Engineering, Lehigh University, Bethlehem, PA, USA","institution_ids":["https://openalex.org/I186143895"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5045737795","display_name":"L. N. Vicente","orcid":"https://orcid.org/0000-0003-1097-6384"},"institutions":[{"id":"https://openalex.org/I186143895","display_name":"Lehigh University","ror":"https://ror.org/012afjb06","country_code":"US","type":"education","lineage":["https://openalex.org/I186143895"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"L. N. Vicente","raw_affiliation_strings":["Department of Industrial and Systems Engineering, Lehigh University, Bethlehem, PA, USA"],"raw_orcid":"https://orcid.org/0000-0003-1097-6384","affiliations":[{"raw_affiliation_string":"Department of Industrial and Systems Engineering, Lehigh University, Bethlehem, PA, USA","institution_ids":["https://openalex.org/I186143895"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5045737795"],"corresponding_institution_ids":["https://openalex.org/I186143895"],"apc_list":null,"apc_paid":null,"fwci":1.8754,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.81011066,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"38","issue":"2","first_page":"386","last_page":"411"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9995999932289124,"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.9995999932289124,"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.9976999759674072,"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/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9975000023841858,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/line-search","display_name":"Line search","score":0.8444771766662598},{"id":"https://openalex.org/keywords/smoothness","display_name":"Smoothness","score":0.7034707069396973},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5641336441040039},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5196546316146851},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5102806091308594},{"id":"https://openalex.org/keywords/descent-direction","display_name":"Descent direction","score":0.4899291396141052},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4740345776081085},{"id":"https://openalex.org/keywords/gradient-descent","display_name":"Gradient descent","score":0.47138410806655884},{"id":"https://openalex.org/keywords/jacobian-matrix-and-determinant","display_name":"Jacobian matrix and determinant","score":0.46249818801879883},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.45678648352622986},{"id":"https://openalex.org/keywords/noise","display_name":"Noise (video)","score":0.4561469256877899},{"id":"https://openalex.org/keywords/stochastic-gradient-descent","display_name":"Stochastic gradient descent","score":0.42803168296813965},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.42761799693107605},{"id":"https://openalex.org/keywords/broyden\u2013fletcher\u2013goldfarb\u2013shanno-algorithm","display_name":"Broyden\u2013Fletcher\u2013Goldfarb\u2013Shanno algorithm","score":0.4209108352661133},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.41943058371543884},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.17234671115875244},{"id":"https://openalex.org/keywords/artificial-neural-network","display_name":"Artificial neural network","score":0.14463096857070923},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.09138762950897217},{"id":"https://openalex.org/keywords/image","display_name":"Image (mathematics)","score":0.08956199884414673}],"concepts":[{"id":"https://openalex.org/C85522705","wikidata":"https://www.wikidata.org/wiki/Q3278015","display_name":"Line search","level":3,"score":0.8444771766662598},{"id":"https://openalex.org/C102634674","wikidata":"https://www.wikidata.org/wiki/Q868473","display_name":"Smoothness","level":2,"score":0.7034707069396973},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5641336441040039},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5196546316146851},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5102806091308594},{"id":"https://openalex.org/C116149140","wikidata":"https://www.wikidata.org/wiki/Q2070951","display_name":"Descent direction","level":4,"score":0.4899291396141052},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4740345776081085},{"id":"https://openalex.org/C153258448","wikidata":"https://www.wikidata.org/wiki/Q1199743","display_name":"Gradient descent","level":3,"score":0.47138410806655884},{"id":"https://openalex.org/C200331156","wikidata":"https://www.wikidata.org/wiki/Q506041","display_name":"Jacobian matrix and determinant","level":2,"score":0.46249818801879883},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.45678648352622986},{"id":"https://openalex.org/C99498987","wikidata":"https://www.wikidata.org/wiki/Q2210247","display_name":"Noise (video)","level":3,"score":0.4561469256877899},{"id":"https://openalex.org/C206688291","wikidata":"https://www.wikidata.org/wiki/Q7617819","display_name":"Stochastic gradient descent","level":3,"score":0.42803168296813965},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.42761799693107605},{"id":"https://openalex.org/C132721684","wikidata":"https://www.wikidata.org/wiki/Q2877013","display_name":"Broyden\u2013Fletcher\u2013Goldfarb\u2013Shanno algorithm","level":3,"score":0.4209108352661133},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.41943058371543884},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.17234671115875244},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"score":0.14463096857070923},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.09138762950897217},{"id":"https://openalex.org/C115961682","wikidata":"https://www.wikidata.org/wiki/Q860623","display_name":"Image (mathematics)","level":2,"score":0.08956199884414673},{"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/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","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/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"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/C151319957","wikidata":"https://www.wikidata.org/wiki/Q752739","display_name":"Asynchronous communication","level":2,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/10556788.2022.2142582","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10556788.2022.2142582","pdf_url":null,"source":{"id":"https://openalex.org/S103047102","display_name":"Optimization methods & software","issn_l":"1026-7670","issn":["1026-7670","1029-4937","1055-6788"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Optimization Methods and Software","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G8541693228","display_name":null,"funder_award_id":"FCT/MCTES UIDB/MAT/00324/2020","funder_id":"https://openalex.org/F4320335246","funder_display_name":"Centro de Matem\u00e1tica, Universidade de Coimbra"}],"funders":[{"id":"https://openalex.org/F4320335246","display_name":"Centro de Matem\u00e1tica, Universidade de Coimbra","ror":"https://ror.org/04z8k9a98"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":60,"referenced_works":["https://openalex.org/W147998453","https://openalex.org/W181733065","https://openalex.org/W1491103246","https://openalex.org/W1548898283","https://openalex.org/W1551360398","https://openalex.org/W1977405322","https://openalex.org/W1985412770","https://openalex.org/W1986294906","https://openalex.org/W1994465229","https://openalex.org/W1998855065","https://openalex.org/W2005136695","https://openalex.org/W2009797711","https://openalex.org/W2014337138","https://openalex.org/W2024366558","https://openalex.org/W2026977976","https://openalex.org/W2038210983","https://openalex.org/W2041461390","https://openalex.org/W2043626538","https://openalex.org/W2048153686","https://openalex.org/W2051598083","https://openalex.org/W2052143039","https://openalex.org/W2054875385","https://openalex.org/W2055762706","https://openalex.org/W2057565823","https://openalex.org/W2057830724","https://openalex.org/W2078409719","https://openalex.org/W2088127528","https://openalex.org/W2098733422","https://openalex.org/W2103111465","https://openalex.org/W2106120648","https://openalex.org/W2124289529","https://openalex.org/W2133356919","https://openalex.org/W2145896656","https://openalex.org/W2149454052","https://openalex.org/W2155842381","https://openalex.org/W2158590920","https://openalex.org/W2158828231","https://openalex.org/W2160960847","https://openalex.org/W2162737890","https://openalex.org/W2167511885","https://openalex.org/W2171830216","https://openalex.org/W2471961201","https://openalex.org/W2626799700","https://openalex.org/W2761472785","https://openalex.org/W2775085189","https://openalex.org/W2941034199","https://openalex.org/W2963477800","https://openalex.org/W2989128237","https://openalex.org/W2993741887","https://openalex.org/W3029645440","https://openalex.org/W3102143361","https://openalex.org/W3125612732","https://openalex.org/W3130696596","https://openalex.org/W3163478863","https://openalex.org/W3173141421","https://openalex.org/W3201961312","https://openalex.org/W4206768783","https://openalex.org/W4251968008","https://openalex.org/W4300448178","https://openalex.org/W6603514168"],"related_works":["https://openalex.org/W2615612939","https://openalex.org/W2002303885","https://openalex.org/W2761098424","https://openalex.org/W1993453088","https://openalex.org/W2166369963","https://openalex.org/W2067207573","https://openalex.org/W2018215034","https://openalex.org/W4220786608","https://openalex.org/W2010088179","https://openalex.org/W3163619541"],"abstract_inverted_index":{"We":[0],"propose":[1],"a":[2,41,82,92,113,188],"new":[3],"class":[4,42],"of":[5,14,23,43,54,134,174,191,196,204,226],"rigorous":[6],"methods":[7,211],"for":[8,21],"derivative-free":[9],"optimization":[10],"with":[11,153,223],"the":[12,72,78,100,108,132,139,172,175,198,202],"aim":[13],"delivering":[15],"efficient":[16,216],"and":[17,30,74,107,145,157,177,217,228],"robust":[18,130,218],"numerical":[19],"performance":[20,70],"functions":[22],"all":[24],"types,":[25],"from":[26,163],"smooth":[27,73],"to":[28,165,214],"non-smooth,":[29],"under":[31],"different":[32,224],"noise":[33,135],"regimes.":[34],"To":[35],"this":[36],"end,":[37],"we":[38,80,141,148,186],"have":[39],"developed":[40,169],"methods,":[44,48],"called":[45],"Full-Low":[46,209],"Evaluation":[47,210],"organized":[49],"around":[50],"two":[51],"main":[52],"types":[53],"iterations.":[55],"The":[56,117],"first":[57],"iteration":[58,119],"type":[59,120],"(called":[60,121],"Full-Eval)":[61],"is":[62,96,123],"expensive":[63],"in":[64,71,125,131,146,219],"function":[65,126],"evaluations,":[66,127],"but":[67],"exhibits":[68],"good":[69],"non-noisy":[75],"cases.":[76],"For":[77,138],"theory,":[79,140],"consider":[81,142],"line":[83],"search":[84,152],"based":[85,170],"on":[86,171],"an":[87],"approximate":[88],"gradient,":[89],"backtracking":[90],"until":[91],"sufficient":[93],"decrease":[94],"condition":[95,162],"satisfied.":[97],"In":[98],"practice,":[99],"gradient":[101],"was":[102,110,168],"approximated":[103],"via":[104],"finite":[105],"differences,":[106],"direction":[109,156],"calculated":[111],"by":[112],"quasi-Newton":[114],"step":[115],"(BFGS).":[116],"second":[118],"Low-Eval)":[122],"cheap":[124],"yet":[128],"more":[129],"presence":[133],"or":[136],"non-smoothness.":[137],"direct":[143,151],"search,":[144],"practice":[147,220],"use":[149],"probabilistic":[150],"one":[154],"random":[155],"its":[158],"negative.":[159],"A":[160],"switch":[161],"Full-Eval":[164,182],"Low-Eval":[166,199],"iterations":[167,200],"values":[173],"line-search":[176],"direct-search":[178],"stepsizes.":[179],"If":[180],"enough":[181],"steps":[183],"are":[184,212],"taken,":[185],"derive":[187],"complexity":[189],"result":[190],"gradient-descent":[192],"type.":[193],"Under":[194],"failure":[195],"Full-Eval,":[197],"become":[201],"drivers":[203],"convergence":[205],"yielding":[206],"non-smooth":[207],"convergence.":[208],"shown":[213],"be":[215],"across":[221],"problems":[222],"levels":[225],"smoothness":[227],"noise.":[229]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":3},{"year":2022,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}