{"id":"https://openalex.org/W44070586","doi":"https://doi.org/10.17077/etd.yyee2x4v","title":"A fast algorithm for general matrix factorization","display_name":"A fast algorithm for general matrix factorization","publication_year":2013,"publication_date":"2013-12-01","ids":{"openalex":"https://openalex.org/W44070586","doi":"https://doi.org/10.17077/etd.yyee2x4v","mag":"44070586"},"language":"en","primary_location":{"id":"doi:10.17077/etd.yyee2x4v","doi":"https://doi.org/10.17077/etd.yyee2x4v","is_oa":false,"landing_page_url":"https://doi.org/10.17077/etd.yyee2x4v","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"University of Iowa","raw_type":"dissertation"},"volume":null,"type":"dissertation","is_traditional":true,"indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://iro.uiowa.edu/view/delivery/01IOWA_INST/12730516190002771/13730805510002771","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5101875142","display_name":"Xuan Zhou","orcid":"https://orcid.org/0000-0003-4737-3851","observed_orcids":["https://orcid.org/0000-0003-4737-3851"]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Xuan Zhou","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5101875142"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":null,"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.9276999831199646,"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.9276999831199646,"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/T10688","display_name":"Image and Signal Denoising Methods","score":0.06939999759197235,"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/T12303","display_name":"Tensor decomposition and applications","score":0.0003000000142492354,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/matrix-factorization","display_name":"matrix factorization","score":0.953000009059906},{"id":"https://openalex.org/keywords/dictionary-learning","display_name":"dictionary learning","score":0.9919999837875366},{"id":"https://openalex.org/keywords/augmented-lagrangian-method","display_name":"augmented Lagrangian method","score":0.9200000166893005},{"id":"https://openalex.org/keywords/alternating-optimization","display_name":"alternating optimization","score":0.9900000095367432}],"concepts":[{"id":"https://openalex.org/C114466953","wikidata":"https://www.wikidata.org/wiki/Q6034165","display_name":"Initialization","level":2,"score":0.7356557250022888},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7252485752105713},{"id":"https://openalex.org/C42355184","wikidata":"https://www.wikidata.org/wiki/Q1361088","display_name":"Matrix decomposition","level":3,"score":0.6125568151473999},{"id":"https://openalex.org/C150452318","wikidata":"https://www.wikidata.org/wiki/Q4820432","display_name":"Augmented Lagrangian method","level":2,"score":0.6048441529273987},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.557531476020813},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.5365187525749207},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5364343523979187},{"id":"https://openalex.org/C187834632","wikidata":"https://www.wikidata.org/wiki/Q188804","display_name":"Factorization","level":2,"score":0.49003326892852783},{"id":"https://openalex.org/C2988886741","wikidata":"https://www.wikidata.org/wiki/Q25304494","display_name":"Dictionary learning","level":3,"score":0.47986477613449097},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.47351670265197754},{"id":"https://openalex.org/C56372850","wikidata":"https://www.wikidata.org/wiki/Q1050404","display_name":"Sparse matrix","level":3,"score":0.46760740876197815},{"id":"https://openalex.org/C177769412","wikidata":"https://www.wikidata.org/wiki/Q278090","display_name":"Prior probability","level":3,"score":0.4491250514984131},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.4433702230453491},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.4004354178905487},{"id":"https://openalex.org/C124066611","wikidata":"https://www.wikidata.org/wiki/Q28684319","display_name":"Sparse approximation","level":2,"score":0.26884639263153076},{"id":"https://openalex.org/C107673813","wikidata":"https://www.wikidata.org/wiki/Q812534","display_name":"Bayesian probability","level":2,"score":0.10115846991539001},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.07928109169006348},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C158693339","wikidata":"https://www.wikidata.org/wiki/Q190524","display_name":"Eigenvalues and eigenvectors","level":2,"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/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","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/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","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}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.17077/etd.yyee2x4v","doi":"https://doi.org/10.17077/etd.yyee2x4v","is_oa":false,"landing_page_url":"https://doi.org/10.17077/etd.yyee2x4v","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"University of Iowa","raw_type":"dissertation"},{"id":"pmh:oai:alma.01IOWA_INST:11730516200002771","doi":null,"is_oa":true,"landing_page_url":"https://iro.uiowa.edu/esploro/outputs/graduate/A-fast-algorithm-for-general-matrix/9983776785802771","pdf_url":"https://iro.uiowa.edu/view/delivery/01IOWA_INST/12730516190002771/13730805510002771","source":{"id":"https://openalex.org/S4306401239","display_name":"Iowa Research Online (The University of Iowa)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I126307644","host_organization_name":"University of Iowa","host_organization_lineage":["https://openalex.org/I126307644"],"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":"Masters Thesis"},{"id":"pmh:oai:ir.uiowa.edu:etd-4982","doi":null,"is_oa":false,"landing_page_url":"https://ir.uiowa.edu/etd/4982","pdf_url":null,"source":{"id":"https://openalex.org/S4306401239","display_name":"Iowa Research Online (The University of Iowa)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I126307644","host_organization_name":"University of Iowa","host_organization_lineage":["https://openalex.org/I126307644"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Theses and Dissertations","raw_type":"thesis"}],"best_oa_location":{"id":"pmh:oai:alma.01IOWA_INST:11730516200002771","doi":null,"is_oa":true,"landing_page_url":"https://iro.uiowa.edu/esploro/outputs/graduate/A-fast-algorithm-for-general-matrix/9983776785802771","pdf_url":"https://iro.uiowa.edu/view/delivery/01IOWA_INST/12730516190002771/13730805510002771","source":{"id":"https://openalex.org/S4306401239","display_name":"Iowa Research Online (The University of Iowa)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I126307644","host_organization_name":"University of Iowa","host_organization_lineage":["https://openalex.org/I126307644"],"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":"Masters Thesis"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W44070586.pdf","grobid_xml":"https://content.openalex.org/works/W44070586.grobid-xml"},"referenced_works_count":21,"referenced_works":["https://openalex.org/W88153722","https://openalex.org/W1902027874","https://openalex.org/W1975900269","https://openalex.org/W1999844561","https://openalex.org/W2013029404","https://openalex.org/W2029137712","https://openalex.org/W2044809283","https://openalex.org/W2057624533","https://openalex.org/W2061659108","https://openalex.org/W2083057505","https://openalex.org/W2110096996","https://openalex.org/W2113606819","https://openalex.org/W2115429828","https://openalex.org/W2123649031","https://openalex.org/W2126534699","https://openalex.org/W2135029798","https://openalex.org/W2153663612","https://openalex.org/W2160547390","https://openalex.org/W2165685007","https://openalex.org/W3099514962","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2083493778","https://openalex.org/W2890865623","https://openalex.org/W1570348087","https://openalex.org/W4396913846","https://openalex.org/W2979666730","https://openalex.org/W7100163537","https://openalex.org/W2587804232","https://openalex.org/W1495414344","https://openalex.org/W7096754838","https://openalex.org/W7098324565"],"abstract_inverted_index":{"Matrix":[0],"factorization":[1,52],"algorithms":[2],"are":[3],"emerging":[4],"as":[5],"popular":[6],"tools":[7],"in":[8,112],"many":[9],"applications,":[10],"especially":[11],"dictionary":[12,29,68],"learning":[13,30,69,99],"method":[14],"for":[15],"recovering":[16],"biomedical":[17],"image":[18],"data":[19,43,107],"from":[20,41],"noisy":[21],"and":[22,44,108,148],"ill-conditioned":[23],"measurements.":[24],"We":[25,101],"introduce":[26],"a":[27,122],"novel":[28],"algorithm":[31,82,104,135],"based":[32],"on":[33,87],"augmented":[34],"Lagrangian":[35],"(AL)":[36],"approach":[37],"to":[38,49,55,65,93,138,152],"learn":[39],"dictionaries":[40,141],"exemplar":[42],"it":[45],"can":[46,76,83],"be":[47,77],"extended":[48],"general":[50],"matrix":[51],"problems":[53],"due":[54],"different":[56],"constraints.":[57],"Specically,":[58],"we":[59,130],"use":[60],"the":[61,67,88,98,103,113,133,140],"alternating":[62],"minimization":[63],"strategy":[64],"decouple":[66],"scheme":[70],"into":[71,97],"three":[72],"main":[73],"subproblems,":[74],"which":[75,90],"solved":[78],"efficiently.":[79],"The":[80],"proposed":[81,134],"accommodate":[84],"arbitrary":[85],"priors":[86],"dictionary,":[89],"enables":[91],"us":[92],"inject":[94],"prior":[95],"information":[96],"process.":[100],"validate":[102],"using":[105],"simulated":[106],"demonstrate":[109],"its":[110],"utility":[111],"context":[114],"of":[115],"denoising.":[116],"Comparisons":[117],"with":[118],"existing":[119],"methods":[120],"show":[121],"considerable":[123],"speedup":[124],"over":[125],"other":[126],"methods.":[127],"More":[128],"importantly,":[129],"observe":[131],"that":[132],"is":[136,149],"able":[137],"recover":[139],"correctly,":[142],"even":[143],"at":[144],"high":[145],"sparsity":[146],"levels":[147],"relatively":[150],"insensitive":[151],"initialization.":[153]},"counts_by_year":[],"updated_date":"2026-10-29T09:56:32.521200","created_date":"2016-06-24T00:00:00"}