Show simple item record

dc.contributor.authorKirály, Franz J.
dc.contributor.authorTheran, Louis
dc.date.accessioned2016-09-22T10:46:38Z
dc.date.available2016-09-22T10:46:38Z
dc.date.issued2013-06-10
dc.identifier.urihttp://publications.mfo.de/handle/mfo/196
dc.descriptionOWLF 2013en_US
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.en_US
dc.language.isoenen_US
dc.publisherMathematisches Forschungsinstitut Oberwolfachen_US
dc.relation.ispartofseriesOberwolfach Preprints;2013,12
dc.titleObtaining Error-Minimizing Estimates and Universal Entry-Wise Error Bounds for Low-Rank Matrix Completionen_US
dc.typePreprinten_US
dc.identifier.doi10.14760/OWP-2013-12
local.scientificprogramOWLF 2013
local.series.idOWP-2013-12


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record