{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,30]],"date-time":"2025-06-30T04:05:58Z","timestamp":1751256358083,"version":"3.41.0"},"reference-count":32,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,10]]},"DOI":"10.1109\/allerton.2017.8262867","type":"proceedings-article","created":{"date-parts":[[2018,1,18]],"date-time":"2018-01-18T23:03:47Z","timestamp":1516316627000},"page":"1153-1159","source":"Crossref","is-referenced-by-count":0,"title":["Efficient rank minimization to tighten semidefinite programming for unconstrained binary quadratic optimization"],"prefix":"10.1109","author":[{"given":"Roman","family":"Pogodin","sequence":"first","affiliation":[]},{"given":"Mikhail","family":"Krechetov","sequence":"additional","affiliation":[]},{"given":"Yury","family":"Maximov","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"journal-title":"Heuristic algorithms for the unconstrained binary quadratic programming problem","year":"1998","author":"beasley","key":"ref32"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623497328987"},{"key":"ref30","first-page":"3441","article-title":"Iterative reweighted algorithms for matrix rank minimization","volume":"13","author":"mohan","year":"2012","journal-title":"Journal of Machine Learning Research"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-014-9734-0"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/227683.227684"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/509907.510017"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1561\/2400000009"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-59408-6_46"},{"key":"ref15","first-page":"85","author":"karp","year":"1972","journal-title":"Reducibility Among Combinatorial Problems"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-012-0594-z"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-008-0235-8"},{"journal-title":"General heuristics for nonconvex quadratically constrained quadratic programming","year":"2017","author":"park","key":"ref18"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1080\/10556789808805690"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/s10957-013-0477-3"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/43.67789"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ACC.2003.1243393"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1287\/opre.36.3.493"},{"journal-title":"Discrete Optimization","year":"2014","author":"parker","key":"ref6"},{"key":"ref29","first-page":"655","article-title":"Low-rank matrix recovery via efficient schatten p-norm minimization","author":"nie","year":"2012","journal-title":"Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence"},{"key":"ref5","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1002\/3527603794.ch4","article-title":"Computing exact ground states of hard ising spin glass problems by branch-and-cut","author":"frauke liers","year":"2004","journal-title":"New Optimization Algorithms in Physics"},{"journal-title":"Introduction to Algorithms","year":"2009","author":"cormen","key":"ref8"},{"key":"ref7","volume":"29","author":"garey","year":"2002","journal-title":"Computers and Intractability"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2014.2336252"},{"journal-title":"Geometry of Cuts and Metrics","year":"2009","author":"deza","key":"ref9"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2016.2541146"},{"journal-title":"Growth function and VC-dimension","year":"2011","author":"bartlett","key":"ref20"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/BF02574037"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1287\/moor.23.2.339"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1287\/moor.1080.0326"},{"key":"ref23","first-page":"329","volume":"357","author":"burer","year":"2003","journal-title":"A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84800-155-8_7"},{"journal-title":"CVX Matlab Software for Disciplined Convex Programming Version 2 1","year":"2014","author":"grant","key":"ref25"}],"event":{"name":"2017 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","start":{"date-parts":[[2017,10,3]]},"location":"Monticello, IL","end":{"date-parts":[[2017,10,6]]}},"container-title":["2017 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8253908\/8262705\/08262867.pdf?arnumber=8262867","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,29]],"date-time":"2025-06-29T22:41:56Z","timestamp":1751236916000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8262867\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,10]]},"references-count":32,"URL":"https:\/\/doi.org\/10.1109\/allerton.2017.8262867","relation":{},"subject":[],"published":{"date-parts":[[2017,10]]}}}