{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T12:20:53Z","timestamp":1730204453708,"version":"3.28.0"},"reference-count":58,"publisher":"IEEE","license":[{"start":{"date-parts":[[2020,12,14]],"date-time":"2020-12-14T00:00:00Z","timestamp":1607904000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,12,14]],"date-time":"2020-12-14T00:00:00Z","timestamp":1607904000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,12,14]],"date-time":"2020-12-14T00:00:00Z","timestamp":1607904000000},"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":[[2020,12,14]]},"DOI":"10.1109\/cdc42340.2020.9304494","type":"proceedings-article","created":{"date-parts":[[2021,1,13]],"date-time":"2021-01-13T02:27:32Z","timestamp":1610504852000},"page":"384-389","source":"Crossref","is-referenced-by-count":2,"title":["A Two-Step Pre-Processing for Semidefinite Programming"],"prefix":"10.1109","author":[{"given":"Vyacheslav","family":"Kungurtsev","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jakub","family":"Marecek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-016-1048-9"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-7621-4_12"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1137\/15M103710X"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2014.7040427"},{"key":"ref31","article-title":"Preprocessing and reduction for semidefinite programming via facial reduction: Theory and practice","author":"cheung","year":"2013","journal-title":"Ph D Dissertation"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1137\/090759392"},{"article-title":"Facial reduction for symmetry reduced semidefinite programs","year":"2019","author":"hu","key":"ref37"},{"key":"ref36","article-title":"Partial facial reduction: simplified, equivalent sdps via approximations of the psd cone","author":"permenter","year":"2017","journal-title":"Mathematical Programming"},{"key":"ref35","article-title":"Reduction methods in semidefinite and conic optimization","author":"permenter","year":"2017","journal-title":"Ph D Dissertation"},{"key":"ref34","article-title":"Low rank matrix completion through semi-definite programming with facial reduction","author":"ye","year":"2016","journal-title":"Master’s thesis"},{"article-title":"Treewidth-based conditions for exactness of the sherali-adams and lasserre relaxations","year":"2004","author":"wainwright","key":"ref28"},{"key":"ref27","article-title":"Chordal sparsity in control and optimization of large-scale systems","author":"zheng","year":"2019","journal-title":"Ph D Dissertation"},{"key":"ref29","first-page":"1","article-title":"Graphical models, exponential families, and variational inference","volume":"1","author":"wainwright","year":"2008","journal-title":"Foundations and Trends\ufffd in Machine Learning"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1080\/10556780802102693"},{"key":"ref1","first-page":"41","article-title":"A direct formulation for sparse pca using semidefinite programming","volume":"17","author":"d\u2019aspremont","year":"2005","journal-title":"Advances in neural information processing systems"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ACC.2016.7526549"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1137\/140972354"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1017\/S1446788700017250"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1561\/2400000006"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1137\/15M1041924"},{"article-title":"Cdcs: Cone decomposition conic solver, version 1.1","year":"2016","author":"zheng","key":"ref26"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.23919\/ACC.2017.7963462"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0701-6"},{"key":"ref51","first-page":"152","article-title":"User’s manual for sparsecolo: Conversion methods for sparse conic- form linear optimization problems","author":"fujisawa","year":"2009"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-0769-0"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1080\/10556789908805769"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1007\/s101070100263"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1137\/15M1049415"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-002-0355-5"},{"key":"ref53","first-page":"1","article-title":"Partial facial reduction: simplified, equivalent sdps via approximations of the psd cone","author":"permenter","year":"2014","journal-title":"Mathematical Programming"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-010-0402-6"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1137\/060668791"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/0024-3795(84)90207-6"},{"article-title":"Large-scale manifold learning by semidefinite facial reduction","year":"2012","author":"alipanahi","key":"ref40"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-8369-7_1"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623400366218"},{"key":"ref14","first-page":"499","author":"kim","year":"2012","journal-title":"Exploiting Sparsity in SDP Relaxation of Polynomial Optimization Problems"},{"article-title":"On the Minimum Chordal Completion Polytope","year":"2016","author":"bergman","key":"ref15"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-019-01366-3"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TPWRS.2015.2390037"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TPWRS.2013.2294479"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TCNS.2014.2309732"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.5244\/C.22.55"},{"key":"ref3","first-page":"417","article-title":"Inference in graphical models via semidefinite programming hierarchies","volume":"30","author":"erdogdu","year":"2017","journal-title":"Advances in neural information processing systems"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2017.2726578"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611970777"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TPWRS.2011.2160974"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2014.6907313"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1137\/11085390X"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/s11590-011-0384-1"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539798336073"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1137\/0602010"},{"key":"ref48","first-page":"875","article-title":"Minimum fill-in: inapproximability and almost tight lower bounds","author":"cao","year":"2017","journal-title":"Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1995.1009"},{"key":"ref42","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1145\/3096730.3096740","article-title":"Finding maximum rank moment matrices by facial reduction on primal form and Douglas-Rachford iteration","volume":"51","author":"reid","year":"2017","journal-title":"ACM Communications in Computer Algebra"},{"key":"ref41","article-title":"Low-rank matrix completion using nuclear norm with facial reduction","author":"huang","year":"2017","journal-title":"Journal of Global Optimization"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1561\/2400000011"},{"article-title":"Robust principal component analysis using facial reduction","year":"2018","author":"ma","key":"ref43"}],"event":{"name":"2020 59th IEEE Conference on Decision and Control (CDC)","start":{"date-parts":[[2020,12,14]]},"location":"Jeju, Korea (South)","end":{"date-parts":[[2020,12,18]]}},"container-title":["2020 59th IEEE Conference on Decision and Control (CDC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9303728\/9303729\/09304494.pdf?arnumber=9304494","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,27]],"date-time":"2022-06-27T12:03:50Z","timestamp":1656331430000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9304494\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,12,14]]},"references-count":58,"URL":"https:\/\/doi.org\/10.1109\/cdc42340.2020.9304494","relation":{},"subject":[],"published":{"date-parts":[[2020,12,14]]}}}