{"id":"https://openalex.org/W276676705","doi":null,"title":"A computational methodology for learning low-complexity surrogate models of process from experiments or simulations. (Paper 679a)","display_name":"A computational methodology for learning low-complexity surrogate models of process from experiments or simulations. (Paper 679a)","publication_year":2011,"publication_date":"2011-01-01","ids":{"openalex":"https://openalex.org/W276676705","mag":"276676705"},"language":"en","primary_location":{"id":"mag:276676705","doi":null,"is_oa":false,"landing_page_url":"http://www.osti.gov/scitech/biblio/1036498","pdf_url":null,"source":{"id":"https://openalex.org/S4306402487","display_name":"OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I139351228","host_organization_name":"Office of Scientific and Technical Information","host_organization_lineage":["https://openalex.org/I139351228"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},"volume":null,"type":"article","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/A5046532987","display_name":"Alison Cozad","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Alison Cozad","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5031811254","display_name":"Nikolaos V. Sahinidis","orcid":"https://orcid.org/0000-0003-2087-9131","observed_orcids":["https://orcid.org/0000-0003-2087-9131"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Nikolaos V. Sahinidis","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0003-2087-9131","affiliations":[]},{"author_position":"last","author":{"id":null,"display_name":"Danny Miller","orcid":"https://orcid.org/0000-0001-8428-7640","observed_orcids":["https://orcid.org/0000-0001-8428-7640"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Danny Miller","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0001-8428-7640","affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.0182792,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"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.5386000275611877,"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.5386000275611877,"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/T11053","display_name":"Process Optimization and Integration","score":0.14249999821186066,"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/T11798","display_name":"Optimal Experimental Design Methods","score":0.1307000070810318,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/surrogate-modeling","display_name":"surrogate models","score":0.9390000104904175},{"id":"https://openalex.org/keywords/process-simulation","display_name":"process simulation","score":0.49399998784065247},{"id":"https://openalex.org/keywords/derivative-free-optimization","display_name":"derivative-free optimization","score":0.7509999871253967},{"id":"https://openalex.org/keywords/best-subset-selection","display_name":"best subset selection","score":0.7329999804496765},{"id":"https://openalex.org/keywords/mixed-integer-linear-programming","display_name":"mixed-integer linear programming","score":0.9539999961853027},{"id":"https://openalex.org/keywords/adaptive-sampling","display_name":"adaptive sampling","score":0.8289999961853027},{"id":"https://openalex.org/keywords/heat-and-mass-balance","display_name":"heat and mass balance","score":0.7680000066757202},{"id":"https://openalex.org/keywords/uncertainty-quantification","display_name":"uncertainty quantification","score":0.8880000114440918},{"id":"https://openalex.org/keywords/low-complexity-models","display_name":"low-complexity models","score":0.6949999928474426}],"concepts":[{"id":"https://openalex.org/C131675550","wikidata":"https://www.wikidata.org/wiki/Q7646884","display_name":"Surrogate model","level":2,"score":0.8063700199127197},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.6493971347808838},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6294216513633728},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.5751537084579468},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5584732890129089},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5076349973678589},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.44101110100746155},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38629627227783203},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.2902390956878662},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.24918469786643982},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:276676705","doi":null,"is_oa":false,"landing_page_url":"http://www.osti.gov/scitech/biblio/1036498","pdf_url":null,"source":{"id":"https://openalex.org/S4306402487","display_name":"OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I139351228","host_organization_name":"Office of Scientific and Technical Information","host_organization_lineage":["https://openalex.org/I139351228"],"host_organization_lineage_names":[],"type":"repository"},"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":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W1967989271","https://openalex.org/W3212174976","https://openalex.org/W3015706362","https://openalex.org/W35973657","https://openalex.org/W4367180836","https://openalex.org/W1124727651","https://openalex.org/W147377413","https://openalex.org/W6964123023","https://openalex.org/W4288828694","https://openalex.org/W4385699875"],"abstract_inverted_index":{"Costly":[0],"and/or":[1],"insufficiently":[2],"robust":[3],"simulations":[4],"or":[5,64,94,157,206,208],"experiments":[6,93],"can":[7,194],"often":[8],"pose":[9],"difficulties":[10],"when":[11,30],"their":[12],"use":[13,148],"extends":[14],"well":[15,39],"beyond":[16],"a":[17,68,102,119,125,184],"single":[18],"evaluation.":[19],"This":[20],"is":[21,34,116],"case":[22],"with":[23,173,210],"the":[24,62,84,147,189,203],"numerous":[25,41],"evaluations":[26,201],"of":[27,53,57,61,86,149,162,188,202],"uncertainty":[28],"quantification,":[29],"an":[31,50,110,214],"algebraic":[32,54,186],"model":[33,105,115,187,193],"needed":[35],"for":[36,106,132,197,216],"optimization,":[37],"as":[38,40],"other":[42],"areas.":[43],"To":[44],"overcome":[45],"these":[46],"difficulties,":[47],"we":[48],"generate":[49,83,183],"accurate":[51,200],"set":[52,85],"surrogate":[55,87,104,163],"models":[56,88,139,164],"disaggregated":[58,167,180],"process":[59,168],"blocks":[60],"experiment":[63,207],"simulation.":[65],"We":[66],"developed":[67],"method":[69,98],"that":[70,123],"uses":[71],"derivative-based":[72],"and":[73,79,144,175,213],"derivative-free":[74,150],"optimization":[75],"alongside":[76],"machine":[77],"learning":[78],"statistical":[80],"techniques":[81],"to":[82,130,152,182],"using":[89,118],"data":[90],"sampled":[91],"from":[92,109,165],"detailed":[95],"simulations.":[96],"Our":[97],"begins":[99],"by":[100],"building":[101],"low-complexity":[103],"each":[107,166,179],"block":[108,169,181],"initial":[111,135],"sample":[112,154],"set.":[113],"The":[114,138,160,191],"built":[117],"best":[120],"subset":[121],"technique":[122],"leverages":[124],"mixed-integer":[126],"linear":[127],"problem":[128],"formulation":[129],"allow":[131],"very":[133],"large":[134],"basis":[136],"sets.":[137],"are":[140,170],"then":[141,171],"tested,":[142],"exploited,":[143],"improved":[145],"through":[146],"solvers":[151],"adaptively":[153],"new":[155],"simulation":[156,205],"experimental":[158],"points.":[159],"sets":[161],"combined":[172,209],"heat":[174],"mass":[176],"balances":[177],"around":[178],"full":[185,192],"process.":[190],"be":[195],"used":[196],"cheap":[198],"andmore\u00a0\u00bb":[199],"original":[204],"design":[211],"specifications":[212],"objective":[215],"nonlinear":[217],"optimization.\u00ab\u00a0less":[218]},"counts_by_year":[],"updated_date":"2026-10-14T16:39:01.820549","created_date":"2016-06-24T00:00:00"}