{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,29]],"date-time":"2026-09-29T20:48:04Z","timestamp":1790714884893,"version":"4.1.0"},"reference-count":90,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2017,3,1]],"date-time":"2017-03-01T00:00:00Z","timestamp":1488326400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/100000163","name":"ARC Future Fellowship","doi-asserted-by":"publisher","award":["FT120100969"],"award-info":[{"award-number":["FT120100969"]}],"id":[{"id":"10.13039\/100000163","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Data to Decisions Cooperative Research Centre"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Pattern Anal. Mach. Intell."],"published-print":{"date-parts":[[2017,3,1]]},"DOI":"10.1109\/tpami.2016.2541146","type":"journal-article","created":{"date-parts":[[2016,3,11]],"date-time":"2016-03-11T14:25:33Z","timestamp":1457706333000},"page":"470-485","source":"Crossref","is-referenced-by-count":49,"title":["Large-Scale Binary Quadratic Optimization Using Semidefinite Relaxation and Applications"],"prefix":"10.1109","volume":"39","author":[{"given":"Peng","family":"Wang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chunhua","family":"Shen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Anton van den","family":"Hengel","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Philip H. S.","family":"Torr","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref73","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-6377(97)00012-6"},{"key":"ref72","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-1974-0343581-1"},{"key":"ref71","doi-asserted-by":"publisher","DOI":"10.1093\/imamat\/12.3.223"},{"key":"ref70","year":"2015"},{"key":"ref76","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2011.6126429"},{"key":"ref77","doi-asserted-by":"publisher","DOI":"10.1109\/43.159993"},{"key":"ref74","author":"wang","year":"2016"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1137\/0805002"},{"key":"ref75","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2005.8"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2010.5539868"},{"key":"ref78","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-33718-5_42"},{"key":"ref79","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2011.5995630"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/11550518_39"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/227683.227684"},{"key":"ref31","first-page":"71","article-title":"An analysis of convex relaxations for MAP estimation of discrete MRFs","volume":"10","author":"kumar","year":"2009","journal-title":"J Mach Learn Res"},{"key":"ref30","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 Learning"},{"key":"ref37","first-page":"171","article-title":"Probabilistic subgraph matching based on convex relaxation","author":"schellewald","year":"0","journal-title":"Proc Int Conf Energy Minimization Methods Comp Vis Pattern Recog"},{"key":"ref36","article-title":"Solving Markov random fields using semi-definite programming","author":"torr","year":"0","journal-title":"Proc Int Workshop Artif Intell Statist"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2007.383202"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2003.1240111"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1137\/080727075"},{"key":"ref62","article-title":"Relaxations and randomized methods for nonconvex QCQPs","author":"d'aspremont","year":"2003"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1137\/0913035"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2010.936019"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1137\/1038003"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1007\/BF02574037"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/990308.990313"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1287\/moor.23.2.339"},{"key":"ref66","first-page":"1309","article-title":"ARPACK users’ guide: Solution of large scale eigenvalue problems with implicitly restarted Arnoldi methods","volume":"69","author":"lehoucq","year":"2000","journal-title":"Math Comput"},{"key":"ref29","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-4381-7","author":"wolkowicz","year":"2000","journal-title":"Handbook of Semidefinite Programming Theory Algorithms and Applications"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719604"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1145\/1089014.1089019"},{"key":"ref69","year":"2015"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-014-9734-0"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-00293-4_1"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2004.1262179"},{"key":"ref22","first-page":"313","article-title":"Balanced graph matching","author":"cour","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref21","first-page":"75","article-title":"Solving Markov random fields with spectral relaxation","author":"cour","year":"0","journal-title":"Proc 9th Int Workshop Artif Intell Statist"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2009.5459173"},{"key":"ref23","article-title":"Semidefinite relaxations for approximate inference on graphs with cycles","author":"jordan","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref26","first-page":"715","article-title":"Fixing two weaknesses of the spectral method","author":"lang","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479896312262"},{"key":"ref50","article-title":"Scalable semidefinite relaxation for maximum a posterior estimation","author":"huang","year":"0","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1007\/BF01580138"},{"key":"ref90","doi-asserted-by":"publisher","DOI":"10.1007\/s10898-007-9161-1"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1007\/BF01582255"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1145\/279232.279236"},{"key":"ref57","author":"krislock","year":"2013","journal-title":"Math Program Ser A"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2011.5995447"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-0769-0_20"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2013.173"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-002-0353-7"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623497328987"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-89496-6_11"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.856938"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611970791"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2006.200"},{"key":"ref13","article-title":"Fixing max-product: Convergent message passing algorithms for MAP LP-relaxations","author":"globerson","year":"2007"},{"key":"ref14","first-page":"795","article-title":"Efficiently searching for frustrated cycles in MAP inference","author":"sontag","year":"0","journal-title":"Proc Conf Uncertainty of Artificial Intelligence"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/1143844.1143937"},{"key":"ref82","author":"andres","year":"2012"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2006.283"},{"key":"ref81","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2001.937655"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1023\/A:1025794313696"},{"key":"ref84","doi-asserted-by":"publisher","DOI":"10.1090\/fic\/018\/14"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1137\/100802190"},{"key":"ref83","first-page":"503","article-title":"Tightening LP relaxations for MAP using message passing","author":"sontag","year":"0","journal-title":"Proc Uncertainty Artif Intell"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/34.868688"},{"key":"ref80","doi-asserted-by":"publisher","DOI":"10.1145\/1835804.1835877"},{"key":"ref89","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2006.12.013"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.cviu.2013.07.004"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0028368"},{"key":"ref6","article-title":"An experimental evaluation of CP\/AI\/OR solvers for optimization in graphical models","author":"givry","year":"2014"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/s11263-015-0809-x"},{"key":"ref85","doi-asserted-by":"publisher","DOI":"10.1016\/0024-3795(88)90223-6"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2007.1031"},{"key":"ref86","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2004.1262177"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1007\/s12532-010-0017-1"},{"key":"ref87","doi-asserted-by":"publisher","DOI":"10.1287\/moor.21.3.576"},{"key":"ref88","doi-asserted-by":"publisher","DOI":"10.1137\/S089547980036838X"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2007.383203"},{"key":"ref46","first-page":"3077","article-title":"Simple MAP inference via low-rank relaxations","author":"frostig","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1137\/080731359"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1137\/080718206"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1137\/070704575"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1080\/10556789908805762"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1080\/10556789908805766"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-002-0352-8"},{"key":"ref43","year":"0"}],"container-title":["IEEE Transactions on Pattern Analysis and Machine Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/34\/7842740\/07431988.pdf?arnumber=7431988","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T11:38:17Z","timestamp":1641987497000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7431988\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,3,1]]},"references-count":90,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tpami.2016.2541146","relation":{},"ISSN":["0162-8828","2160-9292"],"issn-type":[{"value":"0162-8828","type":"print"},{"value":"2160-9292","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,3,1]]}}}