{"id":"https://openalex.org/W2183955868","doi":null,"title":"Anefficientthresholding Algorithm for Matrix Completion","display_name":"Anefficientthresholding Algorithm for Matrix Completion","publication_year":2012,"publication_date":"2012-01-01","ids":{"openalex":"https://openalex.org/W2183955868","mag":"2183955868"},"language":"en","primary_location":{"id":"mag:2183955868","doi":null,"is_oa":false,"landing_page_url":"http://www.idosi.org/mejsr/mejsr12(12)12/52.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},"volume":null,"type":"article","is_traditional":true,"indexed_in":[],"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/A5046313074","display_name":"E. Fathima","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"E. Fathima","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5046313074"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"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.9994999766349792,"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"}},"topics":[{"id":"https://openalex.org/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9994999766349792,"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"}},{"id":"https://openalex.org/T10792","display_name":"Matrix Theory and Algorithms","score":0.0,"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"}},{"id":"https://openalex.org/T10688","display_name":"Image and Signal Denoising Methods","score":0.0,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/matrix-completion","display_name":"matrix completion","score":0.8309999704360962},{"id":"https://openalex.org/keywords/nuclear-norm-minimization","display_name":"nuclear norm minimization","score":0.9350000023841858},{"id":"https://openalex.org/keywords/low-rank-matrix-recovery","display_name":"low-rank matrix recovery","score":0.7630000114440918},{"id":"https://openalex.org/keywords/soft-thresholding","display_name":"soft thresholding","score":0.8100000023841858},{"id":"https://openalex.org/keywords/first-order-algorithms","display_name":"first-order algorithms","score":0.5929999947547913},{"id":"https://openalex.org/keywords/convex-relaxation","display_name":"convex relaxation","score":0.5440000295639038},{"id":"https://openalex.org/keywords/rank-minimization","display_name":"rank minimization","score":0.8519999980926514},{"id":"https://openalex.org/keywords/sparse-matrices","display_name":"sparse matrices","score":0.5590000152587891},{"id":"https://openalex.org/keywords/convergence-analysis","display_name":"convergence analysis","score":0.7929999828338623},{"id":"https://openalex.org/keywords/linearized-bregman-iteration","display_name":"linearized Bregman iteration","score":0.9679999947547913},{"id":"https://openalex.org/keywords/lagrange-multiplier-method","display_name":"Lagrange multipliers","score":0.7649999856948853},{"id":"https://openalex.org/keywords/large-scale-optimization","display_name":"large-scale optimization","score":0.5929999947547913}],"concepts":[{"id":"https://openalex.org/C2778459887","wikidata":"https://www.wikidata.org/wiki/Q6787865","display_name":"Matrix completion","level":3,"score":0.7164033055305481},{"id":"https://openalex.org/C140479938","wikidata":"https://www.wikidata.org/wiki/Q5254619","display_name":"Iterated function","level":2,"score":0.6588345766067505},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6105087995529175},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.5822113156318665},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.5139607787132263},{"id":"https://openalex.org/C92207270","wikidata":"https://www.wikidata.org/wiki/Q939253","display_name":"Matrix norm","level":3,"score":0.47488588094711304},{"id":"https://openalex.org/C90199385","wikidata":"https://www.wikidata.org/wiki/Q6692777","display_name":"Low-rank approximation","level":3,"score":0.47359636425971985},{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.45718619227409363},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4552629292011261},{"id":"https://openalex.org/C56372850","wikidata":"https://www.wikidata.org/wiki/Q1050404","display_name":"Sparse matrix","level":3,"score":0.4382552206516266},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.43121176958084106},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4297703206539154},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.41126465797424316},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2023809850215912},{"id":"https://openalex.org/C158693339","wikidata":"https://www.wikidata.org/wiki/Q190524","display_name":"Eigenvalues and eigenvectors","level":2,"score":0.10099431872367859},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"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/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0},{"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/C25023664","wikidata":"https://www.wikidata.org/wiki/Q1575637","display_name":"Hankel matrix","level":2,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:2183955868","doi":null,"is_oa":false,"landing_page_url":"http://www.idosi.org/mejsr/mejsr12(12)12/52.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":3,"referenced_works":["https://openalex.org/W33155704","https://openalex.org/W1639316992","https://openalex.org/W2971185342"],"related_works":["https://openalex.org/W2103972604","https://openalex.org/W2169616092","https://openalex.org/W7096403046","https://openalex.org/W1588962181","https://openalex.org/W2146130798","https://openalex.org/W1969698720","https://openalex.org/W2964010532","https://openalex.org/W1811617830","https://openalex.org/W2136912397","https://openalex.org/W4313583154"],"abstract_inverted_index":{"This":[0,23,87],"paper":[1,88],"introduces":[2],"a":[3,18,33,49,53,83,90,118,164,208,238,241,267,295],"novel":[4],"algorithm":[5,95,113,184],"to":[6,75,163,185,253],"approximate":[7],"the":[8,29,45,106,134,138,167,171,174,183,195,203,213,219,283],"matrix":[9,51,139,152],"with":[10,81,265,282],"minimum":[11],"nuclear":[12],"norm":[13],"among":[14],"all":[15],"matrices":[16,121,232,260],"obeying":[17],"set":[19],"of":[20,32,47,56,78,120,137,173,188,198,215,261,274,306],"convex":[21,30],"constraints.":[22],"problem":[24,36],"may":[25],"be":[26],"understood":[27],"as":[28,43,67],"relaxation":[31],"rank":[34,172,262],"minimization":[35],"and":[37,93,116,125,193,292],"arises":[38],"in":[39,44,104,226,235,297,304],"many":[40],"important":[41],"applications":[42],"task":[46],"recovering":[48,259],"large":[50,76,255],"from":[52,270],"small":[54],"subset":[55],"its":[57],"entries":[58],"(the":[59],"famous":[60],"Net":[61],"ix":[62],"problem).":[63],"O-the-shelf":[64],"algorithms":[65,303],"such":[66],"interior":[68],"point":[69],"methods":[70,279],"are":[71,143,233,280],"not":[72],"directly":[73],"amenable":[74,252],"problems":[77,103,257],"this":[79,148],"kind":[80],"over":[82],"million":[84],"unknown":[85],"entries.":[86,277],"develops":[89],"simple":[91],"rst-order":[92],"easy-to-implement":[94],"that":[96,158,170,212,248],"is":[97,114,157,161,169,176,251],"extremely":[98],"e":[99],"cient":[100],"at":[101,126],"addressing":[102],"which":[105,227,298],"optimal":[107],"solution":[108],"has":[109],"low":[110],"rank.":[111],"The":[112,155],"iterative":[115],"produces":[117],"sequence":[119,214],"fXk;":[122],"Y":[123,140],"kg":[124],"each":[127,199],"step,":[128],"mainly":[129],"performs":[130],"asoft-thresholding":[131],"operation":[132,160],"on":[133,240,286],"singular":[135],"values":[136],"k.":[141],"There":[142],"two":[144],"remarkable":[145],"features":[146],"making":[147],"attractive":[149],"for":[150,290],"low-rank":[151],"completion":[153],"problems.":[154],"rst":[156],"thesoft-thresholding":[159],"applied":[162],"sparse":[165],"matrix;":[166],"second":[168],"iteratesfXkg":[175],"empirically":[177],"nondecreasing.":[178],"Both":[179],"these":[180,302],"facts":[181],"allow":[182],"make":[186],"use":[187],"very":[189,254],"minimal":[190],"storage":[191],"space":[192],"keep":[194],"computational":[196],"cost":[197],"iteration":[200],"low.":[201],"On":[202,218],"theoretical":[204],"side,":[205,221],"we":[206,222,293],"provide":[207,223],"convergence":[209],"analysis":[210],"showing":[211],"iterates":[216],"converges.":[217],"practical":[220],"numerical":[224],"examples":[225],"1;":[228,230],"000":[229,231],"recovered":[234],"less":[236],"than":[237],"minute":[239],"modest":[242],"desktop":[243],"computer.":[244],"We":[245],"also":[246],"demonstrate":[247],"our":[249],"approach":[250],"scale":[256],"by":[258],"about":[263,272],"10":[264],"nearly":[266],"billion":[268],"unknowns":[269],"just":[271],"0.4%":[273],"their":[275],"sampled":[276],"Our":[278],"connected":[281],"recent":[284],"literature":[285],"linearized":[287],"Bregman":[288],"iterations":[289],"`1minimization":[291],"develop":[294],"framework":[296],"one":[299],"can":[300],"understand":[301],"terms":[305],"well-known":[307],"Lagrange":[308],"multiplier":[309],"algorithms.":[310]},"counts_by_year":[],"updated_date":"2025-11-06T04:12:42.849631","created_date":"2016-06-24T00:00:00"}