{"id":"https://openalex.org/W2008328077","doi":"https://doi.org/10.1109/acssc.2014.7094721","title":"Smoothed rank approximation algorithms for matrix completion","display_name":"Smoothed rank approximation algorithms for matrix completion","publication_year":2014,"publication_date":"2014-11-01","ids":{"openalex":"https://openalex.org/W2008328077","doi":"https://doi.org/10.1109/acssc.2014.7094721","mag":"2008328077"},"language":"en","primary_location":{"id":"doi:10.1109/acssc.2014.7094721","is_oa":false,"landing_page_url":"https://doi.org/10.1109/acssc.2014.7094721","pdf_url":null,"source":{"id":"https://openalex.org/S4363608593","display_name":"2014 48th Asilomar Conference on Signals, Systems and Computers","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 48th Asilomar Conference on Signals, Systems and Computers","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/A5058894947","display_name":"Mohammed Al-Qizwini","orcid":null},"institutions":[{"id":"https://openalex.org/I87216513","display_name":"Michigan State University","ror":"https://ror.org/05hs6h993","country_code":"US","type":"education","lineage":["https://openalex.org/I87216513"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Mohammed Al-Qizwini","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Michigan State University, East Lansing, MI, USA","Department of Electrical & Computer Engineering Michigan State University, East Lansing, MI, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Michigan State University, East Lansing, MI, USA","institution_ids":["https://openalex.org/I87216513"]},{"raw_affiliation_string":"Department of Electrical & Computer Engineering Michigan State University, East Lansing, MI, USA","institution_ids":["https://openalex.org/I87216513"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5015107642","display_name":"Hayder Radha","orcid":null},"institutions":[{"id":"https://openalex.org/I87216513","display_name":"Michigan State University","ror":"https://ror.org/05hs6h993","country_code":"US","type":"education","lineage":["https://openalex.org/I87216513"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Hayder Radha","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Michigan State University, East Lansing, MI, USA","Department of Electrical & Computer Engineering Michigan State University, East Lansing, MI, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Michigan State University, East Lansing, MI, USA","institution_ids":["https://openalex.org/I87216513"]},{"raw_affiliation_string":"Department of Electrical & Computer Engineering Michigan State University, East Lansing, MI, USA","institution_ids":["https://openalex.org/I87216513"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.05313496,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"99","issue":null,"first_page":"1537","last_page":"1541"},"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/T10688","display_name":"Image and Signal Denoising Methods","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11447","display_name":"Blind Source Separation Techniques","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/matrix-completion","display_name":"Matrix completion","score":0.7969920039176941},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6635865569114685},{"id":"https://openalex.org/keywords/rank","display_name":"Rank (graph theory)","score":0.630163848400116},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6296176314353943},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.6181944608688354},{"id":"https://openalex.org/keywords/low-rank-approximation","display_name":"Low-rank approximation","score":0.6169795393943787},{"id":"https://openalex.org/keywords/matrix","display_name":"Matrix (chemical analysis)","score":0.5324341654777527},{"id":"https://openalex.org/keywords/iteratively-reweighted-least-squares","display_name":"Iteratively reweighted least squares","score":0.5318289399147034},{"id":"https://openalex.org/keywords/iterative-method","display_name":"Iterative method","score":0.4378986358642578},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4347403943538666},{"id":"https://openalex.org/keywords/variety","display_name":"Variety (cybernetics)","score":0.42455995082855225},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.33200135827064514},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.26205378770828247},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.20258566737174988},{"id":"https://openalex.org/keywords/estimation-theory","display_name":"Estimation theory","score":0.1496899425983429},{"id":"https://openalex.org/keywords/non-linear-least-squares","display_name":"Non-linear least squares","score":0.12548372149467468},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.07560545206069946}],"concepts":[{"id":"https://openalex.org/C2778459887","wikidata":"https://www.wikidata.org/wiki/Q6787865","display_name":"Matrix completion","level":3,"score":0.7969920039176941},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6635865569114685},{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.630163848400116},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6296176314353943},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.6181944608688354},{"id":"https://openalex.org/C90199385","wikidata":"https://www.wikidata.org/wiki/Q6692777","display_name":"Low-rank approximation","level":3,"score":0.6169795393943787},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.5324341654777527},{"id":"https://openalex.org/C126090379","wikidata":"https://www.wikidata.org/wiki/Q6094424","display_name":"Iteratively reweighted least squares","level":4,"score":0.5318289399147034},{"id":"https://openalex.org/C159694833","wikidata":"https://www.wikidata.org/wiki/Q2321565","display_name":"Iterative method","level":2,"score":0.4378986358642578},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4347403943538666},{"id":"https://openalex.org/C136197465","wikidata":"https://www.wikidata.org/wiki/Q1729295","display_name":"Variety (cybernetics)","level":2,"score":0.42455995082855225},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.33200135827064514},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.26205378770828247},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.20258566737174988},{"id":"https://openalex.org/C167928553","wikidata":"https://www.wikidata.org/wiki/Q1376021","display_name":"Estimation theory","level":2,"score":0.1496899425983429},{"id":"https://openalex.org/C45923927","wikidata":"https://www.wikidata.org/wiki/Q3319230","display_name":"Non-linear least squares","level":3,"score":0.12548372149467468},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.07560545206069946},{"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/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C25023664","wikidata":"https://www.wikidata.org/wiki/Q1575637","display_name":"Hankel matrix","level":2,"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/acssc.2014.7094721","is_oa":false,"landing_page_url":"https://doi.org/10.1109/acssc.2014.7094721","pdf_url":null,"source":{"id":"https://openalex.org/S4363608593","display_name":"2014 48th Asilomar Conference on Signals, Systems and Computers","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 48th Asilomar Conference on Signals, Systems and Computers","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W1846534543","https://openalex.org/W1991825408","https://openalex.org/W2011359124","https://openalex.org/W2059283452","https://openalex.org/W2074471762","https://openalex.org/W2078677240","https://openalex.org/W2079128010","https://openalex.org/W2103972604","https://openalex.org/W2119883478","https://openalex.org/W2136912397","https://openalex.org/W2139639076","https://openalex.org/W2157888812","https://openalex.org/W2339666411","https://openalex.org/W2611328865","https://openalex.org/W2616032753","https://openalex.org/W2952066970","https://openalex.org/W3101457173","https://openalex.org/W6648301084","https://openalex.org/W6680391196","https://openalex.org/W6680702173","https://openalex.org/W6683433006","https://openalex.org/W6703697878"],"related_works":["https://openalex.org/W2952489973","https://openalex.org/W4300776969","https://openalex.org/W2106005123","https://openalex.org/W2964108162","https://openalex.org/W2266965707","https://openalex.org/W4387323768","https://openalex.org/W2084983808","https://openalex.org/W2772729003","https://openalex.org/W2938404777","https://openalex.org/W2008328077"],"abstract_inverted_index":{"We":[0],"consider":[1],"using":[2,24,55,65,84],"smooth":[3],"rank":[4],"approximation":[5],"functions":[6],"to":[7,81],"solve":[8],"the":[9,25,31,48],"matrix":[10],"completion":[11],"problem.":[12],"Our":[13],"main":[14],"contribution":[15],"in":[16],"this":[17],"paper":[18],"is":[19],"deriving":[20],"two":[21],"robust":[22],"algorithms":[23,42],"accelerated":[26],"proximal":[27],"gradient":[28],"(APG)":[29],"and":[30,46],"alternating":[32],"direction":[33],"method":[34],"of":[35,58,89],"multipliers":[36],"(ADM).":[37],"Further,":[38],"we":[39],"compare":[40],"both":[41],"against":[43,47],"each":[44],"other":[45],"iterative":[49],"reweighted":[50],"least":[51],"squares":[52],"(IRLS-1)":[53],"algorithm":[54],"a":[56],"variety":[57],"noisy":[59],"images.":[60],"The":[61],"experiments":[62],"show":[63],"that":[64],"ADM":[66],"achieves":[67],"approximately":[68],"1.5":[69],"dB":[70],"SNR":[71,95],"improvement":[72],"over":[73],"irls-1,":[74],"while":[75],"it":[76],"needs":[77],"comparable":[78],"execution":[79],"time":[80,92],"IRLS-1.":[82],"Meanwhile,":[83],"APG":[85],"saves":[86],"about":[87],"50%":[88],"IRLS-1's":[90],"computation":[91],"with":[93],"lower":[94],"than":[96],"ADM.":[97]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}