<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-11-22T20:51:24Z</responseDate><request verb="GetRecord" identifier="oai:uwspace.uwaterloo.ca:10012/9370" metadataPrefix="dim">https://dspacemainprd01.lib.uwaterloo.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:uwspace.uwaterloo.ca:10012/9370</identifier><datestamp>2017-03-21T14:41:22Z</datestamp><setSpec>com_10012_9924</setSpec><setSpec>com_10012_1</setSpec><setSpec>col_10012_9934</setSpec><setSpec>col_10012_6</setSpec></header><metadata><dim:dim xmlns:dim="http://www.dspace.org/xmlns/dspace/dim" xmlns:doc="http://www.lyncode.com/xoai" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.dspace.org/xmlns/dspace/dim http://www.dspace.org/schema/dim.xsd">
   <dim:field mdschema="dc" element="contributor" qualifier="author" authority="746d54d2-f68c-4003-a4d1-ed8f2bda409e" confidence="600">Huang, Xingliang</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2015-05-20T15:29:45Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2015-05-20T15:29:45Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2015-05-20</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="submitted">2015</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/10012/9370</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en">A lot of applications can be formulated as matrix completion problems. In order to&#xd;
address such problems, a common assumption is that the underlying matrix is (approximately)&#xd;
low-rank. Under certain conditions, the recovery of low-rank matrix can be done&#xd;
via nuclear norm minimization, a convex program.&#xd;
Scalable and fast algorithms are essential as the practical matrix completion tasks always&#xd;
occur on a large scale. Here we study two algorithms and generalize the uni ed&#xd;
framework of  xed point iteration algorithm. We derive the convergence results and propose&#xd;
a new algorithm based on the insights. Compared with the baseline algorithms, our&#xd;
proposed method is signi cantly more e cient without loss of precision and acceleration&#xd;
potentiality.&#xd;
iii</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso" lang="en">en</dim:field>
   <dim:field mdschema="dc" element="publisher" lang="en">University of Waterloo</dim:field>
   <dim:field mdschema="dc" element="title" lang="en">Fixed Point Iteration Algorithms for Low-rank Matrix Completion</dim:field>
   <dim:field mdschema="dc" element="type" lang="en">Master Thesis</dim:field>
   <dim:field mdschema="dc" element="pending">false</dim:field>
   <dim:field mdschema="dc" element="subject" qualifier="program" lang="en">Statistics</dim:field>
   <dim:field mdschema="uws-etd" element="degree" qualifier="department" lang="en">Statistics and Actuarial Science</dim:field>
   <dim:field mdschema="uws-etd" element="degree" lang="en">Master of Mathematics</dim:field>
   <dim:field mdschema="uws" element="typeOfResource" lang="en">Text</dim:field>
   <dim:field mdschema="uws" element="peerReviewStatus" lang="en">Unreviewed</dim:field>
   <dim:field mdschema="uws" element="scholarLevel" lang="en">Graduate</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>