{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:27:18Z","timestamp":1759847238965,"version":"3.28.0"},"reference-count":39,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,12]]},"DOI":"10.1109\/cdc.2018.8619478","type":"proceedings-article","created":{"date-parts":[[2019,1,24]],"date-time":"2019-01-24T05:12:50Z","timestamp":1548306770000},"page":"1624-1631","source":"Crossref","is-referenced-by-count":13,"title":["Sparse Semidefinite Programs with Near-Linear Time Complexity"],"prefix":"10.1109","author":[{"given":"Richard Y.","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Javad","family":"Lavaei","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1080\/10556789908805766"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TPWRS.2010.2051168"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.2140\/pjm.1965.15.835"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TPWRS.2014.2322051"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TPWRS.2011.2160974"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1979.1055985"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-004-0556-1"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1080\/10556780802553325"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1137\/0611010"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1016\/0024-3795(84)90207-6"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1137\/0608024"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(88)90191-3"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1995.1009"},{"key":"ref13","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/978-1-4613-8369-7_2","article-title":"Cutting down on fill using nested dissection: Provably good elimination orderings","author":"agrawal","year":"1993","journal-title":"Graph Theory and Sparse Matrix Computation"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1080\/1055678021000045123"},{"key":"ref15","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1007\/978-1-4757-3216-0_8","article-title":"The MOSEK interior point optimizer for linear programming: an implementation of the homogeneous algorithm","author":"andersen","year":"2000","journal-title":"High Performance Optimization"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1287\/moor.19.1.53"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611970791"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-010-0402-6"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1561\/2400000006"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623497328987"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TPWRS.2015.2411391"},{"journal-title":"Available at cvxopt org","article-title":"CVXOPT: A Python package for convex optimization, version 1.1. 6","year":"2013","key":"ref27"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TPWRS.2013.2258044"},{"journal-title":"Probabilistic Networks and Expert Systems Exact Computational Methods for Bayesian Networks","year":"1999","author":"cowell","key":"ref6"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-002-0352-8"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1137\/14099379X"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-002-0351-9"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623400366218"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/BF02523688"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1080\/10556788.2012.684353"},{"key":"ref1","doi-asserted-by":"crossref","first-page":"1115","DOI":"10.1145\/227683.227684","article-title":"Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming","volume":"42","author":"goemans","year":"1995","journal-title":"J ACM"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TPWRS.2013.2294479"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-006-0031-2"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1137\/130926924"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2015.7402462"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2015.7403152"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/s12532-010-0016-2"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2017.2739644"}],"event":{"name":"2018 IEEE Conference on Decision and Control (CDC)","start":{"date-parts":[[2018,12,17]]},"location":"Miami Beach, FL","end":{"date-parts":[[2018,12,19]]}},"container-title":["2018 IEEE Conference on Decision and Control (CDC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8592870\/8618647\/08619478.pdf?arnumber=8619478","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,23]],"date-time":"2020-08-23T22:29:13Z","timestamp":1598221753000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8619478\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,12]]},"references-count":39,"URL":"https:\/\/doi.org\/10.1109\/cdc.2018.8619478","relation":{},"subject":[],"published":{"date-parts":[[2018,12]]}}}