{"id":"https://openalex.org/W2292430003","doi":null,"title":"Parallel algorithms for constrained optimization","display_name":"Parallel algorithms for constrained optimization","alternate_titles":[],"publication_year":1988,"publication_date":"1988-01-01","ids":{"openalex":"https://openalex.org/W2292430003","mag":"2292430003"},"language":"en","primary_location":{"id":"mag:2292430003","doi":null,"is_oa":false,"landing_page_url":"http://dl.acm.org/citation.cfm?id=914539","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},"parent_works":[],"lineage":["https://openalex.org/W2292430003"],"child_works_count":0,"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/A5102450448","display_name":"Andrew T. Phillips","orcid":"https://orcid.org/0009-0008-5535-5788","observed_orcids":["https://orcid.org/0009-0008-5535-5788"]},"institutions":[],"countries":[],"is_corresponding":true,"contributor_roles":[],"raw_author_name":"Andrew T. Phillips","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5102450448"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.7752,"has_fulltext":false,"cited_by_count":8,"reviewed_by_count":0,"citation_normalized_percentile":{"value":0.81560284,"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_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9990000128746033,"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.9990000128746033,"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/T10720","display_name":"Complexity and Algorithms in Graphs","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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":9.999999747378752e-05,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/parallel-algorithms","display_name":"parallel algorithms","score":0.9610000252723694},{"id":"https://openalex.org/keywords/constrained-optimization","display_name":"constrained optimization","score":0.800000011920929},{"id":"https://openalex.org/keywords/global-optimization","display_name":"global optimization","score":0.7260000109672546},{"id":"https://openalex.org/keywords/superlinear-speedup","display_name":"superlinear speedup","score":0.7770000100135803},{"id":"https://openalex.org/keywords/polyhedral-sets","display_name":"polyhedral sets","score":0.7720000147819519},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"branch and bound","score":0.8859999775886536},{"id":"https://openalex.org/keywords/linear-complementarity-problem","display_name":"linear complementarity problem","score":0.8650000095367432},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"parallel computing","score":0.3779999911785126}],"concepts":[{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.8170080184936523},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6786435842514038},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5964124798774719},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5325865745544434},{"id":"https://openalex.org/C36503486","wikidata":"https://www.wikidata.org/wiki/Q11235244","display_name":"Domain (mathematical analysis)","level":2,"score":0.4909520447254181},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.4826691448688507},{"id":"https://openalex.org/C164752517","wikidata":"https://www.wikidata.org/wiki/Q5570875","display_name":"Global optimization","level":2,"score":0.4705807566642761},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4680217206478119},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.46113407611846924},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.460946649312973},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.45744794607162476},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.43267568945884705},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3310468792915344},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.14616659283638},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","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}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:2292430003","doi":null,"is_oa":false,"landing_page_url":"http://dl.acm.org/citation.cfm?id=914539","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":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2016396818","https://openalex.org/W1968036664","https://openalex.org/W2066760489","https://openalex.org/W199950694","https://openalex.org/W2093694358","https://openalex.org/W2625926706","https://openalex.org/W2922509604","https://openalex.org/W1570060824","https://openalex.org/W2000156923","https://openalex.org/W2052598152"],"abstract_inverted_index":{"Some":[0],"fundamental":[1],"properties":[2],"of":[3,15,28,45,59,75,80,116,121,137,158,188,219,253,258,294,300,329],"parallel":[4,16,106,292,321],"computing":[5,17],"and":[6,11,97,101,108,124,145,165,175,198,209,225,229,271,291],"theoretical":[7,43,99],"speedup":[8,34,51],"are":[9,70,104,151,162,204,261],"discussed,":[10],"a":[12,36,42,46,81,91,139,146,240,250,282,297,307],"specific":[13,37,73],"application":[14],"to":[18,90,113,129,171,216,244,267,273,312,333,337],"the":[19,55,60,77,98,114,118,154,159,168,179,189,191,220,227,236,295,301,320,326,339],"multiple-cost-row":[20],"linear":[21,148,155,275,313],"programming":[22],"problem":[23,30,47,74,115],"is":[24,52,57,88,95,111,194,233,242,315],"analyzed.":[25],"An":[26,255],"example":[27],"this":[29],"which":[31,49,87,150],"exhibits":[32],"superlinear":[33,50],"for":[35,63,263,324],"instance,":[38],"as":[39,41,306],"well":[40],"analysis":[44],"in":[48,206,249],"possible":[53],"on":[54,178,281],"average,":[56],"provided.\r\nMany":[58],"well-known":[61],"methods":[62],"solving":[64],"difficult":[65],"constrained":[66],"global":[67,78,119,180,327],"optimization":[68],"problems":[69,200,264],"reviewed.":[71],"The":[72,133],"finding":[76,117,325],"minimum":[79,120,181,328],"concave":[82,123,308,330],"or":[83,143],"indefinite":[84,125],"quadratic":[85,126,309,331],"function":[86,161,182,310],"restricted":[89,128],"bounded":[92,130],"polyhedral":[93,131],"set":[94,257],"described,":[96],"difficulty":[100],"solution":[102,241],"characteristics":[103],"presented.\r\nA":[105],"branch":[107],"bound":[109,210],"approach":[110],"applied":[112,335],"large-scale":[122],"functions":[127,135,332],"sets.":[132],"objective":[134,160],"consist":[136],"both":[138,173,289],"nonlinear":[140,269],"part":[141],"(concave":[142],"indefinite)":[144],"strictly":[147],"part,":[149],"coupled":[152],"by":[153],"constraints.":[156],"Underestimators":[157],"easily":[163],"constructed":[164],"minimized":[166],"over":[167,201],"feasible":[169,192,221],"domain":[170,193,222],"get":[172],"upper":[174,228],"lower":[176,230],"bounds":[177],"value.":[183],"At":[184],"each":[185,202],"minor":[186],"iteration":[187],"algorithm,":[190],"divided":[195],"into":[196],"subregions":[197],"underestimating":[199],"subregion":[203],"solved":[205],"parallel.":[207],"Branch":[208],"techniques":[211],"can":[212],"then":[213],"be":[214,334],"used":[215],"eliminate":[217],"parts":[218],"from":[223],"consideration":[224],"improve":[226],"bounds.":[231],"It":[232],"shown":[234],"that":[235,239],"algorithms":[237],"guarantee":[238],"obtained":[243,280],"within":[245],"any":[246],"specified":[247],"tolerance":[248],"finite":[251],"number":[252],"steps.":[254],"extensive":[256],"computational":[259],"results":[260,278],"presented":[262,323],"with":[265],"up":[266,272],"125":[268],"variables":[270],"400":[274],"variables.":[276],"These":[277],"were":[279],"four":[283],"processor":[284],"CRAY":[285],"2":[286],"supercomputer":[287],"using":[288],"sequential":[290],"implementations":[293],"algorithm.\r\nFinally,":[296],"new":[298],"formulation":[299],"Linear":[302],"Complementarity":[303],"Problem":[304],"(LCP)":[305],"subject":[311],"constrains":[314],"presented.":[316],"This":[317],"equivalence":[318],"allows":[319],"algorithm":[322],"directly":[336],"solve":[338],"LCP.":[340]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2292430003","counts_by_year":[],"updated_date":"2026-10-16T09:59:22.235173","created_date":"2016-06-24T00:00:00"}
