Show simple item record

dc.contributor.authorHuang, Xingliang 15:29:45 (GMT) 15:29:45 (GMT)
dc.description.abstractA lot of applications can be formulated as matrix completion problems. In order to address such problems, a common assumption is that the underlying matrix is (approximately) low-rank. Under certain conditions, the recovery of low-rank matrix can be done via nuclear norm minimization, a convex program. Scalable and fast algorithms are essential as the practical matrix completion tasks always occur on a large scale. Here we study two algorithms and generalize the uni ed framework of xed point iteration algorithm. We derive the convergence results and propose a new algorithm based on the insights. Compared with the baseline algorithms, our proposed method is signi cantly more e cient without loss of precision and acceleration potentiality. iiien
dc.publisherUniversity of Waterlooen
dc.titleFixed Point Iteration Algorithms for Low-rank Matrix Completionen
dc.typeMaster Thesisen
dc.subject.programStatisticsen and Actuarial Scienceen
uws-etd.degreeMaster of Mathematicsen

Files in this item


This item appears in the following Collection(s)

Show simple item record


University of Waterloo Library
200 University Avenue West
Waterloo, Ontario, Canada N2L 3G1
519 888 4883

All items in UWSpace are protected by copyright, with all rights reserved.

DSpace software

Service outages