Please use this identifier to cite or link to this item: https://oa.tib.eu/renate/handle/123456789/3424
Full metadata record
DC FieldValueLanguage
dc.rights.licenseCC BY-SA 3.0 USeng
dc.contributor.authorKirály, Franz J.
dc.contributor.authorTheran, Louis
dc.date.available2019-06-28T08:24:53Z
dc.date.issued2013
dc.identifier.urihttps://doi.org/10.34657/2792-
dc.identifier.urihttps://oa.tib.eu/renate/handle/123456789/3424
dc.description.abstractWe propose a general framework for reconstructing and denoising single entries of incomplete and noisy entries. We describe: effective algorithms for deciding if and entry can be reconstructed and, if so, for reconstructing and denoising it; and a priori bounds on the error of each entry, individually. In the noiseless case our algorithm is exact. For rank-one matrices, the new algorithm is fast, admits a highly-parallel implementation, and produces an error minimizing estimate that is qualitatively close to our theoretical and the state-of-the-art Nuclear Norm and OptSpace methods.eng
dc.formatapplication/pdf
dc.language.isoengeng
dc.publisherOberwolfach : Mathematisches Forschungsinstitut Oberwolfacheng
dc.relation.ispartofseriesOberwolfach Preprints (OWP), Volume 2013-12, ISSN 1864-7596eng
dc.rights.urihttps://creativecommons.org/licenses/by-sa/3.0/us/eng
dc.subject.ddc510eng
dc.titleObtaining error-minimizing estimates and universal entry-wise error bounds for low-rank matrix completioneng
dc.typereporteng
dc.typeTexteng
dc.description.versionpublishedVersioneng
wgl.contributorMFOeng
wgl.subjectMathematikeng
wgl.typeReport / Forschungsbericht / Arbeitspapiereng
dc.relation.doihttps://doi.org/10.14760/OWP-2013-12
dcterms.bibliographicCitation.journalTitleOberwolfach Preprints (OWP)eng
tib.accessRightsopenAccesseng
Appears in Collections:Mathematik

Files in This Item:
File SizeFormat 
OWP2013_12.pdf353,39 kBAdobe PDFView/Open
Show simple item record
Király, Franz J. and Louis Theran, 2013. Obtaining error-minimizing estimates and universal entry-wise error bounds for low-rank matrix completion. Oberwolfach : Mathematisches Forschungsinstitut Oberwolfach
Király, F. J. and Theran, L. (2013) Obtaining error-minimizing estimates and universal entry-wise error bounds for low-rank matrix completion. Oberwolfach : Mathematisches Forschungsinstitut Oberwolfach. doi: https://doi.org/10.14760/OWP-2013-12.
Király F J, Theran L. Obtaining error-minimizing estimates and universal entry-wise error bounds for low-rank matrix completion. Oberwolfach : Mathematisches Forschungsinstitut Oberwolfach; 2013.
Király, F. J., & Theran, L. (2013). Obtaining error-minimizing estimates and universal entry-wise error bounds for low-rank matrix completion (Version publishedVersion). Oberwolfach : Mathematisches Forschungsinstitut Oberwolfach. https://doi.org/https://doi.org/10.14760/OWP-2013-12
Király F J, Theran L. Obtaining error-minimizing estimates and universal entry-wise error bounds for low-rank matrix completion. Oberwolfach : Mathematisches Forschungsinstitut Oberwolfach; 2013. doi:https://doi.org/10.14760/OWP-2013-12


This item is licensed under a Creative Commons License Creative Commons