{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T20:59:40Z","timestamp":1774990780195,"version":"3.50.1"},"reference-count":47,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,9,1]],"date-time":"2019-09-01T00:00:00Z","timestamp":1567296000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,9,1]],"date-time":"2019-09-01T00:00:00Z","timestamp":1567296000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,9]]},"DOI":"10.1109\/allerton.2019.8919841","type":"proceedings-article","created":{"date-parts":[[2019,12,6]],"date-time":"2019-12-06T04:23:39Z","timestamp":1575606219000},"page":"580-586","source":"Crossref","is-referenced-by-count":1,"title":["A Fine-Grained Variant of the Hierarchy of Lasserre"],"prefix":"10.1109","author":[{"given":"Wann-Jiun","family":"Ma","sequence":"first","affiliation":[{"name":"IBM Research – Ireland,Dublin D15,Ireland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jakub","family":"Marecek","sequence":"additional","affiliation":[{"name":"IBM Research – Ireland,Dublin D15,Ireland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Mevissen","sequence":"additional","affiliation":[{"name":"IBM Research – Ireland,Dublin D15,Ireland"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1561\/3100000012"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TPWRS.2014.2372478"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/PSCC.2016.7540906"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2014.7039413"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TSG.2017.2715282"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TPWRS.2011.2160974"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/PTC.2015.7232429"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/PSCC.2014.7038397"},{"key":"ref35","author":"matiyasevich","year":"1993","journal-title":"Hilbert’s 10th Problem"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1080\/10556788.2017.1288729"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1137\/16M1109060"},{"key":"ref40","first-page":"283","article-title":"A method for nonlinear constraints in minimization problems","author":"powell","year":"1969","journal-title":"R Fletcher editor Optimization"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1137\/16M1109060"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2019.02.016"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1137\/110834524"},{"key":"ref14","first-page":"1","article-title":"The direct extension of admm for multi-block convex minimization problems is not necessarily convergent","author":"chen","year":"2014","journal-title":"Mathematical Programming"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/BF01581204"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TPWRS.2015.2390037"},{"key":"ref17","first-page":"1","article-title":"A dynamic inequality generation scheme for polynomial programming","author":"ghaddar","year":"2015","journal-title":"Mathematical Programming"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-20807-2_17"},{"key":"ref19","author":"gu","year":"1994","journal-title":"A Stable and Fast Algorithm for Updating the Singular Value Decomposition"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623400366802"},{"key":"ref4","article-title":"Complexity and real computation","author":"blum","year":"2012","journal-title":"Springer Science & Business Media"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/PESGM.2015.7285718"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1080\/10556780903087124"},{"key":"ref6","first-page":"20","article-title":"Fast low-rank modifications of the thin singular value decomposition. Linear Algebra and its Applications","volume":"415","author":"brand","year":"2006","journal-title":"Special Issue on Large Scale Linear and Nonlinear Eigenvalue Problems"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107447226"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611970777"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/BF01397471"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-012-0534-y"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1017\/S0962492913000032"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.sorms.2012.08.001"},{"key":"ref1","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4614-0769-0_1","article-title":"Handbook on semidefinite, conic and polynomial optimization","author":"anjos","year":"2012","journal-title":"volume 166 of International series in operations research & management science"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1137\/1038003"},{"key":"ref20","author":"hall","year":"2018","journal-title":"Optimization over Nonnegative and Convex Polynomials With and Without Semidefinite Programming"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-005-0581-8"},{"key":"ref22","article-title":"On the linear convergence of the alternating direction method of multipliers","author":"hong","year":"2012","journal-title":"arXiv preprint arXiv 1208 3922"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1145\/2699464"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/BF00927673"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1287\/moor.1.2.97"},{"key":"ref24","author":"kleniati","year":"2010","journal-title":"Decomposition schemes for polynomial optimisation semidefinite programming and applications to nonconvex portfolio decisions"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1137\/120891009"},{"key":"ref23","first-page":"289","article-title":"Decomposition-based method for sparse semidefinite relaxations of polynomial optimization problems. Journal of optimization theory and applications","volume":"145","author":"kleniati","year":"2010"},{"key":"ref44","article-title":"Inexact coordinate descent: complexity and preconditioning","author":"tappenden","year":"2013","journal-title":"arXiv preprint arXiv 1304 5530"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-007-9112-2"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1137\/0314056"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/s10898-010-9529-5"}],"event":{"name":"2019 57th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","location":"Monticello, IL, USA","start":{"date-parts":[[2019,9,24]]},"end":{"date-parts":[[2019,9,27]]}},"container-title":["2019 57th Annual Allerton Conference on Communication, Control, and Computing (Allerton)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8911248\/8919648\/08919841.pdf?arnumber=8919841","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T19:51:35Z","timestamp":1774986695000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8919841\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,9]]},"references-count":47,"URL":"https:\/\/doi.org\/10.1109\/allerton.2019.8919841","relation":{},"subject":[],"published":{"date-parts":[[2019,9]]}}}