{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T13:41:26Z","timestamp":1762004486106},"reference-count":45,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"9","license":[{"start":{"date-parts":[[2013,9,1]],"date-time":"2013-09-01T00:00:00Z","timestamp":1377993600000},"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. Inform. Theory"],"published-print":{"date-parts":[[2013,9]]},"DOI":"10.1109\/tit.2013.2259576","type":"journal-article","created":{"date-parts":[[2013,4,23]],"date-time":"2013-04-23T18:47:52Z","timestamp":1366742872000},"page":"5860-5881","source":"Crossref","is-referenced-by-count":9,"title":["Message-Passing Algorithms: Reparameterizations and Splittings"],"prefix":"10.1109","volume":"59","author":[{"given":"Nicholas","family":"Ruozzi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sekhar","family":"Tatikonda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1023\/B:STCO.0000021412.33763.d5"},{"key":"ref38","article-title":"Tree-reweighted belief propagation algorithms and approximate ML estimation via pseudo-moment matching","author":"wainwright","year":"2003","journal-title":"12th Int Conf Artif Intell Statist"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2264715"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/ITA.2011.5743617"},{"key":"ref31","article-title":"Tree block coordinate descent for MAP in graphical models","author":"sontag","year":"2009","journal-title":"12th Int Conf Artif Intell Statist"},{"key":"ref30","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":"ref37","doi-asserted-by":"publisher","DOI":"10.1002\/ett.1184"},{"key":"ref36","article-title":"Towards low-complexity linear programming decoding","author":"vontobel","year":"2006","journal-title":"4th Int Conf Turbo Codes Related Topics"},{"key":"ref35","article-title":"Graph-cover decoding and finite-length analysis of message-passing iterative decoding of LDPC codes","author":"vontobel","year":"2005","journal-title":"CoRR"},{"key":"ref34","first-page":"991","article-title":"On the relationship between linear programming decoding and min-sum algorithm decoding","author":"vontobel","year":"2004","journal-title":"Proc Int Symp Inf Theory Appl"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2079014"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.856938"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1162\/0899766041941943"},{"key":"ref12","doi-asserted-by":"crossref","first-page":"1568","DOI":"10.1109\/TPAMI.2006.200","article-title":"Convergent tree-reweighted message passing for energy minimization","volume":"28","author":"kolmogorov","year":"2006","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"ref13","first-page":"316","article-title":"On the optimality of tree-reweighted max-product message-passing","author":"kolmogorov","year":"2005","journal-title":"Proc 21st Conf Uncertainty Artif Intell"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2007.4408890"},{"key":"ref15","first-page":"149","article-title":"Dvumernoe programmirovanie v zadachakh analiza izobrazheniy (two-dimensional programming in image analysis problems)","volume":"8","author":"koval","year":"1976","journal-title":"USSR Acad Sci Automat Telemech"},{"key":"ref16","author":"kovalevsky","year":"1975","journal-title":"A Diffusion Algorithm for Decreasing Energy of Max-Sum Labeling Problem"},{"key":"ref17","first-page":"2031","article-title":"Walk-sums and belief propagation in Gaussian graphical models","volume":"7","author":"malioutov","year":"2006","journal-title":"J Mach Learn Res"},{"key":"ref18","article-title":"Convergent message passing algorithms: A unifying view","author":"meltzer","year":"2009","journal-title":"25th Conf Uncertainty Artif Intell"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2016055"},{"key":"ref28","first-page":"113","article-title":"Sintaksicheskiy analiz dvumernykh zritelnikh signalov v usloviyakh pomekh (syntactic analysis of two-dimensional visual signals in noisy conditions)","volume":"4","author":"schlesinger","year":"1976","journal-title":"Kibernetika"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2030477"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2030448"},{"key":"ref3","author":"axvig","year":"2012","journal-title":"LP pseudocodewords of cycle codes are half-Integral"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.842696"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2011.5995642"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1137\/110826746"},{"key":"ref8","doi-asserted-by":"crossref","first-page":"972","DOI":"10.1126\/science.1136800","article-title":"Clustering by passing messages between data points","volume":"315","author":"frey","year":"2007","journal-title":"Science"},{"key":"ref7","author":"flach","year":"1998","journal-title":"A Diffusion Algorithm for Decreasing Energy of Max-Sum Labeling Problem"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(81)90062-9"},{"key":"ref9","article-title":"Fixing max-product: Convergent message passing algorithms for MAP LP-relaxations","author":"globerson","year":"2007","journal-title":"21st Neural Inf Process Syst"},{"key":"ref1","first-page":"82","article-title":"Local and global properties in networks of processors","author":"angluin","year":"1980","journal-title":"Proc 12th ACM Symp Theory Comput"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2040863"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2094815"},{"key":"ref22","first-page":"133","article-title":"Reverend Bayes on inference engines: A distributed hierarchical approach","author":"pearl","year":"1982","journal-title":"Proc Amer Assoc Artif Intell Nat Conf AI"},{"key":"ref21","first-page":"467","article-title":"Loopy belief propagation for approximate inference: An empirical study","author":"murphy","year":"1999","journal-title":"Proc 15th Conf Uncertainty Artif Intell"},{"key":"ref42","article-title":"MAP estimation, linear programming and belief propagation with convex free energies","author":"weiss","year":"2007","journal-title":"Proc 23rd Conf Uncertainty Artif Intell"},{"key":"ref24","first-page":"1043","article-title":"Message-passing for graph-structured linear programs: Proximal methods and rounding schemes","volume":"11","author":"ravikumar","year":"2010","journal-title":"J Mach Learn Res"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/18.910585"},{"key":"ref23","first-page":"729","article-title":"Convex max-product over compact sets for protein folding","author":"peng","year":"2011","journal-title":"Proc 28th Int Conf Mach Learn"},{"key":"ref44","first-page":"438","article-title":"Fractional belief propagation","author":"wiegerinck","year":"2002","journal-title":"Proc 15th Neural Inf Process Syst"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2009.5394484"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2007.1036"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/CISS.2010.5464748"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/6579681\/06507327.pdf?arnumber=6507327","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,29]],"date-time":"2021-11-29T20:47:47Z","timestamp":1638218867000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6507327\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,9]]},"references-count":45,"journal-issue":{"issue":"9"},"URL":"https:\/\/doi.org\/10.1109\/tit.2013.2259576","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,9]]}}}