{"id":"https://openalex.org/W2101876299","doi":"https://doi.org/10.1109/tac.2012.2228038","title":"An Approximate Dual Subgradient Algorithm for Multi-Agent Non-Convex Optimization","display_name":"An Approximate Dual Subgradient Algorithm for Multi-Agent Non-Convex Optimization","publication_year":2012,"publication_date":"2012-11-16","ids":{"openalex":"https://openalex.org/W2101876299","doi":"https://doi.org/10.1109/tac.2012.2228038","mag":"2101876299"},"language":"en","primary_location":{"id":"doi:10.1109/tac.2012.2228038","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tac.2012.2228038","pdf_url":null,"source":{"id":"https://openalex.org/S184954342","display_name":"IEEE Transactions on Automatic Control","issn_l":"0018-9286","issn":["0018-9286","1558-2523","2334-3303"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Automatic Control","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/A5101766328","display_name":"Minghui Zhu","orcid":"https://orcid.org/0000-0003-3879-7820"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]},{"id":"https://openalex.org/I4210143601","display_name":"Decision Systems (United States)","ror":"https://ror.org/0434dpa13","country_code":"US","type":"company","lineage":["https://openalex.org/I4210143601"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Minghui Zhu","raw_affiliation_strings":["Laboratory for Information and Decision Systems, Massachusetts Institute of Technology, Cambridge, MA, USA","Labs. for Inf. & Decision Syst., Massachusetts Inst. of Technol., Cambridge, MA, USA"],"affiliations":[{"raw_affiliation_string":"Laboratory for Information and Decision Systems, Massachusetts Institute of Technology, Cambridge, MA, USA","institution_ids":["https://openalex.org/I4210143601","https://openalex.org/I63966007"]},{"raw_affiliation_string":"Labs. for Inf. & Decision Syst., Massachusetts Inst. of Technol., Cambridge, MA, USA","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5024022921","display_name":"Sonia Mart\u0131\u0301nez","orcid":"https://orcid.org/0000-0001-6756-1484"},"institutions":[{"id":"https://openalex.org/I36258959","display_name":"University of California, San Diego","ror":"https://ror.org/0168r3w48","country_code":"US","type":"education","lineage":["https://openalex.org/I36258959"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sonia Martinez","raw_affiliation_strings":["Department of Mechanical and Aerospace Engineering, University of California, San Diego, La Jolla, CA, USA","[Dept. of Mech. & Aerosp. Eng., Univ. of California, San Diego, La Jolla, CA, USA]"],"affiliations":[{"raw_affiliation_string":"Department of Mechanical and Aerospace Engineering, University of California, San Diego, La Jolla, CA, USA","institution_ids":["https://openalex.org/I36258959"]},{"raw_affiliation_string":"[Dept. of Mech. & Aerosp. Eng., Univ. of California, San Diego, La Jolla, CA, USA]","institution_ids":["https://openalex.org/I36258959"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5101766328"],"corresponding_institution_ids":["https://openalex.org/I4210143601","https://openalex.org/I63966007"],"apc_list":null,"apc_paid":null,"fwci":8.1956,"has_fulltext":false,"cited_by_count":133,"citation_normalized_percentile":{"value":0.97804545,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":100},"biblio":{"volume":"58","issue":"6","first_page":"1534","last_page":"1539"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10249","display_name":"Distributed Control Multi-Agent Systems","score":1.0,"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":1.0,"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/T11133","display_name":"UAV Applications and Optimization","score":0.9872000217437744,"subfield":{"id":"https://openalex.org/subfields/2202","display_name":"Aerospace Engineering"},"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/T10080","display_name":"Energy Efficient Wireless Sensor Networks","score":0.9333999752998352,"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/subgradient-method","display_name":"Subgradient method","score":0.8741016387939453},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.7162153124809265},{"id":"https://openalex.org/keywords/strong-duality","display_name":"Strong duality","score":0.6335725784301758},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5541408658027649},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.545832097530365},{"id":"https://openalex.org/keywords/duality","display_name":"Duality (order theory)","score":0.5161250829696655},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5105427503585815},{"id":"https://openalex.org/keywords/duality-gap","display_name":"Duality gap","score":0.49898743629455566},{"id":"https://openalex.org/keywords/network-topology","display_name":"Network topology","score":0.4745650589466095},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.4381566047668457},{"id":"https://openalex.org/keywords/dual","display_name":"Dual (grammatical number)","score":0.43367600440979004},{"id":"https://openalex.org/keywords/convex-function","display_name":"Convex function","score":0.4219823479652405},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.37234851717948914},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.3664628863334656},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.362825870513916},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.09878206253051758}],"concepts":[{"id":"https://openalex.org/C158968445","wikidata":"https://www.wikidata.org/wiki/Q7631150","display_name":"Subgradient method","level":2,"score":0.8741016387939453},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7162153124809265},{"id":"https://openalex.org/C163863214","wikidata":"https://www.wikidata.org/wiki/Q7624553","display_name":"Strong duality","level":3,"score":0.6335725784301758},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5541408658027649},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.545832097530365},{"id":"https://openalex.org/C2778023678","wikidata":"https://www.wikidata.org/wiki/Q554403","display_name":"Duality (order theory)","level":2,"score":0.5161250829696655},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5105427503585815},{"id":"https://openalex.org/C5274546","wikidata":"https://www.wikidata.org/wiki/Q5310264","display_name":"Duality gap","level":3,"score":0.49898743629455566},{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.4745650589466095},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.4381566047668457},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.43367600440979004},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.4219823479652405},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.37234851717948914},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.3664628863334656},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.362825870513916},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.09878206253051758},{"id":"https://openalex.org/C142362112","wikidata":"https://www.wikidata.org/wiki/Q735","display_name":"Art","level":0,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","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/C124952713","wikidata":"https://www.wikidata.org/wiki/Q8242","display_name":"Literature","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/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/tac.2012.2228038","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tac.2012.2228038","pdf_url":null,"source":{"id":"https://openalex.org/S184954342","display_name":"IEEE Transactions on Automatic Control","issn_l":"0018-9286","issn":["0018-9286","1558-2523","2334-3303"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Automatic Control","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.389.6946","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.389.6946","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://faemino.ucsd.edu/~soniamartinez/papers/data/2010_MZ-SM-cdc.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/10","score":0.5099999904632568,"display_name":"Reduced inequalities"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":46,"referenced_works":["https://openalex.org/W633277346","https://openalex.org/W1550507966","https://openalex.org/W1553702074","https://openalex.org/W1572996156","https://openalex.org/W1583497301","https://openalex.org/W1603765807","https://openalex.org/W1630241696","https://openalex.org/W1788292158","https://openalex.org/W1893117846","https://openalex.org/W1963529497","https://openalex.org/W1984850688","https://openalex.org/W2022948311","https://openalex.org/W2031494345","https://openalex.org/W2040002081","https://openalex.org/W2041221438","https://openalex.org/W2044212084","https://openalex.org/W2063856759","https://openalex.org/W2066767736","https://openalex.org/W2090295928","https://openalex.org/W2098863504","https://openalex.org/W2101876299","https://openalex.org/W2105837036","https://openalex.org/W2107396783","https://openalex.org/W2114791779","https://openalex.org/W2117905067","https://openalex.org/W2125668987","https://openalex.org/W2135779729","https://openalex.org/W2141788746","https://openalex.org/W2142184324","https://openalex.org/W2146890818","https://openalex.org/W2158307424","https://openalex.org/W2158893758","https://openalex.org/W2159715570","https://openalex.org/W2165744313","https://openalex.org/W2167485994","https://openalex.org/W2172813797","https://openalex.org/W2313050078","https://openalex.org/W2392984423","https://openalex.org/W2912291331","https://openalex.org/W2963940890","https://openalex.org/W3151522427","https://openalex.org/W4240896209","https://openalex.org/W4244375620","https://openalex.org/W4249513058","https://openalex.org/W6632986673","https://openalex.org/W6674727558"],"related_works":["https://openalex.org/W2022703525","https://openalex.org/W2155425983","https://openalex.org/W2089042254","https://openalex.org/W4220928172","https://openalex.org/W2725387418","https://openalex.org/W1821047009","https://openalex.org/W2201555914","https://openalex.org/W2172478086","https://openalex.org/W2114397143","https://openalex.org/W2000285254"],"abstract_inverted_index":{"We":[0,78,132],"consider":[1],"a":[2,16,24,29,63,88,101,137],"multi-agent":[3],"optimization":[4],"problem":[5,140],"where":[6],"agents":[7,96],"subject":[8,22],"to":[9,14,23,36,56,69,94,97,100,106],"local,":[10],"intermittent":[11],"interactions":[12],"aim":[13],"minimize":[15],"sum":[17],"of":[18,83,103,126],"local":[19],"objective":[20],"functions":[21],"global":[25,30],"inequality":[26],"constraint":[27,32,46,50],"and":[28,48,73,86,121,141],"state":[31,49],"set.":[33],"In":[34,54],"contrast":[35],"previous":[37],"work,":[38],"we":[39,67,113],"do":[40],"not":[41],"require":[42],"that":[43,115],"the":[44,74,81,116,122,127,143],"objective,":[45],"functions,":[47],"sets":[51],"are":[52],"convex.":[53],"order":[55],"deal":[57],"with":[58,145],"time-varying":[59],"network":[60],"topologies":[61],"satisfying":[62],"standard":[64],"connectivity":[65],"assumption,":[66],"resort":[68],"consensus":[70],"algorithm":[71,93,135],"techniques":[72],"Lagrangian":[75],"duality":[76],"method.":[77],"slightly":[79],"relax":[80],"requirement":[82],"exact":[84],"consensus,":[85],"propose":[87],"distributed":[89],"approximate":[90,108],"dual":[91,128],"subgradient":[92],"enable":[95],"asymptotically":[98],"converge":[99],"pair":[102],"primal-dual":[104],"solutions":[105],"an":[107],"problem.":[109],"To":[110],"guarantee":[111],"convergence,":[112],"assume":[114],"Slater's":[117],"condition":[118],"is":[119,130],"satisfied":[120],"optimal":[123],"solution":[124],"set":[125],"limit":[129],"singleton.":[131],"implement":[133],"our":[134],"over":[136],"source":[138],"localization":[139],"compare":[142],"performance":[144],"existing":[146],"algorithms.":[147]},"counts_by_year":[{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":6},{"year":2022,"cited_by_count":7},{"year":2021,"cited_by_count":10},{"year":2020,"cited_by_count":12},{"year":2019,"cited_by_count":19},{"year":2018,"cited_by_count":17},{"year":2017,"cited_by_count":18},{"year":2016,"cited_by_count":16},{"year":2015,"cited_by_count":14},{"year":2014,"cited_by_count":6},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}