{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T20:33:38Z","timestamp":1776890018573,"version":"3.51.2"},"reference-count":62,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000143","name":"Division of Computing and Communication Foundations","doi-asserted-by":"publisher","award":["1018368"],"award-info":[{"award-number":["1018368"]}],"id":[{"id":"10.13039\/100000143","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000143","name":"Division of Computing and Communication Foundations","doi-asserted-by":"publisher","award":["1116589"],"award-info":[{"award-number":["1116589"]}],"id":[{"id":"10.13039\/100000143","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000143","name":"Division of Computing and Communication Foundations","doi-asserted-by":"publisher","award":["1218754"],"award-info":[{"award-number":["1218754"]}],"id":[{"id":"10.13039\/100000143","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000143","name":"Division of Computing and Communication Foundations","doi-asserted-by":"publisher","award":["1527162"],"award-info":[{"award-number":["1527162"]}],"id":[{"id":"10.13039\/100000143","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1302336"],"award-info":[{"award-number":["1302336"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1547332"],"award-info":[{"award-number":["1547332"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1564142"],"award-info":[{"award-number":["1564142"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","award":["267439"],"award-info":[{"award-number":["267439"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000006","name":"Office of Naval Research","doi-asserted-by":"publisher","award":["N00014-15-1-2677"],"award-info":[{"award-number":["N00014-15-1-2677"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2017,1]]},"DOI":"10.1109\/tit.2016.2619373","type":"journal-article","created":{"date-parts":[[2016,10,19]],"date-time":"2016-10-19T18:21:17Z","timestamp":1476901277000},"page":"676-697","source":"Crossref","is-referenced-by-count":39,"title":["Inference for Generalized Linear Models via Alternating Directions and Bethe Free Energy Minimization"],"prefix":"10.1109","volume":"63","author":[{"given":"Sundeep","family":"Rangan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alyson K.","family":"Fletcher","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0939-7545","authenticated-orcid":false,"given":"Philip","family":"Schniter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ulugbek S.","family":"Kamilov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2309005"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2012.2217334"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.804053"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/ACSSC.2011.6189951"},{"key":"ref31","first-page":"1033","article-title":"The concave-convex procedure (CCCP)","volume":"2","author":"yuille","year":"2002","journal-title":"Advances in neural information processing systems"},{"key":"ref30","first-page":"239","article-title":"Understanding belief propagation and its generalizations","author":"yedidia","year":"2003","journal-title":"Exploring Artificial Intelligence in the New Millennium"},{"key":"ref37","author":"bishop","year":"2006","journal-title":"Pattern Recognition and Machine Learning (Information Science and Statistics)"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2245716"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/78.558475"},{"key":"ref34","first-page":"1545","article-title":"Asymptotic analysis of MAP estimation via the replica method and compressed sensing","author":"rangan","year":"2009","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-55925-9_36"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1109\/49.414651"},{"key":"ref61","author":"vidyasagar","year":"1978","journal-title":"Nonlinear Systems Analysis"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620309"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2015.7178325"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6875083"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4899-3242-6"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.2307\/2344614"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/CISS.2010.5464768"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2094817"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6033942"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6874830"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1093\/imaiai\/iat004"},{"key":"ref26","first-page":"1123","article-title":"Swept approximate message passing for sparse estimation","author":"manoel","year":"2015","journal-title":"Proc ICML"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6875146"},{"key":"ref50","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":"1996","journal-title":"J R Statist Soc B (Methodological)"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/CISS.2008.4558487"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6283056"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2014.2357773"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2014.2357776"},{"key":"ref56","first-page":"1241","article-title":"Hybrid generalized approximation message passing with applications to structured sparsity","author":"rangan","year":"2012","journal-title":"Proc IEEE Int Symp Inf Theory"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2012.2191780"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2014.2337841"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2013.2272287"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevX.2.021005"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1137\/09076934X"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/s10851-010-0251-1"},{"key":"ref40","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1561\/2200000001","article-title":"Graphical models, exponential families, and variational inference","volume":"1","author":"wainwright","year":"2008","journal-title":"Found Trends Mach Learn"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1137\/100814494"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/1247069.1247123"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1993.10594284"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.2307\/2289717"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1023\/A:1018509429360"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0909892106"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ITWKSPS.2010.5503193"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ITWKSPS.2010.5503228"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1002\/cpa.20042"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/83.661182"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1137\/080716542"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2009.2016892"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2007.909319"},{"key":"ref7","article-title":"Gradient methods for minimizing composite objective function","author":"nesterov","year":"2007","journal-title":"Center for Operations Research and Econometrics"},{"key":"ref49","first-page":"123","article-title":"Proximal algorithms","volume":"3","author":"parikh","year":"2013","journal-title":"Found Trends Optim"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1561\/2200000016"},{"key":"ref46","first-page":"416","article-title":"MAP estimation, linear programming and belief propagation with convex free energies","author":"weiss","year":"2007","journal-title":"Proc UAI"},{"key":"ref45","author":"nocedal","year":"2006","journal-title":"Numerical Optimization"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-5320-4"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2177575"},{"key":"ref42","first-page":"554","article-title":"Belief optimization for binary networks: A stable alternative to loopy belief propagation","author":"welling","year":"2001","journal-title":"Proc Uncertainty Artif Intell"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2009.2027773"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1016\/B978-0-12-468662-5.50017-3"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2317487"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/ieeexplore.ieee.org\/ielaam\/18\/7792231\/7600459-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/7792231\/07600459.pdf?arnumber=7600459","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,8]],"date-time":"2022-04-08T18:55:21Z","timestamp":1649444121000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7600459\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,1]]},"references-count":62,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tit.2016.2619373","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,1]]}}}