{"id":"https://openalex.org/W2067641876","doi":"https://doi.org/10.1137/s1064827599365823","title":"Asynchronous Parallel Pattern Search for Nonlinear Optimization","display_name":"Asynchronous Parallel Pattern Search for Nonlinear Optimization","publication_year":2001,"publication_date":"2001-01-01","ids":{"openalex":"https://openalex.org/W2067641876","doi":"https://doi.org/10.1137/s1064827599365823","mag":"2067641876"},"language":"en","primary_location":{"id":"doi:10.1137/s1064827599365823","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s1064827599365823","pdf_url":null,"source":{"id":"https://openalex.org/S165512578","display_name":"SIAM Journal on Scientific Computing","issn_l":"1064-8275","issn":["1064-8275","1095-7197"],"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 Scientific Computing","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/A5010433361","display_name":"Patricia Hough","orcid":null},"institutions":[{"id":"https://openalex.org/I139351228","display_name":"Office of Scientific and Technical Information","ror":"https://ror.org/031478740","country_code":"US","type":"government","lineage":["https://openalex.org/I1330989302","https://openalex.org/I139351228","https://openalex.org/I39565521"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Patricia D. Hough","raw_affiliation_strings":["Office of Scientific and Technical Information"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Office of Scientific and Technical Information","institution_ids":["https://openalex.org/I139351228"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5039127251","display_name":"Tamara G. Kolda","orcid":"https://orcid.org/0000-0003-4176-2493"},"institutions":[{"id":"https://openalex.org/I139351228","display_name":"Office of Scientific and Technical Information","ror":"https://ror.org/031478740","country_code":"US","type":"government","lineage":["https://openalex.org/I1330989302","https://openalex.org/I139351228","https://openalex.org/I39565521"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Tamara G. Kolda","raw_affiliation_strings":["Office of Scientific and Technical Information"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Office of Scientific and Technical Information","institution_ids":["https://openalex.org/I139351228"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5044171238","display_name":"Virginia Torczon","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Virginia J. Torczon","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":7.5813,"has_fulltext":false,"cited_by_count":160,"citation_normalized_percentile":{"value":0.97415796,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":"23","issue":"1","first_page":"134","last_page":"156"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T11269","display_name":"Algorithms and Data Compression","score":0.998199999332428,"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"}},{"id":"https://openalex.org/T11975","display_name":"Evolutionary Algorithms and Applications","score":0.9954000115394592,"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/computer-science","display_name":"Computer science","score":0.7710134983062744},{"id":"https://openalex.org/keywords/asynchronous-communication","display_name":"Asynchronous communication","score":0.7523010969161987},{"id":"https://openalex.org/keywords/overhead","display_name":"Overhead (engineering)","score":0.6764274835586548},{"id":"https://openalex.org/keywords/exploit","display_name":"Exploit","score":0.6154440641403198},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.6046469807624817},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.48912912607192993},{"id":"https://openalex.org/keywords/fault-tolerance","display_name":"Fault tolerance","score":0.4685063660144806},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.4426635503768921},{"id":"https://openalex.org/keywords/pattern-search","display_name":"Pattern search","score":0.43509313464164734},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2836412787437439},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.08522817492485046}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7710134983062744},{"id":"https://openalex.org/C151319957","wikidata":"https://www.wikidata.org/wiki/Q752739","display_name":"Asynchronous communication","level":2,"score":0.7523010969161987},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.6764274835586548},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.6154440641403198},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.6046469807624817},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.48912912607192993},{"id":"https://openalex.org/C63540848","wikidata":"https://www.wikidata.org/wiki/Q3140932","display_name":"Fault tolerance","level":2,"score":0.4685063660144806},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.4426635503768921},{"id":"https://openalex.org/C82691427","wikidata":"https://www.wikidata.org/wiki/Q4291856","display_name":"Pattern search","level":2,"score":0.43509313464164734},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2836412787437439},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.08522817492485046},{"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/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0}],"mesh":[],"locations_count":6,"locations":[{"id":"doi:10.1137/s1064827599365823","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s1064827599365823","pdf_url":null,"source":{"id":"https://openalex.org/S165512578","display_name":"SIAM Journal on Scientific Computing","issn_l":"1064-8275","issn":["1064-8275","1095-7197"],"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 Scientific Computing","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.129.3974","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.129.3974","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://csmr.ca.sandia.gov/~tgkolda/pubs/bibtgkfiles/SIAM-36582.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.27.558","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.27.558","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://csmr.ca.sandia.gov/~tgkolda/papers/apps2.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.33.205","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.33.205","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://csmr.ca.sandia.gov/~tgkolda/papers/apps1.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.42.523","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.42.523","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://csmr.ca.sandia.gov/~tgkolda/papers/apps.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.7.5146","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.7.5146","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.wm.edu/~va/research/apps.ps.gz","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W147998453","https://openalex.org/W1487974501","https://openalex.org/W1504623286","https://openalex.org/W1534273334","https://openalex.org/W1539546977","https://openalex.org/W1563429087","https://openalex.org/W1570906644","https://openalex.org/W1589918049","https://openalex.org/W1982087768","https://openalex.org/W1982751864","https://openalex.org/W2014337138","https://openalex.org/W2015783503","https://openalex.org/W2016670346","https://openalex.org/W2039088133","https://openalex.org/W2048221927","https://openalex.org/W2054875385","https://openalex.org/W2056603712","https://openalex.org/W2058407505","https://openalex.org/W2060805412","https://openalex.org/W2068092015","https://openalex.org/W2068722602","https://openalex.org/W2075665712","https://openalex.org/W2084186221","https://openalex.org/W2092158674","https://openalex.org/W2097991475","https://openalex.org/W2312715465","https://openalex.org/W4244913592","https://openalex.org/W4250840627"],"related_works":["https://openalex.org/W17155033","https://openalex.org/W3207760230","https://openalex.org/W1496222301","https://openalex.org/W1590307681","https://openalex.org/W2536018345","https://openalex.org/W1862835629","https://openalex.org/W2099111379","https://openalex.org/W2136799148","https://openalex.org/W2897533804","https://openalex.org/W2890506991"],"abstract_inverted_index":{"We":[0,74,140],"introduce":[1],"a":[2,22,52,99,106,129,145],"new":[3],"asynchronous":[4],"parallel":[5,69],"pattern":[6,10,80],"search":[7,11,81],"(APPS).":[8],"Parallel":[9],"can":[12,48],"be":[13],"quite":[14],"useful":[15],"for":[16,63],"engineering":[17,159],"optimization":[18,160],"problems":[19,154],"characterized":[20],"by":[21,32,44],"small":[23],"number":[24],"of":[25,79,102,132,144,148],"variables":[26],"(say,":[27],"fifty":[28],"or":[29],"less)":[30],"and":[31],"objective":[33],"functions":[34],"that":[35,47,85,110],"are":[36,65],"expensive":[37],"to":[38,55,58,82,92,113,127],"evaluate,":[39],"such":[40],"as":[41,155,157],"those":[42],"defined":[43],"complex":[45],"simulations":[46],"take":[49],"anywhere":[50],"from":[51],"few":[53],"seconds":[54],"many":[56],"hours":[57],"run.":[59],"The":[60],"target":[61],"platforms":[62],"APPS":[64,149],"the":[66,76,116,142],"loosely":[67],"coupled":[68],"systems":[70],"now":[71],"widely":[72],"available.":[73],"exploit":[75],"algorithmic":[77],"characteristics":[78],"design":[83],"variants":[84],"dynamically":[86],"initiate":[87],"actions":[88],"solely":[89],"in":[90],"response":[91],"messages,":[93],"rather":[94],"than":[95],"routinely":[96],"cycling":[97],"through":[98],"fixed":[100],"set":[101],"steps.":[103],"This":[104],"gives":[105],"versatile":[107],"concurrent":[108],"strategy":[109],"allows":[111,125],"us":[112,126],"effectively":[114],"balance":[115],"computational":[117],"load":[118],"across":[119],"all":[120],"available":[121],"processors.":[122],"Further,":[123],"it":[124],"incorporate":[128],"high":[130],"degree":[131],"fault":[133],"tolerance":[134],"with":[135],"almost":[136],"no":[137],"additional":[138],"overhead.":[139],"demonstrate":[141],"effectiveness":[143],"preliminary":[146],"implementation":[147],"on":[150],"both":[151],"standard":[152],"test":[153],"well":[156],"some":[158],"problems.":[161]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":8},{"year":2021,"cited_by_count":8},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":6}],"updated_date":"2026-08-01T09:00:35.917206","created_date":"2025-10-10T00:00:00"}