{"id":"https://openalex.org/W2550766755","doi":"https://doi.org/10.1109/allerton.2010.5706969","title":"Iterative reweighted least squares for matrix rank minimization","display_name":"Iterative reweighted least squares for matrix rank minimization","publication_year":2010,"publication_date":"2010-09-01","ids":{"openalex":"https://openalex.org/W2550766755","doi":"https://doi.org/10.1109/allerton.2010.5706969","mag":"2550766755"},"language":"en","primary_location":{"id":"doi:10.1109/allerton.2010.5706969","is_oa":false,"landing_page_url":"https://doi.org/10.1109/allerton.2010.5706969","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","raw_type":"proceedings-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/A5103855032","display_name":"Karthik Mohan","orcid":null},"institutions":[{"id":"https://openalex.org/I201448701","display_name":"University of Washington","ror":"https://ror.org/00cvxb145","country_code":"US","type":"education","lineage":["https://openalex.org/I201448701"]},{"id":"https://openalex.org/I58610484","display_name":"Seattle University","ror":"https://ror.org/02jqc0m91","country_code":"US","type":"education","lineage":["https://openalex.org/I58610484"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Karthik Mohan","raw_affiliation_strings":["Electrical Engineering Department, University of Washington, Seattle, USA"],"affiliations":[{"raw_affiliation_string":"Electrical Engineering Department, University of Washington, Seattle, USA","institution_ids":["https://openalex.org/I201448701","https://openalex.org/I58610484"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5102886973","display_name":"Maryam Fazel","orcid":"https://orcid.org/0000-0001-5329-4522"},"institutions":[{"id":"https://openalex.org/I201448701","display_name":"University of Washington","ror":"https://ror.org/00cvxb145","country_code":"US","type":"education","lineage":["https://openalex.org/I201448701"]},{"id":"https://openalex.org/I58610484","display_name":"Seattle University","ror":"https://ror.org/02jqc0m91","country_code":"US","type":"education","lineage":["https://openalex.org/I58610484"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Maryam Fazel","raw_affiliation_strings":["Electrical Engineering Department, University of Washington, Seattle, USA"],"affiliations":[{"raw_affiliation_string":"Electrical Engineering Department, University of Washington, Seattle, USA","institution_ids":["https://openalex.org/I201448701","https://openalex.org/I58610484"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5103855032"],"corresponding_institution_ids":["https://openalex.org/I201448701","https://openalex.org/I58610484"],"apc_list":null,"apc_paid":null,"fwci":9.267,"has_fulltext":false,"cited_by_count":83,"citation_normalized_percentile":{"value":0.98526724,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"653","last_page":"661"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":1.0,"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":1.0,"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/T10326","display_name":"Indoor and Outdoor Localization Technologies","score":0.9955000281333923,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"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/T11739","display_name":"Microwave Imaging and Scattering Analysis","score":0.9929999709129333,"subfield":{"id":"https://openalex.org/subfields/2204","display_name":"Biomedical Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/underdetermined-system","display_name":"Underdetermined system","score":0.6147310733795166},{"id":"https://openalex.org/keywords/iteratively-reweighted-least-squares","display_name":"Iteratively reweighted least squares","score":0.563158392906189},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5597467422485352},{"id":"https://openalex.org/keywords/rank","display_name":"Rank (graph theory)","score":0.5251326560974121},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.45367807149887085},{"id":"https://openalex.org/keywords/affine-transformation","display_name":"Affine transformation","score":0.4495953619480133},{"id":"https://openalex.org/keywords/iterative-method","display_name":"Iterative method","score":0.43062570691108704},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.42109912633895874},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.35148149728775024},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.33212828636169434},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.3210921287536621},{"id":"https://openalex.org/keywords/estimation-theory","display_name":"Estimation theory","score":0.18598735332489014},{"id":"https://openalex.org/keywords/non-linear-least-squares","display_name":"Non-linear least squares","score":0.14682552218437195},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.10126090049743652}],"concepts":[{"id":"https://openalex.org/C179690561","wikidata":"https://www.wikidata.org/wiki/Q4316110","display_name":"Underdetermined system","level":2,"score":0.6147310733795166},{"id":"https://openalex.org/C126090379","wikidata":"https://www.wikidata.org/wiki/Q6094424","display_name":"Iteratively reweighted least squares","level":4,"score":0.563158392906189},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5597467422485352},{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.5251326560974121},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.45367807149887085},{"id":"https://openalex.org/C92757383","wikidata":"https://www.wikidata.org/wiki/Q382497","display_name":"Affine transformation","level":2,"score":0.4495953619480133},{"id":"https://openalex.org/C159694833","wikidata":"https://www.wikidata.org/wiki/Q2321565","display_name":"Iterative method","level":2,"score":0.43062570691108704},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.42109912633895874},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.35148149728775024},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.33212828636169434},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.3210921287536621},{"id":"https://openalex.org/C167928553","wikidata":"https://www.wikidata.org/wiki/Q1376021","display_name":"Estimation theory","level":2,"score":0.18598735332489014},{"id":"https://openalex.org/C45923927","wikidata":"https://www.wikidata.org/wiki/Q3319230","display_name":"Non-linear least squares","level":3,"score":0.14682552218437195},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.10126090049743652}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/allerton.2010.5706969","is_oa":false,"landing_page_url":"https://doi.org/10.1109/allerton.2010.5706969","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.365.2605","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.365.2605","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://faculty.washington.edu/mfazel/allerton-IRLS.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":25,"referenced_works":["https://openalex.org/W1529624360","https://openalex.org/W1573301526","https://openalex.org/W1966096622","https://openalex.org/W2001801912","https://openalex.org/W2017761965","https://openalex.org/W2019441424","https://openalex.org/W2025666718","https://openalex.org/W2074471762","https://openalex.org/W2103972604","https://openalex.org/W2107861471","https://openalex.org/W2117756735","https://openalex.org/W2143163931","https://openalex.org/W2158923808","https://openalex.org/W2168745297","https://openalex.org/W2611328865","https://openalex.org/W2949105773","https://openalex.org/W2950176463","https://openalex.org/W2951927428","https://openalex.org/W2953381901","https://openalex.org/W6650872149","https://openalex.org/W6675529100","https://openalex.org/W6683226146","https://openalex.org/W6684677280","https://openalex.org/W6764481259","https://openalex.org/W6977528248"],"related_works":["https://openalex.org/W133751542","https://openalex.org/W2066796569","https://openalex.org/W2997320962","https://openalex.org/W4287906532","https://openalex.org/W3011121006","https://openalex.org/W176802781","https://openalex.org/W1981487911","https://openalex.org/W2169393984","https://openalex.org/W2554374647","https://openalex.org/W2552960157"],"abstract_inverted_index":{"The":[0,38],"classical":[1],"compressed":[2],"sensing":[3],"problem":[4,24,67,130],"is":[5,25,242,259],"to":[6,11,22,26,35,56,172,180,237],"find":[7],"the":[8,28,58,126,152,161,164,176,181,191,226,235,238,264],"sparsest":[9],"solution":[10],"an":[12],"underdetermined":[13],"system":[14],"of":[15,123,138,146,167,184,222,228,230,232,240],"linear":[16,98],"equations.":[17],"A":[18],"good":[19],"convex":[20],"approximation":[21],"this":[23,115],"minimize":[27],"\u2113":[29,59,87],"<sub":[30,60,88],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[31,61,89],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">1</sub>":[32,90],"norm":[33],"subject":[34],"affine":[36,69],"constraints.":[37,70],"Iterative":[39,252],"Reweighted":[40],"Least":[41],"Squares":[42],"(IRLSp)":[43],"algorithm":[44,178,255],"(0":[45],"<;":[46,80,111],"p":[47,79,106,110],"\u2264":[48,64],"1),":[49],"has":[50,82],"been":[51],"proposed":[52],"as":[53,120,214],"a":[54,121,135,185,196,220],"method":[55],"solve":[57],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">p</sub>":[62],"(p":[63],"1)":[65],"minimization":[66,129,188],"with":[68,78,105],"Recently":[71],"Chartrand":[72],"et":[73,94],"al":[74,95],"observed":[75],"that":[76,160,175,204,247],"IRLS-p":[77,104,119,168],"1":[81,108,112],"better":[83,210,250],"empirical":[84],"performance":[85],"than":[86,211,251],"minimization,":[91],"and":[92,99,109,131,169,174,202,207],"Daubechies":[93],"gave":[96],"`local'":[97],"super-linear":[100],"convergence":[101],"results":[102],"for":[103,125,149,200],"=":[107],"respectively.":[113],"In":[114],"paper":[116],"we":[117,132,194],"extend":[118],"family":[122,137],"algorithms":[124,212],"matrix":[127],"rank":[128,266],"also":[133,158,245],"present":[134,142],"related":[136],"algorithms,":[139],"sIRLS-p.":[140],"We":[141,157,244],"guarantees":[143],"on":[144,219,263],"recovery":[145],"low-rank":[147],"matrices":[148],"IRLS-1":[150],"under":[151],"Null":[153],"Space":[154],"Property":[155],"(NSP).":[156],"establish":[159],"difference":[162],"between":[163],"successive":[165],"iterates":[166],"sIRLS-p":[170],"converges":[171,179],"zero":[173],"IRLS-0":[177,201,208],"stationary":[182],"point":[183],"non-convex":[186],"rank-surrogate":[187],"problem.":[189],"On":[190],"numerical":[192],"side,":[193],"give":[195],"few":[197],"efficient":[198],"implementations":[199],"demonstrate":[203],"both":[205],"sIRLS-0":[206,248],"perform":[209],"such":[213],"Singular":[215],"Value":[216],"Thresholding":[217,254],"(SVT)":[218],"range":[221],"`hard'":[223],"problems":[224],"(where":[225],"ratio":[227],"number":[229,239],"degrees":[231],"freedom":[233],"in":[234],"variable":[236],"measurements":[241],"large).":[243],"observe":[246],"performs":[249],"Hard":[253],"(IHT)":[256],"when":[257],"there":[258],"no":[260],"apriori":[261],"information":[262],"low":[265],"solution.":[267]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":8},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":7},{"year":2016,"cited_by_count":7},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":14},{"year":2013,"cited_by_count":10},{"year":2012,"cited_by_count":11}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}