{"id":"https://openalex.org/W2003753589","doi":"https://doi.org/10.1137/090761793","title":"Rank-Sparsity Incoherence for Matrix Decomposition","display_name":"Rank-Sparsity Incoherence for Matrix Decomposition","publication_year":2011,"publication_date":"2011-04-01","ids":{"openalex":"https://openalex.org/W2003753589","doi":"https://doi.org/10.1137/090761793","mag":"2003753589"},"language":"en","primary_location":{"id":"doi:10.1137/090761793","is_oa":false,"landing_page_url":"https://doi.org/10.1137/090761793","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":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/0906.2220","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Venkat Chandrasekaran","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Venkat Chandrasekaran","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Sujay Sanghavi","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sujay Sanghavi","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Pablo A. Parrilo","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Pablo A. Parrilo","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":null,"display_name":"Alan S. Willsky","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Alan S. Willsky","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":51.5626,"has_fulltext":false,"cited_by_count":660,"citation_normalized_percentile":{"value":0.99956629,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":99,"max":100},"biblio":{"volume":"21","issue":"2","first_page":"572","last_page":"596"},"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.9380000233650208,"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.9380000233650208,"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/T12303","display_name":"Tensor decomposition and applications","score":0.011500000022351742,"subfield":{"id":"https://openalex.org/subfields/2605","display_name":"Computational Mathematics"},"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/T13487","display_name":"Statistical and numerical algorithms","score":0.011500000022351742,"subfield":{"id":"https://openalex.org/subfields/2604","display_name":"Applied Mathematics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/matrix-norm","display_name":"Matrix norm","score":0.6029000282287598},{"id":"https://openalex.org/keywords/identifiability","display_name":"Identifiability","score":0.5669999718666077},{"id":"https://openalex.org/keywords/matrix","display_name":"Matrix (chemical analysis)","score":0.5591999888420105},{"id":"https://openalex.org/keywords/norm","display_name":"Norm (philosophy)","score":0.47609999775886536},{"id":"https://openalex.org/keywords/sparse-matrix","display_name":"Sparse matrix","score":0.46720001101493835},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.45809999108314514},{"id":"https://openalex.org/keywords/algebraic-number","display_name":"Algebraic number","score":0.44040000438690186},{"id":"https://openalex.org/keywords/matrix-decomposition","display_name":"Matrix decomposition","score":0.42340001463890076},{"id":"https://openalex.org/keywords/decomposition","display_name":"Decomposition","score":0.399399995803833}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8360000252723694},{"id":"https://openalex.org/C92207270","wikidata":"https://www.wikidata.org/wiki/Q939253","display_name":"Matrix norm","level":3,"score":0.6029000282287598},{"id":"https://openalex.org/C122770356","wikidata":"https://www.wikidata.org/wiki/Q1656753","display_name":"Identifiability","level":2,"score":0.5669999718666077},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.5591999888420105},{"id":"https://openalex.org/C191795146","wikidata":"https://www.wikidata.org/wiki/Q3878446","display_name":"Norm (philosophy)","level":2,"score":0.47609999775886536},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.46889999508857727},{"id":"https://openalex.org/C56372850","wikidata":"https://www.wikidata.org/wiki/Q1050404","display_name":"Sparse matrix","level":3,"score":0.46720001101493835},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.45809999108314514},{"id":"https://openalex.org/C9376300","wikidata":"https://www.wikidata.org/wiki/Q168817","display_name":"Algebraic number","level":2,"score":0.44040000438690186},{"id":"https://openalex.org/C42355184","wikidata":"https://www.wikidata.org/wiki/Q1361088","display_name":"Matrix decomposition","level":3,"score":0.42340001463890076},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.399399995803833},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3968000113964081},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.38999998569488525},{"id":"https://openalex.org/C124066611","wikidata":"https://www.wikidata.org/wiki/Q28684319","display_name":"Sparse approximation","level":2,"score":0.361299991607666},{"id":"https://openalex.org/C2778459887","wikidata":"https://www.wikidata.org/wiki/Q6787865","display_name":"Matrix completion","level":3,"score":0.35429999232292175},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.3425999879837036},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.33959999680519104},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.32820001244544983},{"id":"https://openalex.org/C54848796","wikidata":"https://www.wikidata.org/wiki/Q339011","display_name":"Symmetric matrix","level":3,"score":0.30300000309944153},{"id":"https://openalex.org/C61987429","wikidata":"https://www.wikidata.org/wiki/Q3064355","display_name":"M-matrix","level":3,"score":0.30219998955726624},{"id":"https://openalex.org/C84545080","wikidata":"https://www.wikidata.org/wiki/Q1147936","display_name":"Condition number","level":3,"score":0.30090001225471497},{"id":"https://openalex.org/C138187205","wikidata":"https://www.wikidata.org/wiki/Q131251","display_name":"Tangent","level":2,"score":0.2976999878883362},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.2802000045776367},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.27649998664855957},{"id":"https://openalex.org/C111110010","wikidata":"https://www.wikidata.org/wiki/Q2627315","display_name":"Convex combination","level":4,"score":0.2694999873638153},{"id":"https://openalex.org/C22629506","wikidata":"https://www.wikidata.org/wiki/Q7602993","display_name":"State-transition matrix","level":4,"score":0.2637999951839447},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2578999996185303},{"id":"https://openalex.org/C2780551164","wikidata":"https://www.wikidata.org/wiki/Q2306599","display_name":"Column (typography)","level":3,"score":0.2578999996185303},{"id":"https://openalex.org/C1678238","wikidata":"https://www.wikidata.org/wiki/Q6787895","display_name":"Single-entry matrix","level":5,"score":0.25679999589920044},{"id":"https://openalex.org/C49870271","wikidata":"https://www.wikidata.org/wiki/Q193657","display_name":"Convex set","level":4,"score":0.25589999556541443},{"id":"https://openalex.org/C91229774","wikidata":"https://www.wikidata.org/wiki/Q193885","display_name":"Infinitesimal","level":2,"score":0.2526000142097473}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1137/090761793","is_oa":false,"landing_page_url":"https://doi.org/10.1137/090761793","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:arXiv.org:0906.2220","is_oa":true,"landing_page_url":"http://arxiv.org/abs/0906.2220","pdf_url":"https://arxiv.org/pdf/0906.2220","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:authors.library.caltech.edu:34747","is_oa":false,"landing_page_url":"https://resolver.caltech.edu/CaltechAUTHORS:20121008-095909823","pdf_url":null,"source":{"id":"https://openalex.org/S4306402161","display_name":"CaltechAUTHORS (California Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I122411786","host_organization_name":"California Institute of Technology","host_organization_lineage":["https://openalex.org/I122411786"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Article"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:0906.2220","is_oa":true,"landing_page_url":"http://arxiv.org/abs/0906.2220","pdf_url":"https://arxiv.org/pdf/0906.2220","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1678167890","https://openalex.org/W2029213856","https://openalex.org/W2050834445","https://openalex.org/W2077143506","https://openalex.org/W2094050913","https://openalex.org/W2097596242","https://openalex.org/W2099641086","https://openalex.org/W2118408802","https://openalex.org/W2118550318","https://openalex.org/W2145096794","https://openalex.org/W2154332973","https://openalex.org/W2912522929","https://openalex.org/W4206039498","https://openalex.org/W4250955649"],"related_works":[],"abstract_inverted_index":{"Suppose":[0],"we":[1,58,114,167],"are":[2,160,176],"given":[3,26],"a":[4,35,39,60,74,90,105,151],"matrix":[5,14,27,68,106,188],"that":[6,169],"is":[7,22,49,133],"formed":[8],"by":[9,72],"adding":[10],"an":[11,16,97],"unknown":[12,17],"sparse":[13,30,146,156],"to":[15,23,51,64,117,141],"low-rank":[18,32,148,158],"matrix.":[19],"Our":[20,131],"goal":[21],"decompose":[24],"the":[25,66,78,82,86,101,138,142,155,170],"into":[28,69],"its":[29,70,108],"and":[31,45,48,81,107,110,113,147,157],"components.":[33,87],"Such":[34],"problem":[36],"arises":[37],"in":[38,43,53,135],"number":[40],"of":[41,77,85,92,104,145],"applications":[42],"model":[44],"system":[46],"identification":[47],"intractable":[50],"solve":[52],"general.":[54],"In":[55],"this":[56],"paper":[57],"consider":[59],"convex":[61],"optimization":[62],"formulation":[63],"splitting":[65],"specified":[67],"components":[71],"minimizing":[73],"linear":[75],"combination":[76],"\u2113_1":[79],"norm":[80,84],"nuclear":[83],"We":[88,181],"develop":[89],"notion":[91],"rank-sparsity":[93],"incoherence,":[94],"expressed":[95],"as":[96,122,124],"uncertainty":[98],"principle":[99],"between":[100],"sparsity":[102],"pattern":[103],"row":[109],"column":[111],"spaces,":[112],"use":[115],"it":[116],"characterize":[118],"both":[119],"fundamental":[120],"identifiability":[121],"well":[123],"(deterministic)":[125],"sufficient":[126,171],"conditions":[127,172],"for":[128,173],"exact":[129,174],"recovery.":[130],"analysis":[132],"geometric":[134],"nature":[136],"with":[137,178,183],"tangent":[139],"spaces":[140],"algebraic":[143],"varieties":[144],"matrices":[149,159],"playing":[150],"prominent":[152],"role.":[153],"When":[154],"drawn":[161],"from":[162],"certain":[163],"natural":[164],"random":[165],"ensembles,":[166],"show":[168],"recovery":[175],"satisfied":[177],"high":[179],"probability.":[180],"conclude":[182],"simulation":[184],"results":[185],"on":[186],"synthetic":[187],"decomposition":[189],"problems.":[190]},"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":27},{"year":2024,"cited_by_count":18},{"year":2023,"cited_by_count":37},{"year":2022,"cited_by_count":27},{"year":2021,"cited_by_count":39},{"year":2020,"cited_by_count":44},{"year":2019,"cited_by_count":62},{"year":2018,"cited_by_count":67},{"year":2017,"cited_by_count":64},{"year":2016,"cited_by_count":54},{"year":2015,"cited_by_count":71},{"year":2014,"cited_by_count":57},{"year":2013,"cited_by_count":45},{"year":2012,"cited_by_count":34}],"updated_date":"2026-03-25T14:56:36.534964","created_date":"2016-06-24T00:00:00"}
