{"id":"https://openalex.org/W2608272796","doi":"https://doi.org/10.1137/14099379x","title":"Finding Low-rank Solutions of Sparse Linear Matrix Inequalities using Convex Optimization","display_name":"Finding Low-rank Solutions of Sparse Linear Matrix Inequalities using Convex Optimization","publication_year":2017,"publication_date":"2017-01-01","ids":{"openalex":"https://openalex.org/W2608272796","doi":"https://doi.org/10.1137/14099379x","mag":"2608272796"},"language":"en","primary_location":{"id":"doi:10.1137/14099379x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/14099379x","pdf_url":null,"source":{"id":"https://openalex.org/S928796702","display_name":"SIAM Journal on Optimization","issn_l":"1052-6234","issn":["1052-6234","1095-7189"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Optimization","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5015341130","display_name":"Ramtin Madani","orcid":"https://orcid.org/0000-0001-9246-2357"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ramtin Madani","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5072786751","display_name":"Somayeh Sojoudi","orcid":"https://orcid.org/0000-0001-7177-7712"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Somayeh Sojoudi","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5042586538","display_name":"Ghazal Fazelnia","orcid":"https://orcid.org/0000-0002-8833-8465"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ghazal Fazelnia","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5042580848","display_name":"Javad Lavaei","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Javad Lavaei","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":5.6854,"has_fulltext":false,"cited_by_count":35,"citation_normalized_percentile":{"value":0.968562,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"27","issue":"2","first_page":"725","last_page":"758"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9959999918937683,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10792","display_name":"Matrix Theory and Algorithms","score":0.9779999852180481,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7590398788452148},{"id":"https://openalex.org/keywords/linear-matrix-inequality","display_name":"Linear matrix inequality","score":0.6031139492988586},{"id":"https://openalex.org/keywords/rank","display_name":"Rank (graph theory)","score":0.589252233505249},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.541243314743042},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.4964020848274231},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.4901788830757141},{"id":"https://openalex.org/keywords/matrix-completion","display_name":"Matrix completion","score":0.47268182039260864},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.4314197301864624},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.35077357292175293},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.22806483507156372}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7590398788452148},{"id":"https://openalex.org/C201829737","wikidata":"https://www.wikidata.org/wiki/Q2022760","display_name":"Linear matrix inequality","level":2,"score":0.6031139492988586},{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.589252233505249},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.541243314743042},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.4964020848274231},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.4901788830757141},{"id":"https://openalex.org/C2778459887","wikidata":"https://www.wikidata.org/wiki/Q6787865","display_name":"Matrix completion","level":3,"score":0.47268182039260864},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4314197301864624},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.35077357292175293},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.22806483507156372},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C163716315","wikidata":"https://www.wikidata.org/wiki/Q901177","display_name":"Gaussian","level":2,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/14099379x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/14099379x","pdf_url":null,"source":{"id":"https://openalex.org/S928796702","display_name":"SIAM Journal on Optimization","issn_l":"1052-6234","issn":["1052-6234","1095-7189"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Optimization","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.702.4412","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.702.4412","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.ieor.berkeley.edu/%7Elavaei/LMI_Low_Rank.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":50,"referenced_works":["https://openalex.org/W1584938588","https://openalex.org/W1606052501","https://openalex.org/W1607580485","https://openalex.org/W1628915153","https://openalex.org/W1632601927","https://openalex.org/W1916337001","https://openalex.org/W1965408066","https://openalex.org/W1978496689","https://openalex.org/W1984149403","https://openalex.org/W1985123706","https://openalex.org/W1990761146","https://openalex.org/W1993446440","https://openalex.org/W1997197201","https://openalex.org/W1998163797","https://openalex.org/W2006704773","https://openalex.org/W2009006054","https://openalex.org/W2015089195","https://openalex.org/W2022026988","https://openalex.org/W2024448984","https://openalex.org/W2025486357","https://openalex.org/W2029574412","https://openalex.org/W2030686911","https://openalex.org/W2030987833","https://openalex.org/W2036681141","https://openalex.org/W2056415888","https://openalex.org/W2058525617","https://openalex.org/W2059372025","https://openalex.org/W2061822764","https://openalex.org/W2071143636","https://openalex.org/W2076199517","https://openalex.org/W2085523940","https://openalex.org/W2085550081","https://openalex.org/W2099618798","https://openalex.org/W2101880654","https://openalex.org/W2105974301","https://openalex.org/W2115666768","https://openalex.org/W2116793595","https://openalex.org/W2118550318","https://openalex.org/W2118807841","https://openalex.org/W2119747577","https://openalex.org/W2128568643","https://openalex.org/W2134332047","https://openalex.org/W2141380252","https://openalex.org/W2144730813","https://openalex.org/W2146826069","https://openalex.org/W2167245803","https://openalex.org/W2327238720","https://openalex.org/W2485405089","https://openalex.org/W2611328865","https://openalex.org/W2912522929"],"related_works":["https://openalex.org/W3144354057","https://openalex.org/W4301205717","https://openalex.org/W2788210652","https://openalex.org/W3093503721","https://openalex.org/W3213035342","https://openalex.org/W2972830027","https://openalex.org/W4288107728","https://openalex.org/W1808520126","https://openalex.org/W2020788389","https://openalex.org/W2147442790"],"abstract_inverted_index":{"This":[0],"paper":[1],"is":[2,99],"concerned":[3],"with":[4],"the":[5,25,28,41,44,48,52,83,104,113,116,121],"problem":[6,30,50],"of":[7,12,27,43,47,54,71,82,106,115,127,138,159],"finding":[8],"a":[9,32,36,67,79,108],"low-rank":[10,68],"solution":[11,46,118],"an":[13],"arbitrary":[14],"sparse":[15],"linear":[16],"matrix":[17,140],"inequality":[18],"(LMI).":[19],"To":[20],"this":[21,128],"end,":[22],"we":[23,59],"map":[24],"sparsity":[26,53,84],"LMI":[29,49],"into":[31],"graph.":[33,57,85],"We":[34],"develop":[35],"mathematical":[37],"framework":[38],"to":[39,51,65,120,134],"relate":[40],"rank":[42,114,149],"minimum-rank":[45,139],"its":[55],"underlying":[56],"Furthermore,":[58],"propose":[60],"three":[61,135],"graph-theoretic":[62],"convex":[63,73],"programs":[64],"obtain":[66],"solution.":[69],"Two":[70],"these":[72],"optimization":[74,165],"problems":[75,137],"are":[76,153],"based":[77],"on":[78,92,112,156],"tree":[80],"decomposition":[81],"The":[86,125,151],"third":[87],"one":[88],"does":[89],"not":[90],"rely":[91],"any":[93],"computationally":[94],"expensive":[95],"graph":[96],"analysis":[97],"and":[98,147,163],"always":[100],"polynomial-time":[101],"solvable,":[102],"at":[103],"cost":[105],"offering":[107],"milder":[109],"theoretical":[110],"guarantee":[111],"obtained":[117],"compared":[119],"other":[122],"two":[123,157],"methods.":[124],"results":[126,152],"work":[129],"can":[130],"be":[131],"readily":[132],"applied":[133],"separate":[136],"completion,":[141],"conic":[142],"relaxation":[143],"for":[144,166],"polynomial":[145],"optimization,":[146],"affine":[148],"minimization.":[150],"finally":[154],"illustrated":[155],"applications":[158],"optimal":[160],"distributed":[161],"control":[162],"nonlinear":[164],"electrical":[167],"networks.":[168]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":6},{"year":2019,"cited_by_count":8},{"year":2018,"cited_by_count":7},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}