{"id":"https://openalex.org/W2951449423","doi":"https://doi.org/10.1109/allerton.2018.8636076","title":"On Convergence of Heuristics Based on Douglas-Rachford Splitting and ADMM to Minimize Convex Functions over Nonconvex Sets","display_name":"On Convergence of Heuristics Based on Douglas-Rachford Splitting and ADMM to Minimize Convex Functions over Nonconvex Sets","publication_year":2018,"publication_date":"2018-10-01","ids":{"openalex":"https://openalex.org/W2951449423","doi":"https://doi.org/10.1109/allerton.2018.8636076","mag":"2951449423"},"language":"en","primary_location":{"id":"doi:10.1109/allerton.2018.8636076","is_oa":false,"landing_page_url":"https://doi.org/10.1109/allerton.2018.8636076","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","raw_type":"proceedings-article"},"type":"preprint","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1807.02878","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5025454489","display_name":"Shuvomoy Das Gupta","orcid":"https://orcid.org/0000-0001-9650-8746"},"institutions":[{"id":"https://openalex.org/I4210095320","display_name":"Thales (Canada)","ror":"https://ror.org/00nnd3206","country_code":"CA","type":"company","lineage":["https://openalex.org/I4210095320","https://openalex.org/I4210140930"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Shuvomoy Das Gupta","raw_affiliation_strings":["Research & Technology Department, Thales Canada, 105 Moatfield Drive, Toronto, ON, Canada"],"affiliations":[{"raw_affiliation_string":"Research & Technology Department, Thales Canada, 105 Moatfield Drive, Toronto, ON, Canada","institution_ids":["https://openalex.org/I4210095320"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5025454489"],"corresponding_institution_ids":["https://openalex.org/I4210095320"],"apc_list":null,"apc_paid":null,"fwci":0.2137,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.60205309,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"25","issue":null,"first_page":"56","last_page":"63"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10545","display_name":"Optimization and Variational Analysis","score":0.9983999729156494,"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/T10545","display_name":"Optimization and Variational Analysis","score":0.9983999729156494,"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/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9973999857902527,"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"}},{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.982699990272522,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.8151743412017822},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.696539580821991},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6785329580307007},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.6476243138313293},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.5841712951660156},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5105711221694946},{"id":"https://openalex.org/keywords/operator","display_name":"Operator (biology)","score":0.47047027945518494},{"id":"https://openalex.org/keywords/convex-function","display_name":"Convex function","score":0.46785905957221985},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.4520837366580963},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.4482835829257965},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4121301472187042},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.40246641635894775}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.8151743412017822},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.696539580821991},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6785329580307007},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.6476243138313293},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.5841712951660156},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5105711221694946},{"id":"https://openalex.org/C17020691","wikidata":"https://www.wikidata.org/wiki/Q139677","display_name":"Operator (biology)","level":5,"score":0.47047027945518494},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.46785905957221985},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.4520837366580963},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.4482835829257965},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4121301472187042},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.40246641635894775},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0},{"id":"https://openalex.org/C86339819","wikidata":"https://www.wikidata.org/wiki/Q407384","display_name":"Transcription factor","level":3,"score":0.0},{"id":"https://openalex.org/C158448853","wikidata":"https://www.wikidata.org/wiki/Q425218","display_name":"Repressor","level":4,"score":0.0},{"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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"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":"doi:10.1109/allerton.2018.8636076","is_oa":false,"landing_page_url":"https://doi.org/10.1109/allerton.2018.8636076","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:1807.02878","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1807.02878","pdf_url":"https://arxiv.org/pdf/1807.02878","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1807.02878","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1807.02878","pdf_url":"https://arxiv.org/pdf/1807.02878","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W205960364","https://openalex.org/W1125881252","https://openalex.org/W2088085049","https://openalex.org/W2163232332","https://openalex.org/W2164278908","https://openalex.org/W2184047134","https://openalex.org/W2216134724","https://openalex.org/W2216139520","https://openalex.org/W2606482332","https://openalex.org/W2607116528","https://openalex.org/W2763081248","https://openalex.org/W2792298817","https://openalex.org/W2949979136","https://openalex.org/W2951449423","https://openalex.org/W2962853966","https://openalex.org/W2995360683","https://openalex.org/W3105393233","https://openalex.org/W4213295258","https://openalex.org/W4229650096","https://openalex.org/W4250589301","https://openalex.org/W4285719527","https://openalex.org/W4292363360","https://openalex.org/W4297825594","https://openalex.org/W6686444881","https://openalex.org/W6688447623","https://openalex.org/W6696497002"],"related_works":["https://openalex.org/W3177062893","https://openalex.org/W3125143773","https://openalex.org/W2007032764","https://openalex.org/W803550684","https://openalex.org/W2483226803","https://openalex.org/W4352977312","https://openalex.org/W2041180560","https://openalex.org/W1603713238","https://openalex.org/W2510140549","https://openalex.org/W2187449906"],"abstract_inverted_index":{"Recently,":[0],"heuristics":[1],"based":[2],"on":[3,178],"the":[4,9,35,74,79,91,111,114,136,143,152,155,181,188],"Douglas-Rachford":[5,82,92,144,189],"splitting":[6,93,145,190],"algorithm":[7],"and":[8,167,184],"alternating":[10],"direction":[11],"method":[12],"of":[13,38,46,54,78,180],"multipliers":[14],"(ADMM)":[15],"have":[16,168],"found":[17],"empirical":[18],"success":[19],"in":[20,151,157],"minimizing":[21],"convex":[22,58,153],"functions":[23,60],"over":[24,61],"nonconvex":[25,62,81,159],"sets,":[26],"but":[27],"not":[28,162],"much":[29],"has":[30],"been":[31],"done":[32],"to":[33,73,97,117,127,164],"improve":[34],"theoretical":[36],"understanding":[37],"them.":[39,174],"In":[40,110],"this":[41],"paper,":[42],"we":[43,50,85,120,133,176],"investigate":[44],"convergence":[45,179],"these":[47,68],"heuristics.":[48],"First,":[49],"characterize":[51],"optimal":[52,69,130],"solutions":[53,70],"minimization":[55],"problems":[56],"involving":[57],"cost":[59],"constraint":[63],"sets.":[64],"We":[65,147],"show":[66,148],"that":[67,125],"are":[71,161],"related":[72],"fixed":[75],"point":[76,99,126],"set":[77],"underlying":[80],"operator.":[83],"Next,":[84],"establish":[86,121],"sufficient":[87,122],"conditions":[88,123],"under":[89],"which":[90],"heuristic":[94,115,138,183],"either":[95],"converges":[96,116],"a":[98,105,118,169],"or":[100],"its":[101],"cluster":[102],"points":[103],"form":[104],"nonempty":[106],"compact":[107],"connected":[108],"set.":[109],"case":[112],"where":[113],"point,":[119],"for":[124],"be":[128,140],"an":[129],"solution.":[131],"Then,":[132],"discuss":[134],"how":[135],"ADMM":[137,182],"can":[139],"constructed":[141],"from":[142],"algorithm.":[146],"that,":[149],"unlike":[150],"case,":[154],"algorithms":[156],"our":[158],"setup":[160],"equivalent":[163],"each":[165],"other":[166],"rather":[170],"involved":[171],"relationship":[172],"between":[173],"Finally,":[175],"comment":[177],"compare":[185],"it":[186],"with":[187],"heuristic.":[191]},"counts_by_year":[{"year":2018,"cited_by_count":1}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2019-06-27T00:00:00"}