{"id":"https://openalex.org/W3107539545","doi":"https://doi.org/10.1109/icca51439.2020.9264365","title":"An Inexact Fenchel Dual Gradient Algorithm for Distributed Optimization","display_name":"An Inexact Fenchel Dual Gradient Algorithm for Distributed Optimization","publication_year":2020,"publication_date":"2020-10-09","ids":{"openalex":"https://openalex.org/W3107539545","doi":"https://doi.org/10.1109/icca51439.2020.9264365","mag":"3107539545"},"language":"en","primary_location":{"id":"doi:10.1109/icca51439.2020.9264365","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icca51439.2020.9264365","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 IEEE 16th International Conference on Control & Automation (ICCA)","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/A5022511168","display_name":"He Wang","orcid":"https://orcid.org/0000-0002-3816-5746"},"institutions":[{"id":"https://openalex.org/I30809798","display_name":"ShanghaiTech University","ror":"https://ror.org/030bhh786","country_code":"CN","type":"education","lineage":["https://openalex.org/I30809798"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"He Wang","raw_affiliation_strings":["School of Information Science and Technology, ShanghaiTech University, Shanghai, China"],"affiliations":[{"raw_affiliation_string":"School of Information Science and Technology, ShanghaiTech University, Shanghai, China","institution_ids":["https://openalex.org/I30809798"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100675573","display_name":"Jie Lu","orcid":"https://orcid.org/0000-0002-4362-6543"},"institutions":[{"id":"https://openalex.org/I30809798","display_name":"ShanghaiTech University","ror":"https://ror.org/030bhh786","country_code":"CN","type":"education","lineage":["https://openalex.org/I30809798"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Jie Lu","raw_affiliation_strings":["School of Information Science and Technology, ShanghaiTech University, Shanghai, China"],"affiliations":[{"raw_affiliation_string":"School of Information Science and Technology, ShanghaiTech University, Shanghai, China","institution_ids":["https://openalex.org/I30809798"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5022511168"],"corresponding_institution_ids":["https://openalex.org/I30809798"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.18577532,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"949","last_page":"954"},"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.9940999746322632,"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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9843999743461609,"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/convergence","display_name":"Convergence (economics)","score":0.7112865447998047},{"id":"https://openalex.org/keywords/dual","display_name":"Dual (grammatical number)","score":0.6927427053451538},{"id":"https://openalex.org/keywords/proximal-gradient-methods","display_name":"Proximal Gradient Methods","score":0.65578693151474},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6114338636398315},{"id":"https://openalex.org/keywords/gradient-method","display_name":"Gradient method","score":0.5478867292404175},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5457158088684082},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.5409972667694092},{"id":"https://openalex.org/keywords/convex-function","display_name":"Convex function","score":0.5232217311859131},{"id":"https://openalex.org/keywords/frank\u2013wolfe-algorithm","display_name":"Frank\u2013Wolfe algorithm","score":0.5025618076324463},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.4920160472393036},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.4687281847000122},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4678151309490204},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.40839725732803345},{"id":"https://openalex.org/keywords/convex-set","display_name":"Convex set","score":0.11940532922744751}],"concepts":[{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.7112865447998047},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.6927427053451538},{"id":"https://openalex.org/C10494615","wikidata":"https://www.wikidata.org/wiki/Q17086765","display_name":"Proximal Gradient Methods","level":4,"score":0.65578693151474},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6114338636398315},{"id":"https://openalex.org/C115680565","wikidata":"https://www.wikidata.org/wiki/Q5977448","display_name":"Gradient method","level":2,"score":0.5478867292404175},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5457158088684082},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.5409972667694092},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.5232217311859131},{"id":"https://openalex.org/C122268817","wikidata":"https://www.wikidata.org/wiki/Q2020318","display_name":"Frank\u2013Wolfe algorithm","level":5,"score":0.5025618076324463},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.4920160472393036},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.4687281847000122},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4678151309490204},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.40839725732803345},{"id":"https://openalex.org/C49870271","wikidata":"https://www.wikidata.org/wiki/Q193657","display_name":"Convex set","level":4,"score":0.11940532922744751},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"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/C124952713","wikidata":"https://www.wikidata.org/wiki/Q8242","display_name":"Literature","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},{"id":"https://openalex.org/C142362112","wikidata":"https://www.wikidata.org/wiki/Q735","display_name":"Art","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icca51439.2020.9264365","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icca51439.2020.9264365","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 IEEE 16th International Conference on Control & Automation (ICCA)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W1571416372","https://openalex.org/W1616857247","https://openalex.org/W1627780903","https://openalex.org/W2101385798","https://openalex.org/W2107568926","https://openalex.org/W2108924122","https://openalex.org/W2114791779","https://openalex.org/W2129122308","https://openalex.org/W2132022337","https://openalex.org/W2137435346","https://openalex.org/W2158643468","https://openalex.org/W2476071355","https://openalex.org/W2590635385","https://openalex.org/W2602885853","https://openalex.org/W2763081248","https://openalex.org/W2792176849","https://openalex.org/W2802324011","https://openalex.org/W2949979136","https://openalex.org/W2962782955","https://openalex.org/W2963156126","https://openalex.org/W2963524119","https://openalex.org/W2963550797","https://openalex.org/W2963607435","https://openalex.org/W2963649943","https://openalex.org/W2964103300","https://openalex.org/W3027187636","https://openalex.org/W3104851238","https://openalex.org/W4297825594","https://openalex.org/W6679191575","https://openalex.org/W6696497002"],"related_works":["https://openalex.org/W3123504125","https://openalex.org/W3147739796","https://openalex.org/W1983212821","https://openalex.org/W3000303000","https://openalex.org/W2364728921","https://openalex.org/W1543207628","https://openalex.org/W4385452046","https://openalex.org/W2959146022","https://openalex.org/W3033885862","https://openalex.org/W2034189051"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3],"design":[4],"a":[5,22,27,43,65],"distributed":[6],"algorithm":[7,17,60],"for":[8,26,97],"addressing":[9],"constrained":[10],"convex":[11,28,106],"optimization":[12],"over":[13],"networks.":[14],"The":[15],"proposed":[16],"is":[18,78,125],"developed":[19],"by":[20],"substituting":[21],"projected":[23],"gradient":[24,38,68],"operation":[25],"minimization":[29],"step":[30],"at":[31],"each":[32],"iteration":[33],"of":[34,52,91,119,129],"the":[35,48,72,94,100,116],"Fenchel":[36,73,83],"dual":[37,74],"(FDG)":[39],"method":[40,69],"derived":[41],"in":[42],"prior":[44],"work,":[45],"so":[46],"that":[47,112,128],"high":[49],"computational":[50],"load":[51],"FDG":[53],"can":[54,61],"be":[55,62],"significantly":[56],"alleviated.":[57],"Such":[58],"an":[59],"viewed":[63],"as":[64,81],"weighted":[66],"inexact":[67],"applied":[70],"to":[71,80,93,127],"problem,":[75],"and":[76,107],"therefore":[77],"referred":[79],"Inexact":[82],"Dual":[84],"Gradient":[85],"(IFDG)":[86],"algorithm.":[87],"We":[88],"provide":[89],"rates":[90],"convergence":[92,123],"optimal":[95],"solution":[96],"IFDG":[98,113],"when":[99],"local":[101],"objective":[102],"functions":[103],"are":[104],"strongly":[105],"smooth.":[108],"Simulation":[109],"results":[110],"demonstrate":[111],"remarkably":[114],"reduces":[115],"running":[117],"time":[118],"FDG,":[120],"yet":[121],"its":[122],"performance":[124],"comparable":[126],"FDG.":[130]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2026-03-25T13:04:00.132906","created_date":"2025-10-10T00:00:00"}