{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T09:03:26Z","timestamp":1777626206575,"version":"3.51.4"},"reference-count":27,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2015,7,1]],"date-time":"2015-07-01T00:00:00Z","timestamp":1435708800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Netw. Sci. Eng."],"published-print":{"date-parts":[[2015,7,1]]},"DOI":"10.1109\/tnse.2015.2479086","type":"journal-article","created":{"date-parts":[[2015,9,15]],"date-time":"2015-09-15T18:49:23Z","timestamp":1442342963000},"page":"97-111","source":"Crossref","is-referenced-by-count":9,"title":["Sparse Solutions to the Average Consensus Problem via Various Regularizations of the Fastest Mixing Markov-Chain Problem"],"prefix":"10.1109","volume":"2","author":[{"given":"Giorgio","family":"Gnecco","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rita","family":"Morisi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alberto","family":"Bemporad","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","first-page":"305","article-title":"On identifying sparse representations of consensus networks","volume":"3","author":"dhingra","year":"0","journal-title":"Proc 2nd IFAC Workshop on Distrib Estimat Control in Netw Syst"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1561\/2200000016"},{"key":"ref12","first-page":"2228","article-title":"Sparse solutions to the average consensus problem via $l_1$ -norm regularization of the fastest mixing Markov-chain problem","author":"gnecco","year":"0","journal-title":"Proc 53rd IEEE Int Conf Decision Control"},{"key":"ref13","author":"golub","year":"1996","journal-title":"Matrix Computations"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1201\/b11644-19"},{"key":"ref16","author":"dym","year":"2007","journal-title":"Linear Algebra in Action"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1214\/07-EJS004"},{"key":"ref18","author":"murphy","year":"2012","journal-title":"Machine Learning A Probabilistic Perspective"},{"key":"ref19","doi-asserted-by":"crossref","DOI":"10.1515\/9781400833344","author":"bernstein","year":"2009","journal-title":"Matrix Mathematics Theory Facts and Formulas"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2006.887293"},{"key":"ref27","article-title":"The exact feasibility of randomized solutions of uncertain convex programs","year":"0","journal-title":"SIAM J Optimization"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.arcontrol.2012.03.003"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2007.07.009"},{"key":"ref5","doi-asserted-by":"crossref","first-page":"667","DOI":"10.1137\/S0036144503423264","article-title":"Fastest mixing Markov chain on a graph","volume":"46","author":"boyd","year":"2004","journal-title":"SIAM Rev"},{"key":"ref8","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1111\/j.2517-6161.1996.tb02080.x","article-title":"Regression shrinkage and selection via the LASSO","volume":"58","author":"tibshirani","year":"1994","journal-title":"J Royal Statistical Society Series B"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/2492007.2492029"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1038\/nature10011"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1515\/9781400835355"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.sysconle.2004.02.022"},{"key":"ref20","author":"aliprantis","year":"2006","journal-title":"Infinite Dimensional Analysis A Hitchhiker’s Guide"},{"key":"ref22","first-page":"145","article-title":"Automatic enumeation of all connected subgraphs","volume":"41","author":"r\u00facker","year":"2000","journal-title":"MATCH Commun Math Comput Chem"},{"key":"ref21","doi-asserted-by":"crossref","DOI":"10.2307\/j.ctvjnrt76","author":"stokey","year":"1989","journal-title":"Recursive Methods in Economic Dynamics"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/s00041-008-9045-x"},{"key":"ref23","author":"garey","year":"1979","journal-title":"Computers and Intractability A Guide to the Theory of NP-Completeness"},{"key":"ref26","article-title":"A sparse group LASSO","year":"0","journal-title":"J Comput Graphical Statist"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-9868.2005.00532.x"}],"container-title":["IEEE Transactions on Network Science and Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6488902\/7295693\/07268908.pdf?arnumber=7268908","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,11]],"date-time":"2024-06-11T04:33:30Z","timestamp":1718080410000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7268908\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,7,1]]},"references-count":27,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tnse.2015.2479086","relation":{},"ISSN":["2327-4697"],"issn-type":[{"value":"2327-4697","type":"print"}],"subject":[],"published":{"date-parts":[[2015,7,1]]}}}