{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,3]],"date-time":"2026-06-03T18:18:13Z","timestamp":1780510693830,"version":"3.54.1"},"reference-count":26,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T00:00:00Z","timestamp":1559347200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T00:00:00Z","timestamp":1559347200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T00:00:00Z","timestamp":1559347200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"European Research Council ERC"},{"name":"European Unions Horizon 2020 research and innovation programme","award":["638992 - OPT4SMART"],"award-info":[{"award-number":["638992 - OPT4SMART"]}]},{"name":"Ministero dellIstruzione dellUniversita e della Ricerca MIUR"},{"name":"Scientific Independence of Young Researchers","award":["F22I15000080008"],"award-info":[{"award-number":["F22I15000080008"]}]},{"name":"CoNetDomeSys"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Automat. Contr."],"published-print":{"date-parts":[[2019,6]]},"DOI":"10.1109\/tac.2018.2872200","type":"journal-article","created":{"date-parts":[[2018,9,26]],"date-time":"2018-09-26T19:07:15Z","timestamp":1537988835000},"page":"2559-2566","source":"Crossref","is-referenced-by-count":17,"title":["A Duality-Based Approach for Distributed Min\u2013Max Optimization"],"prefix":"10.1109","volume":"64","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9841-3684","authenticated-orcid":false,"given":"Ivano","family":"Notarnicola","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6522-4046","authenticated-orcid":false,"given":"Mauro","family":"Franceschelli","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0906-7848","authenticated-orcid":false,"given":"Giuseppe","family":"Notarstefano","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1137\/15M1008956"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-014-0772-2"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2014.2308612"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/s10957-015-0758-0"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2017.07.003"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/s10957-009-9522-7"},{"key":"ref16","first-page":"1","article-title":"Distributed min-max optimization in networks","author":"nedi?","year":"0","journal-title":"Proc IEEE Conf Digit Signal Process"},{"key":"ref17","first-page":"5462","article-title":"Distributed subgradient methods for saddle-point problems","author":"mateos-n\u00fa\u00f1ez","year":"0","journal-title":"Proc IEEE Conf Decis Control"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2012.6426400"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2015.7178515"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TSG.2012.2206060"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TSG.2010.2089069"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-85729-033-5_4"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2006.879350"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6377(96)00019-3"},{"key":"ref7","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1109\/TAC.2011.2167817","article-title":"On distributed convex optimization under inequality and equality constraints","volume":"57","author":"zhu","year":"2012","journal-title":"IEEE Trans Autom Control"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2012.2192951"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1137\/070708111"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2016.7798538"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2011.2164020"},{"key":"ref22","author":"bertsekas","year":"1999","journal-title":"Nonlinear Programming"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2013.2281883"},{"key":"ref24","author":"bertsekas","year":"2015","journal-title":"On Algorithms for Non Convex Optimization"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2008.2009515"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TPWRS.2014.2354345"},{"key":"ref25","article-title":"Min common\/max crossing duality: A geometric view of conjugacy in convex optimization","author":"bertsekas","year":"2009"}],"container-title":["IEEE Transactions on Automatic Control"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9\/8723048\/08472154.pdf?arnumber=8472154","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T21:14:33Z","timestamp":1657746873000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8472154\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6]]},"references-count":26,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.1109\/tac.2018.2872200","relation":{},"ISSN":["0018-9286","1558-2523","2334-3303"],"issn-type":[{"value":"0018-9286","type":"print"},{"value":"1558-2523","type":"electronic"},{"value":"2334-3303","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,6]]}}}