{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T08:38:17Z","timestamp":1774600697876,"version":"3.50.1"},"reference-count":71,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"12","license":[{"start":{"date-parts":[[2010,12,1]],"date-time":"2010-12-01T00:00:00Z","timestamp":1291161600000},"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":[[2010,12]]},"DOI":"10.1109\/tit.2010.2079014","type":"journal-article","created":{"date-parts":[[2010,11,30]],"date-time":"2010-11-30T21:08:54Z","timestamp":1291151334000},"page":"6294-6316","source":"Crossref","is-referenced-by-count":53,"title":["Norm-Product Belief Propagation: Primal-Dual Message-Passing for Approximate Inference"],"prefix":"10.1109","volume":"56","author":[{"given":"Tamir","family":"Hazan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amnon","family":"Shashua","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref71","doi-asserted-by":"publisher","DOI":"10.1162\/08997660260028674"},{"key":"ref70","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.850085"},{"key":"ref39","article-title":"convexifying the bethe free energy","author":"meshi","year":"2009","journal-title":"Proc Conf Uncertainty Artificial Intelligence"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2005.110"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2010.108"},{"key":"ref32","doi-asserted-by":"crossref","first-page":"806","DOI":"10.1007\/978-3-540-88690-7_60","article-title":"beyond loose lp-relaxations: optimizing mrfs by repairing cycles","author":"komodakis","year":"2008","journal-title":"Eur Conf Computer Vision (ECCV 2008)"},{"key":"ref31","article-title":"on the optimality of tree-reweighted max-product message passing","author":"kolmogorov","year":"2005","journal-title":"Proc Conf Uncertainty in Artificial Intelligence"},{"key":"ref30","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":"ref37","article-title":"convergent message passing algorithms-a unifying view","author":"meltzer","year":"2009","journal-title":"Uncertainty Artif Intell"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1287\/moor.18.4.846"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/18.910572"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-6377(98)00043-1"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1967.1054010"},{"key":"ref62","article-title":"tree-based reparameterization for approximate estimation on graphs with cycles","author":"wainwright","year":"2002","journal-title":"Proc Conf Neural Information Processing Systems (NIPS)"},{"key":"ref61","article-title":"towards low-complexity linear-programming decoding","author":"vontobel","year":"2006","journal-title":"Arxiv preprint cs\/0602088"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1115\/1.3662552"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.850091"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-011-5014-9"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.856938"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1162\/089976600300015880"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRev.81.988"},{"key":"ref66","article-title":"map estimation, linear programming and belief propagation with convex free energies","author":"weiss","year":"2007","journal-title":"Proc 19th Conf Uncertainty in Artifical Inteligence (UAI)"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2007.1036"},{"key":"ref68","first-page":"1907","article-title":"linear programming relaxations and belief propagation-an empirical study","volume":"7","author":"yanover","year":"2006","journal-title":"J Mach Learn Res"},{"key":"ref69","first-page":"1481","article-title":"approximate inference and protein-folding","author":"yanover","year":"2003","journal-title":"Proc Conf Neural Information Processing Systems (NIPS)"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2005.1523648"},{"key":"ref1","author":"baxter","year":"1982","journal-title":"Exactly Solved Models in Statistical Mechanics"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1162\/0899766041941943"},{"key":"ref22","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1613\/jair.1933","article-title":"convexity arguments for efficient minimization of the bethe and kikuchi free energies","volume":"26","author":"heskes","year":"2006","journal-title":"J Artific Intell Res"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1162\/0899766041941943"},{"key":"ref24","article-title":"loopy belief propagation for bipartite maximum weight b-matching","author":"huang","year":"2007","journal-title":"Artific Intell and Statist (AISTATS)"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1002\/nav.3800040113"},{"key":"ref26","article-title":"Lagrangian relaxation for MAP estimation in graphical models","author":"johnson","year":"2007","journal-title":"Allerton Conf on Communication Control and Computing"},{"key":"ref25","doi-asserted-by":"crossref","DOI":"10.1613\/jair.583","article-title":"variational probabilistic inference and the qmr-dt database","author":"jaakkola","year":"1999","journal-title":"J Artific Intell Res"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(94)90072-8"},{"key":"ref51","first-page":"1393","article-title":"new outer bounds on the marginal polytope","author":"sontag","year":"2008","journal-title":"Adv Neur Inform Process Syst"},{"key":"ref59","author":"tutte","year":"2001","journal-title":"Graph Theory"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-007-0170-0"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1007\/BF01581245"},{"key":"ref56","article-title":"loopy belief propagation and gibbs measures","author":"tatikonda","year":"2002","journal-title":"Proc Conf Uncertainty in Artificial Intelligence"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2003.1238444"},{"key":"ref54","first-page":"1425","article-title":"loop series and bethe variational bounds in attractive graphical models","volume":"20","author":"sudderth","year":"2008","journal-title":"Adv Neur Inform Process Syst"},{"key":"ref53","article-title":"tightening lp relaxations for map using message passing","author":"sontag","year":"2008","journal-title":"Proc Conf Uncertainty in Artificial Intelligence (UAI)"},{"key":"ref52","article-title":"tree block coordinate descent for map in graphical models","author":"sontag","year":"2009","journal-title":"Proc 12th Int Workshop on Artificial Intelligence and Statistics (AI-STATS)"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1214\/aop\/1176996454"},{"key":"ref40","author":"mooij","year":"2009","journal-title":"libDAI A Free\/Open Source C++ library for Discrete Approximate Inference Methods"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1214\/aop\/1176992918"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1983.10477029"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-30162-4_216"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1023\/A:1026501619075"},{"key":"ref15","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/3348.001.0001","author":"frey","year":"1998","journal-title":"Graphical Models for Machine Learning and Digital Communications"},{"key":"ref16","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/4347.001.0001","author":"gallager","year":"1963","journal-title":"Low-Density Parity Check Codes"},{"key":"ref17","article-title":"convergent propagation algorithms via oriented trees","author":"globerson","year":"2007","journal-title":"Proc Conf Uncertainty Artificial Intelligence"},{"key":"ref18","article-title":"fixing max-product: convergent message passing algorithms for map relaxations","author":"globerson","year":"2007","journal-title":"Proc Conf Neural Information Processing Systems (NIPS)"},{"key":"ref19","article-title":"convergent message-passing algorithms for inference over general graphs with convex free energies","author":"hazan","year":"2008","journal-title":"Proc Conf Uncertainty Artificial Intelligence"},{"key":"ref4","author":"bertsekas","year":"2003","journal-title":"Convex Analysis and Optimization"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.1993.397441"},{"key":"ref6","first-page":"319","article-title":"dykstra's algorithm as the nonlinear extension of bregman's optimization method","volume":"6","author":"bregman","year":"1999","journal-title":"J Convex Anal"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/0041-5553(67)90040-7"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1088\/1742-5468\/2006\/06\/P06009"},{"key":"ref7","first-page":"407","article-title":"the dykstra algorithm with bregman projections","volume":"2","author":"censor","year":"1998","journal-title":"Commun Appl Anal"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2003.1238633"},{"key":"ref9","first-page":"1","article-title":"the patch transform and its applications to image editing","author":"cho","year":"2008","journal-title":"Proc IEEE Conf Computer Vision and Pattern Recognition (CVPR)"},{"key":"ref46","doi-asserted-by":"crossref","DOI":"10.1515\/9781400873173","author":"rockafellar","year":"1970","journal-title":"Convex Analysis"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1145\/1390156.1390257"},{"key":"ref48","first-page":"113","article-title":"syntactic analysis of two-dimensional visual signals in noisy conditions","volume":"4","author":"schlesinger","year":"1976","journal-title":"Kibernetika"},{"key":"ref47","article-title":"Linear programming analysis of loopy belief propagation for weighted matching","author":"sanghavi","year":"2007","journal-title":"Proc Neural Inform Process Syst"},{"key":"ref42","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-8853-9","author":"nesterov","year":"2004","journal-title":"Introductory Lectures on Convex Optimization A Basic Course"},{"key":"ref41","article-title":"sufficient conditions for convergence of loopy belief propagation","author":"mooij","year":"2005","journal-title":"Proc Conf Uncertainty Artificial Intelligence"},{"key":"ref44","author":"pearl","year":"1988","journal-title":"Probabilistic Reasoning in Intelligent Systems Networks of Plausible Inference"},{"key":"ref43","doi-asserted-by":"crossref","DOI":"10.1515\/9781400881895","author":"neumann","year":"1950","journal-title":"Functional Operators Vol II"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/18\/5625612\/05625635.pdf?arnumber=5625635","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,11]],"date-time":"2021-10-11T00:45:56Z","timestamp":1633913156000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5625635\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,12]]},"references-count":71,"journal-issue":{"issue":"12"},"URL":"https:\/\/doi.org\/10.1109\/tit.2010.2079014","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,12]]}}}