{"id":"https://openalex.org/W7140081718","doi":"https://doi.org/10.1016/j.automatica.2026.112926","title":"Data-efficient global extremum seeking framework for constrained optimization of nonlinear dynamical systems","display_name":"Data-efficient global extremum seeking framework for constrained optimization of nonlinear dynamical systems","publication_year":2026,"publication_date":"2026-03-23","ids":{"openalex":"https://openalex.org/W7140081718","doi":"https://doi.org/10.1016/j.automatica.2026.112926"},"language":"en","primary_location":{"id":"doi:10.1016/j.automatica.2026.112926","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.automatica.2026.112926","pdf_url":null,"source":{"id":"https://openalex.org/S51360982","display_name":"Automatica","issn_l":"0005-1098","issn":["0005-1098","1873-2836"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Automatica","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://doi.org/10.1016/j.automatica.2026.112926","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5093316415","display_name":"Wouter Weekers","orcid":"https://orcid.org/0009-0007-9680-3447"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Wouter Weekers","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5076959215","display_name":"Alessandro Saccon","orcid":"https://orcid.org/0000-0001-5318-1747"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Alessandro Saccon","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5130362005","display_name":"Nathan van de Wouw","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Nathan van de Wouw","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":3500,"currency":"USD","value_usd":3500},"apc_paid":{"value":3500,"currency":"USD","value_usd":3500},"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.29952072,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"188","issue":null,"first_page":"112926","last_page":"112926"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T14083","display_name":"Extremum Seeking Control Systems","score":0.9980000257492065,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T14083","display_name":"Extremum Seeking Control Systems","score":0.9980000257492065,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12794","display_name":"Adaptive Dynamic Programming Control","score":0.00019999999494757503,"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/T10040","display_name":"Adaptive Control of Nonlinear Systems","score":9.999999747378752e-05,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"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/constrained-optimization","display_name":"Constrained optimization","score":0.6328999996185303},{"id":"https://openalex.org/keywords/nonlinear-system","display_name":"Nonlinear system","score":0.5396999716758728},{"id":"https://openalex.org/keywords/control-theory","display_name":"Control theory (sociology)","score":0.5027999877929688},{"id":"https://openalex.org/keywords/constrained-optimization-problem","display_name":"Constrained optimization problem","score":0.49380001425743103},{"id":"https://openalex.org/keywords/dynamical-systems-theory","display_name":"Dynamical systems theory","score":0.44510000944137573},{"id":"https://openalex.org/keywords/nonlinear-dynamical-systems","display_name":"Nonlinear dynamical systems","score":0.41940000653266907}],"concepts":[{"id":"https://openalex.org/C55660270","wikidata":"https://www.wikidata.org/wiki/Q5164377","display_name":"Constrained optimization","level":2,"score":0.6328999996185303},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.5396999716758728},{"id":"https://openalex.org/C47446073","wikidata":"https://www.wikidata.org/wiki/Q5165890","display_name":"Control theory (sociology)","level":3,"score":0.5027999877929688},{"id":"https://openalex.org/C2989514635","wikidata":"https://www.wikidata.org/wiki/Q5164377","display_name":"Constrained optimization problem","level":3,"score":0.49380001425743103},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4584999978542328},{"id":"https://openalex.org/C79379906","wikidata":"https://www.wikidata.org/wiki/Q3174497","display_name":"Dynamical systems theory","level":2,"score":0.44510000944137573},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4348999857902527},{"id":"https://openalex.org/C2983030100","wikidata":"https://www.wikidata.org/wiki/Q638328","display_name":"Nonlinear dynamical systems","level":3,"score":0.41940000653266907},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.38690000772476196},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3720000088214874},{"id":"https://openalex.org/C33962884","wikidata":"https://www.wikidata.org/wiki/Q378637","display_name":"Dynamical system (definition)","level":3,"score":0.34790000319480896},{"id":"https://openalex.org/C115527620","wikidata":"https://www.wikidata.org/wiki/Q769909","display_name":"Nonlinear programming","level":3,"score":0.3458000123500824},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.33959999680519104},{"id":"https://openalex.org/C13662910","wikidata":"https://www.wikidata.org/wiki/Q193139","display_name":"Trajectory","level":2,"score":0.3246999979019165},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.27489998936653137},{"id":"https://openalex.org/C91575142","wikidata":"https://www.wikidata.org/wiki/Q1971426","display_name":"Optimal control","level":2,"score":0.26499998569488525}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1016/j.automatica.2026.112926","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.automatica.2026.112926","pdf_url":null,"source":{"id":"https://openalex.org/S51360982","display_name":"Automatica","issn_l":"0005-1098","issn":["0005-1098","1873-2836"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Automatica","raw_type":"journal-article"},{"id":"pmh:oai:pure.tue.nl:publications/23c180a8-ccd4-483e-95f9-ec194e55057e","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/23c180a8-ccd4-483e-95f9-ec194e55057e","pdf_url":"https://pure.tue.nl/ws/files/386559846/1-s2.0-S000510982600110X-main.pdf","source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Weekers, W, Saccon, A & Wouw, van de, N 2026, 'Data-efficient global extremum seeking framework for constrained optimization of nonlinear dynamical systems', Automatica, vol. 188, 112926. https://doi.org/10.1016/j.automatica.2026.112926","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"doi:10.1016/j.automatica.2026.112926","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.automatica.2026.112926","pdf_url":null,"source":{"id":"https://openalex.org/S51360982","display_name":"Automatica","issn_l":"0005-1098","issn":["0005-1098","1873-2836"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Automatica","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320321800","display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","ror":"https://ror.org/04jsz6e67"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W1821952947","https://openalex.org/W1976181583","https://openalex.org/W1986280275","https://openalex.org/W2026299065","https://openalex.org/W2039110906","https://openalex.org/W2047988719","https://openalex.org/W2092611373","https://openalex.org/W2095062552","https://openalex.org/W2113741278","https://openalex.org/W2124548165","https://openalex.org/W2129250732","https://openalex.org/W2129702562","https://openalex.org/W2142104050","https://openalex.org/W2164640872","https://openalex.org/W2591045852","https://openalex.org/W2940993998","https://openalex.org/W2963290694","https://openalex.org/W2995250190","https://openalex.org/W3153900045","https://openalex.org/W3208387903","https://openalex.org/W4281811029","https://openalex.org/W4289768485","https://openalex.org/W4388904296","https://openalex.org/W4391055339","https://openalex.org/W4402916794","https://openalex.org/W4413246528"],"related_works":[],"abstract_inverted_index":{"We":[0,139,201],"present":[1],"a":[2,53,112,168,265,279,294],"novel,":[3],"data-efficient,":[4],"global":[5,28,58,113,223,299],"extremum-seeking":[6],"control":[7],"(ESC)":[8],"framework":[9,25],"for":[10,60,85],"performance":[11,179],"optimization":[12,114,208,228,252],"of":[13,41,55,69,102,128,147,166,174,193,206,219,222,225,244,257,274,281,288,296],"dynamical":[14],"systems":[15],"with":[16,264],"constraints":[17],"that":[18,203],"are":[19,262],"analytically":[20],"unknown":[21],"but":[22],"measurable.":[23],"This":[24],"extends":[26],"existing":[27,198],"ESC":[29,86,199,306],"approaches":[30],"to":[31,44,52,80,98,105,124,157,160,177,212,214,248,291,293,302],"(1)":[32],"facilitate":[33],"constrained":[34,57,227,251,298],"optimization,":[35],"and":[36,131,254],"(2)":[37],"reduce":[38,99],"the":[39,56,67,82,100,117,121,129,144,162,171,186,204,207,220,226,242,245,250,255,259,272,275,286,297],"number":[40,101,173,287],"measurements":[42,79,103,175,289],"required":[43,84,104,176,290],"optimize":[45,106,178],"performance.":[46],"The":[47],"proposed":[48,118,187,246],"approach":[49,119,188,247],"guarantees":[50],"convergence":[51],"neighborhood":[54,218,295],"optimum":[59,300],"suitably":[61],"tuned":[62],"design":[63],"variables;":[64],"even":[65,108],"in":[66,93,111,285],"presence":[68],"suboptimal":[70],"local":[71],"solutions":[72,224],"or":[73],"disconnected":[74],"feasible":[75],"sets.":[76],"Moreover,":[77],"performing":[78,167],"gather":[81],"data":[83,123,196],"updates":[87],"can":[88,153,180,234],"be":[89,155,181,235],"costly":[90],"and/or":[91],"time-consuming":[92],"practice,":[94],"making":[95],"it":[96],"desirable":[97],"performance,":[107],"more":[109,190,282],"so":[110],"setting.":[115],"Therefore,":[116],"uses":[120],"collected":[122,195],"construct":[125],"online":[126],"approximations":[127,164,277],"cost":[130],"constraint":[132,232],"functions":[133],"using":[134,258,304],"kernel-based":[135,149,163,260,276],"function":[136],"approximation":[137,145],"methods.":[138],"provide":[140],"verifiable":[141],"bounds":[142,152],"on":[143],"errors":[146],"these":[148],"approximations.":[150],"These":[151],"subsequently":[154],"used":[156],"decide":[158],"when":[159],"exploit":[161],"instead":[165],"measurement.":[169],"Herewith,":[170],"total":[172],"reduced":[182],"significantly.":[183],"As":[184],"such,":[185],"makes":[189],"efficient":[191],"use":[192,273],"previously":[194],"than":[197,283],"approaches.":[200],"show":[202],"output":[205],"algorithm":[209],"is":[210],"guaranteed":[211],"converge":[213,292],"an":[215],"arbitrarily":[216,237],"small":[217,238],"set":[221],"problem.":[229],"Consequently,":[230],"potential":[231],"violations":[233],"made":[236],"as":[239],"well.":[240],"Furthermore,":[241],"ability":[243],"solve":[249],"problem,":[253],"benefits":[256],"approximations,":[261],"illustrated":[263],"simulation":[266,270],"example.":[267],"In":[268],"this":[269],"example,":[271],"allows":[278],"reduction":[280],"60%":[284],"compared":[301],"only":[303],"\u2018regular\u2019":[305],"updates.":[307]},"counts_by_year":[],"updated_date":"2026-03-24T06:04:31.470712","created_date":"2026-03-24T00:00:00"}