{"id":"https://openalex.org/W1976519552","doi":"https://doi.org/10.1137/060664161","title":"Asynchronous Parallel Generating Set Search for Linearly Constrained Optimization","display_name":"Asynchronous Parallel Generating Set Search for Linearly Constrained Optimization","publication_year":2008,"publication_date":"2008-01-01","ids":{"openalex":"https://openalex.org/W1976519552","doi":"https://doi.org/10.1137/060664161","mag":"1976519552"},"language":"en","primary_location":{"id":"doi:10.1137/060664161","is_oa":false,"landing_page_url":"https://doi.org/10.1137/060664161","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/A5079196169","display_name":"Joshua Griffin","orcid":"https://orcid.org/0000-0002-6738-0154"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Joshua D. Griffin","raw_affiliation_strings":["jgriffi@sandia.gov and tgkolda@sandia.gov#TAB#"],"affiliations":[{"raw_affiliation_string":"jgriffi@sandia.gov and tgkolda@sandia.gov#TAB#","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5039127251","display_name":"Tamara G. Kolda","orcid":"https://orcid.org/0000-0003-4176-2493"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Tamara G. Kolda","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5101836132","display_name":"Robert Michael Lewis","orcid":"https://orcid.org/0000-0003-4760-324X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Robert Michael Lewis","raw_affiliation_strings":["buckaroo@math.wm.edu#TAB#"],"affiliations":[{"raw_affiliation_string":"buckaroo@math.wm.edu#TAB#","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5079196169"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":13.8617,"has_fulltext":false,"cited_by_count":56,"citation_normalized_percentile":{"value":0.9928009,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"30","issue":"4","first_page":"1892","last_page":"1924"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9997000098228455,"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.9997000098228455,"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9962000250816345,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T10791","display_name":"Advanced Control Systems Optimization","score":0.9951000213623047,"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/asynchronous-communication","display_name":"Asynchronous communication","score":0.7956169843673706},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5575498342514038},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.531114399433136},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4926829934120178},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4910299777984619},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.46981576085090637},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.4672189950942993},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.46027135848999023},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.45341289043426514}],"concepts":[{"id":"https://openalex.org/C151319957","wikidata":"https://www.wikidata.org/wiki/Q752739","display_name":"Asynchronous communication","level":2,"score":0.7956169843673706},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5575498342514038},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.531114399433136},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4926829934120178},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4910299777984619},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.46981576085090637},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.4672189950942993},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.46027135848999023},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.45341289043426514},{"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/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","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},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1137/060664161","is_oa":false,"landing_page_url":"https://doi.org/10.1137/060664161","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.118.2381","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.118.2381","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/SAND2006-4621.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.122.4524","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.122.4524","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-066416-preprint.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.153.2735","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.153.2735","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-066416.pdf","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":26,"referenced_works":["https://openalex.org/W147998453","https://openalex.org/W315542713","https://openalex.org/W1480928214","https://openalex.org/W1662996659","https://openalex.org/W1966971447","https://openalex.org/W1970101292","https://openalex.org/W1976293044","https://openalex.org/W1977691479","https://openalex.org/W1982087768","https://openalex.org/W1993448217","https://openalex.org/W2014337138","https://openalex.org/W2027923711","https://openalex.org/W2040751338","https://openalex.org/W2054875385","https://openalex.org/W2067641876","https://openalex.org/W2085137170","https://openalex.org/W2099959094","https://openalex.org/W2109348499","https://openalex.org/W2113638561","https://openalex.org/W2119466436","https://openalex.org/W2130609399","https://openalex.org/W2138671124","https://openalex.org/W2148563791","https://openalex.org/W2160574531","https://openalex.org/W2162737890","https://openalex.org/W2492353954"],"related_works":["https://openalex.org/W2367372208","https://openalex.org/W2006363920","https://openalex.org/W2475836838","https://openalex.org/W3100791781","https://openalex.org/W1548344605","https://openalex.org/W2122091831","https://openalex.org/W2362260319","https://openalex.org/W2136415198","https://openalex.org/W4283814387","https://openalex.org/W2365810621"],"abstract_inverted_index":{"We":[0,169,189],"describe":[1,170],"an":[2,133,153],"asynchronous":[3,137,154,269],"parallel":[4,90,270],"derivative-free":[5,262],"algorithm":[6,26,52],"for":[7,100,136,264],"linearly":[8,113,155,265],"constrained":[9,114,156,266],"optimization.":[10,267],"Generating":[11],"set":[12,29,122],"search":[13,31,124],"(GSS)":[14],"is":[15,144,272],"the":[16,40,51,57,64,103,116,121,128,140,165,220,230,239,245,252,278],"basis":[17],"of":[18,30,50,89,123,142,219,229,238,247,277],"our":[19,171,191,212,248],"method.":[20],"At":[21],"each":[22,45],"iteration,":[23],"a":[24,28,93,261],"GSS":[25,157],"computes":[27],"directions":[32,125],"and":[33,37,59,75,92,163,185,202,235],"corresponding":[34],"trial":[35,46,70,82],"points":[36,71],"then":[38],"evaluates":[39],"objective":[41,104],"function":[42,105,179,183],"value":[43],"at":[44],"point.":[47],"Asynchronous":[48],"versions":[49],"have":[53,256],"been":[54,258],"developed":[55],"in":[56,95,173],"unconstrained":[58],"bound-constrained":[60],"cases":[61],"which":[62],"allow":[63],"iterations":[65],"to":[66,72,110,127,177,204,209,216],"continue":[67],"(and":[68],"new":[69],"be":[73],"generated":[74],"evaluated)":[76],"as":[77,79,275],"soon":[78],"any":[80],"other":[81],"point":[83],"completes.":[84],"This":[85,131],"enables":[86],"better":[87],"utilization":[88],"resources":[91],"reduction":[94],"overall":[96],"run":[97],"time,":[98],"especially":[99],"problems":[101,222,231,240],"where":[102,139],"takes":[106],"minutes":[107],"or":[108,225],"hours":[109],"compute.":[111],"For":[112],"GSS,":[115],"convergence":[117,167],"theory":[118],"requires":[119],"that":[120,159,255],"conforms":[126],"nearby":[129,143],"boundary.":[130],"creates":[132],"immediate":[134],"obstacle":[135],"methods":[138],"definition":[141],"not":[145],"well":[146],"defined.":[147],"In":[148],"this":[149,161],"paper,":[150],"we":[151],"develop":[152],"method":[158,263],"overcomes":[160],"difficulty":[162],"maintains":[164],"original":[166],"theory.":[168],"implementation":[172,192,213,271],"detail,":[174],"including":[175],"how":[176],"avoid":[178],"evaluations":[180],"by":[181],"caching":[182],"values":[184],"using":[186],"approximate":[187],"lookups.":[188],"test":[190,196,221],"on":[193],"every":[194],"CUTEr":[195],"problem":[197],"with":[198,223,232,241,260],"general":[199],"linear":[200],"constraints":[201],"up":[203],"1000":[205],"variables.":[206,243],"Without":[207],"tuning":[208],"individual":[210],"problems,":[211],"was":[214],"able":[215],"solve":[217],"95%":[218],"10":[224],"fewer":[226],"variables,":[227,234],"73%":[228],"11\u2013100":[233],"nearly":[236],"half":[237],"100\u20131000":[242],"To":[244],"best":[246,253],"knowledge,":[249],"these":[250],"are":[251],"results":[254],"ever":[257],"achieved":[259],"Our":[268],"freely":[273],"available":[274],"part":[276],"APPSPACK":[279],"software.":[280]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2019,"cited_by_count":3},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":7}],"updated_date":"2026-04-07T14:57:38.498316","created_date":"2025-10-10T00:00:00"}