{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T17:33:00Z","timestamp":1767979980140,"version":"3.49.0"},"reference-count":22,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,12]]},"DOI":"10.1109\/cdc.2013.6760019","type":"proceedings-article","created":{"date-parts":[[2014,3,13]],"date-time":"2014-03-13T22:14:07Z","timestamp":1394748847000},"page":"1037-1042","source":"Crossref","is-referenced-by-count":10,"title":["Accelerated dual descent for constrained convex network flow optimization"],"prefix":"10.1109","author":[{"given":"Michael","family":"Zarghamy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alejandro","family":"Ribeiroy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ali","family":"Jadbabaiey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2012.6426324"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2013.6831412"},{"key":"17","author":"bertsekas","year":"1999","journal-title":"Nonlinear Programming"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2005.1498447"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623494265359"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511810817"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1109\/ACC.2011.5991367"},{"key":"14","author":"goldberg","year":"1990","journal-title":"Network flow Algorithms"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1137\/0325006"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/ACC.2011.5991367"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.2200\/S00271ED1V01Y201006CNT007"},{"key":"3","author":"rockafellar","year":"1984","journal-title":"Network Flows and Monotropic Programming"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1109\/9.182479"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.4018\/978-1-4666-2661-4"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.9.2.190"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441"},{"key":"7","first-page":"54","article-title":"Distributed subgradient methods for multiagent optimization","author":"nedic","year":"2009","journal-title":"IEEE Transactions on Automatic Control"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2004.831346"},{"key":"5","author":"piro","year":"2004","journal-title":"Routing Flow and Capacity Design in Communication and Computer Networks"},{"key":"4","author":"bertsekas","year":"1998","journal-title":"Network Optimization Continuous and Discrete Models"},{"key":"9","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-82118-9","author":"shor","year":"1985","journal-title":"Minimization Methods for Non-Differentiable Functions"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2010.2091295"}],"event":{"name":"2013 IEEE 52nd Annual Conference on Decision and Control (CDC)","location":"Firenze","start":{"date-parts":[[2013,12,10]]},"end":{"date-parts":[[2013,12,13]]}},"container-title":["52nd IEEE Conference on Decision and Control"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6749719\/6759837\/06760019.pdf?arnumber=6760019","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,22]],"date-time":"2017-06-22T09:34:59Z","timestamp":1498124099000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6760019\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,12]]},"references-count":22,"URL":"https:\/\/doi.org\/10.1109\/cdc.2013.6760019","relation":{},"subject":[],"published":{"date-parts":[[2013,12]]}}}