Back to search

University of Waterloo

Fixed Point Iteration Algorithms for Low-rank Matrix Completion

Abstract

dc:description.abstract

A 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. iii

Degree

thesis:*
Grantor dc:publisher
University of Waterloo
Year dc:date.issued
2015

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Huang, Xingliang

Rights

Language dc:language.iso
en

Identifiers

dc:identifier.*
Handle dc:identifier.uri
http://hdl.handle.net/10012/9370

Chain of custody

source
Harvested from
University of Waterloo
Base URL
dspacemainprd01.lib.uwaterloo.ca/server/oai/request
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
related terms
citation

Huang, Xingliang. Fixed Point Iteration Algorithms for Low-rank Matrix Completion. University of Waterloo, 2015. http://hdl.handle.net/10012/9370