{"id":"https://openalex.org/W4308390372","doi":"https://doi.org/10.1109/allerton49937.2022.9929367","title":"Proximal Methods for Self-Healing and Exact Distributed Convex Optimization Extended abstract","display_name":"Proximal Methods for Self-Healing and Exact Distributed Convex Optimization Extended abstract","publication_year":2022,"publication_date":"2022-09-27","ids":{"openalex":"https://openalex.org/W4308390372","doi":"https://doi.org/10.1109/allerton49937.2022.9929367"},"language":"en","primary_location":{"id":"doi:10.1109/allerton49937.2022.9929367","is_oa":false,"landing_page_url":"https://doi.org/10.1109/allerton49937.2022.9929367","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 58th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","raw_type":"proceedings-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/A5102856571","display_name":"Randy A. Freeman","orcid":"https://orcid.org/0000-0001-8998-3696"},"institutions":[{"id":"https://openalex.org/I111979921","display_name":"Northwestern University","ror":"https://ror.org/000e0be47","country_code":"US","type":"education","lineage":["https://openalex.org/I111979921"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Randy A. Freeman","raw_affiliation_strings":["Electrical & Computer Engineering Northwestern University,Evanston,IL,USA"],"affiliations":[{"raw_affiliation_string":"Electrical & Computer Engineering Northwestern University,Evanston,IL,USA","institution_ids":["https://openalex.org/I111979921"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5102856571"],"corresponding_institution_ids":["https://openalex.org/I111979921"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.13922394,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"13","issue":null,"first_page":"1","last_page":"7"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10249","display_name":"Distributed Control Multi-Agent Systems","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10249","display_name":"Distributed Control Multi-Agent Systems","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.9869999885559082,"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/T11347","display_name":"Neural Networks Stability and Synchronization","score":0.949400007724762,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/initialization","display_name":"Initialization","score":0.678105890750885},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5968604683876038},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.592261791229248},{"id":"https://openalex.org/keywords/lipschitz-continuity","display_name":"Lipschitz continuity","score":0.49195072054862976},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.4804213047027588},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.4604504704475403},{"id":"https://openalex.org/keywords/subspace-topology","display_name":"Subspace topology","score":0.4522344768047333},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.4132847487926483},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3568976819515228},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3036539554595947},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.2852364182472229},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.09330850839614868}],"concepts":[{"id":"https://openalex.org/C114466953","wikidata":"https://www.wikidata.org/wiki/Q6034165","display_name":"Initialization","level":2,"score":0.678105890750885},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5968604683876038},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.592261791229248},{"id":"https://openalex.org/C22324862","wikidata":"https://www.wikidata.org/wiki/Q652707","display_name":"Lipschitz continuity","level":2,"score":0.49195072054862976},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.4804213047027588},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4604504704475403},{"id":"https://openalex.org/C32834561","wikidata":"https://www.wikidata.org/wiki/Q660730","display_name":"Subspace topology","level":2,"score":0.4522344768047333},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.4132847487926483},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3568976819515228},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3036539554595947},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.2852364182472229},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.09330850839614868},{"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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":1,"locations":[{"id":"doi:10.1109/allerton49937.2022.9929367","is_oa":false,"landing_page_url":"https://doi.org/10.1109/allerton49937.2022.9929367","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 58th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G6856244116","display_name":null,"funder_award_id":"CMMI-2024774","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W1571416372","https://openalex.org/W1832875828","https://openalex.org/W2029080014","https://openalex.org/W2044212084","https://openalex.org/W2046387702","https://openalex.org/W2094813068","https://openalex.org/W2290882446","https://openalex.org/W2291446607","https://openalex.org/W2315826754","https://openalex.org/W2609549560","https://openalex.org/W2703937778","https://openalex.org/W2763533254","https://openalex.org/W2892624593","https://openalex.org/W2926319838","https://openalex.org/W2962782955","https://openalex.org/W2963361330","https://openalex.org/W2963649943","https://openalex.org/W2963940890","https://openalex.org/W2964165783","https://openalex.org/W3006548771","https://openalex.org/W3016890209","https://openalex.org/W3093673559","https://openalex.org/W3100513551","https://openalex.org/W4210417872","https://openalex.org/W4241652050","https://openalex.org/W6662060908","https://openalex.org/W6696717061","https://openalex.org/W6792276841"],"related_works":["https://openalex.org/W419730749","https://openalex.org/W4286891655","https://openalex.org/W2576451984","https://openalex.org/W3209823386","https://openalex.org/W4292532243","https://openalex.org/W2756132392","https://openalex.org/W3035814349","https://openalex.org/W4285101096","https://openalex.org/W4382725876","https://openalex.org/W2084892497"],"abstract_inverted_index":{"Distributed":[0],"convex":[1,202,278,286],"optimization":[2,48,128],"algorithms":[3,291],"employ":[4,294],"a":[5,53,63,78,148,153,212,239,246],"variety":[6],"of":[7,36,67,230],"methods":[8,69],"for":[9,216,300],"achieving":[10,217,301],"exact":[11,218,302],"convergence":[12,142,177,219],"to":[13,60,87,89,94,120,143,151,162,178,220,264],"the":[14,37,43,58,108,117,125,132,141,144,159,179,189,221,231,265,269],"global":[15,79,222],"optimal":[16,145,223,266],"value":[17],"(modulo":[18],"numerical":[19],"precision):":[20],"some":[21,25,40,51],"use":[22,26,41,52],"time-varying":[23,74],"dynamics,":[24],"dynamics":[27,59,75,105,171],"on":[28,33,62],"each":[29,34,250],"edge":[30],"rather":[31,102],"than":[32,103],"node":[35,251],"communication":[38,44,118,126,133],"graph,":[39],"double":[42,124],"between":[45],"nodes":[46],"per":[47,127],"step,":[49],"and":[50,81,92,110,113,135,209,234,276],"specific":[54,149],"initialization":[55,150],"that":[56,168,188,254,292],"enforces":[57],"evolve":[61],"particular":[64,154,236],"subspace.":[65],"Each":[66],"these":[68],"has":[70,228,252],"its":[71,170,261],"drawbacks.":[72],"Using":[73,100,123,147],"might":[76,83,106,130,137,157],"require":[77],"clock,":[80],"it":[82,114,136,237,243],"cause":[84],"transients":[85],"due":[86],"disturbances":[88,167],"take":[90],"longer":[91,93],"die":[95],"out":[96],"as":[97,260],"time":[98,258],"progresses.":[99],"edge-based":[101],"node-based":[104],"increase":[107,131],"memory":[109],"computation":[111],"costs,":[112],"typically":[115],"requires":[116],"graph":[119],"be":[121],"undirected.":[122],"step":[129],"cost,":[134],"also":[138],"slow":[139],"down":[140],"value.":[146,181,224,267],"enforce":[152],"invariant":[155],"subspace":[156],"render":[158],"algorithm":[160,190,227],"unable":[161],"recover":[163],"from":[164,172],"faults":[165],"or":[166],"perturb":[169],"this":[173,183],"subspace,":[174],"resulting":[175],"in":[176,235,257],"incorrect":[180],"In":[182,194,268],"latter":[184],"case":[185],"we":[186,199,210,272],"say":[187],"is":[191,238],"not":[192],"self-healing.":[193],"our":[195,295],"previous":[196],"work":[197],"[1]":[198],"considered":[200],"strongly":[201],"objective":[203,279],"functions":[204,280],"having":[205],"Lipschitz":[206],"continuous":[207],"gradients,":[208],"introduced":[211],"new":[213,226],"first-order":[214],"method":[215,299],"Our":[225],"none":[229],"above":[232],"drawbacks,":[233],"self-healing":[240],"algorithm.":[241],"But,":[242],"does":[244],"possess":[245],"peculiar":[247],"internal":[248],"instability:":[249],"states":[253],"grows":[255],"linearly":[256],"even":[259],"output":[262],"converges":[263],"present":[270,289],"work,":[271],"consider":[273],"general":[274],"non-smooth":[275],"extended-real-valued":[277],"(which":[281],"can":[282],"thus":[283],"incorporate":[284],"hard":[285],"constraints).":[287],"We":[288],"proximal":[290],"again":[293],"new,":[296],"internally":[297],"unstable":[298],"convergence.":[303]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}