{"id":"https://openalex.org/W1521427307","doi":null,"title":"Surrogate-Based Optimization using Multifidelity Models with Variable Parameterization","display_name":"Surrogate-Based Optimization using Multifidelity Models with Variable Parameterization","publication_year":2007,"publication_date":"2007-01-01","ids":{"openalex":"https://openalex.org/W1521427307","mag":"1521427307"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.352.6845","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.352.6845","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://acdl.mit.edu/RobinsonAIAA2008.pdf","raw_type":"text"},"volume":null,"type":"article","is_traditional":true,"indexed_in":[],"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/A5109856759","display_name":"Theresa Robinson","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Theresa Robinson","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5109856759"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.8257,"has_fulltext":true,"cited_by_count":18,"citation_normalized_percentile":{"value":0.83053336,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":98},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9883000254631042,"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"}},"topics":[{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9883000254631042,"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.00139999995008111,"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/T10928","display_name":"Probabilistic and Robust Engineering Design","score":0.00139999995008111,"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/surrogate-based-optimization","display_name":"surrogate-based optimization","score":0.9980000257492065},{"id":"https://openalex.org/keywords/trust-region-method","display_name":"trust region method","score":0.8090000152587891},{"id":"https://openalex.org/keywords/design-space-mapping","display_name":"design space mapping","score":0.8220000267028809},{"id":"https://openalex.org/keywords/sequential-quadratic-programming","display_name":"sequential quadratic programming","score":0.8610000014305115},{"id":"https://openalex.org/keywords/wing-design","display_name":"wing design","score":0.7129999995231628},{"id":"https://openalex.org/keywords/flapping-flight","display_name":"flapping flight","score":0.9670000076293945},{"id":"https://openalex.org/keywords/bat-flight","display_name":"bat flight","score":0.8450000286102295},{"id":"https://openalex.org/keywords/computational-cost-reduction","display_name":"computational complexity reduction","score":0.6650000214576721}],"concepts":[{"id":"https://openalex.org/C131675550","wikidata":"https://www.wikidata.org/wiki/Q7646884","display_name":"Surrogate model","level":2,"score":0.8016383051872253},{"id":"https://openalex.org/C68028875","wikidata":"https://www.wikidata.org/wiki/Q7572595","display_name":"Space mapping","level":2,"score":0.7442277669906616},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6635528802871704},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.6010642647743225},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.511275053024292},{"id":"https://openalex.org/C2776459999","wikidata":"https://www.wikidata.org/wiki/Q2119376","display_name":"Fidelity","level":2,"score":0.4481036067008972},{"id":"https://openalex.org/C110850998","wikidata":"https://www.wikidata.org/wiki/Q5377895","display_name":"Engineering optimization","level":3,"score":0.44150370359420776},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.438432514667511},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.43037787079811096},{"id":"https://openalex.org/C28442783","wikidata":"https://www.wikidata.org/wiki/Q3354474","display_name":"Multidisciplinary design optimization","level":3,"score":0.42865774035453796},{"id":"https://openalex.org/C92995354","wikidata":"https://www.wikidata.org/wiki/Q5165499","display_name":"Continuous optimization","level":4,"score":0.4264809191226959},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.297433078289032},{"id":"https://openalex.org/C122357587","wikidata":"https://www.wikidata.org/wiki/Q6934508","display_name":"Multi-swarm optimization","level":3,"score":0.22327813506126404},{"id":"https://openalex.org/C22467394","wikidata":"https://www.wikidata.org/wiki/Q849359","display_name":"Multidisciplinary approach","level":2,"score":0.0},{"id":"https://openalex.org/C36289849","wikidata":"https://www.wikidata.org/wiki/Q34749","display_name":"Social science","level":1,"score":0.0},{"id":"https://openalex.org/C144024400","wikidata":"https://www.wikidata.org/wiki/Q21201","display_name":"Sociology","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/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.352.6845","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.352.6845","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://acdl.mit.edu/RobinsonAIAA2008.pdf","raw_type":"text"},{"id":"mag:1521427307","doi":null,"is_oa":false,"landing_page_url":"http://dspace.mit.edu/bitstream/handle/1721.1/39666/176111691-MIT.pdf;sequence=2","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320338291","display_name":"Sandia National Laboratories","ror":"https://ror.org/01apwpt12"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":64,"referenced_works":["https://openalex.org/W11974643","https://openalex.org/W62791640","https://openalex.org/W147998453","https://openalex.org/W185302982","https://openalex.org/W1486851210","https://openalex.org/W1503147858","https://openalex.org/W1507996268","https://openalex.org/W1515007632","https://openalex.org/W1549749298","https://openalex.org/W1579664581","https://openalex.org/W1606784721","https://openalex.org/W1633869374","https://openalex.org/W1639032689","https://openalex.org/W1663065099","https://openalex.org/W1965976001","https://openalex.org/W1968553199","https://openalex.org/W1976502092","https://openalex.org/W1977822596","https://openalex.org/W1981039871","https://openalex.org/W1982004515","https://openalex.org/W1984753492","https://openalex.org/W1985412770","https://openalex.org/W1991142852","https://openalex.org/W1993271327","https://openalex.org/W1993277338","https://openalex.org/W1993406823","https://openalex.org/W1997138910","https://openalex.org/W1997600725","https://openalex.org/W2001863123","https://openalex.org/W2003172346","https://openalex.org/W2005136695","https://openalex.org/W2006575733","https://openalex.org/W2009327160","https://openalex.org/W2026258334","https://openalex.org/W2029014880","https://openalex.org/W2038210983","https://openalex.org/W2047561018","https://openalex.org/W2057958571","https://openalex.org/W2073359301","https://openalex.org/W2075665712","https://openalex.org/W2075921260","https://openalex.org/W2078035581","https://openalex.org/W2109300664","https://openalex.org/W2109452412","https://openalex.org/W2111070766","https://openalex.org/W2111325674","https://openalex.org/W2113643187","https://openalex.org/W2116661285","https://openalex.org/W2117925822","https://openalex.org/W2117929919","https://openalex.org/W2120101088","https://openalex.org/W2120488458","https://openalex.org/W2121912638","https://openalex.org/W2133809269","https://openalex.org/W2147836374","https://openalex.org/W2154047302","https://openalex.org/W2169316026","https://openalex.org/W2314952948","https://openalex.org/W2316891481","https://openalex.org/W2332535989","https://openalex.org/W2334669509","https://openalex.org/W3108451369","https://openalex.org/W3216634999","https://openalex.org/W4237344571"],"related_works":["https://openalex.org/W2040146655","https://openalex.org/W7096224804","https://openalex.org/W1985927867","https://openalex.org/W2332598546","https://openalex.org/W7154496281","https://openalex.org/W2180941696","https://openalex.org/W2116824228","https://openalex.org/W3027738484","https://openalex.org/W4283211650","https://openalex.org/W1490395397"],"abstract_inverted_index":{"Surrogate-based-optimization":[0],"methods":[1],"provide":[2],"a":[3,16,33,62,76,88,93,124,139],"means":[4],"to":[5,28,64,138],"achieve":[6],"high-fidelity":[7,17,105,120],"design":[8,41,49,69,83,90,110,126],"optimization":[9,84,102],"at":[10],"reduced":[11],"computational":[12],"cost":[13],"by":[14],"using":[15],"model":[18],"in":[19,103,119],"combination":[20],"with":[21,75],"lower-fidelity":[22],"models":[23,45],"that":[24,43,97],"are":[25,51],"less":[26],"expensive":[27],"evaluate.":[29],"This":[30],"paper":[31],"presents":[32],"provably":[34],"convergent":[35],"trust-region":[36,78],"model-management":[37],"methodology":[38],"for":[39,46,80,87],"variableparameterization":[40],"models:":[42],"is,":[44],"which":[47],"the":[48,67,98,104,108,112,145],"parameters":[50],"defined":[52],"over":[53],"different":[54,140],"spaces.":[55,70],"Corrected":[56],"space":[57],"mapping":[58],"is":[59,72],"introduced":[60],"as":[61],"method":[63,79,99,114],"map":[65],"between":[66],"variable-parameterization":[68],"It":[71],"then":[73],"used":[74],"sequential-quadratic-programming-like":[77],"two":[81],"aerospace-related":[82],"problems.":[85],"Results":[86],"wing":[89,109],"problem":[91,95],"and":[92],"flapping-flight":[94],"show":[96],"outperforms":[100],"direct":[101],"space.":[106],"On":[107,123],"problem,":[111,127],"new":[113],"achieves":[115,129],"76":[116],"%":[117,132],"savings":[118],"function":[121],"calls.":[122],"bat-flight":[125],"it":[128,136],"approximately":[130],"45":[131],"time":[133],"savings,":[134],"although":[135],"converges":[137],"local":[141],"minimum":[142],"than":[143],"did":[144],"benchmark.":[146]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-10-12T09:40:04.860316","created_date":"2016-06-24T00:00:00"}