Please use this identifier to cite or link to this item: https://hdl.handle.net/10356/148502
Title: ADMM algorithms for matrix completion problem in noisy settings
Authors: Le, Tran Kien
Keywords: Science::Mathematics
Issue Date: 2021
Publisher: Nanyang Technological University
Source: Le, T. K. (2021). ADMM algorithms for matrix completion problem in noisy settings. Final Year Project (FYP), Nanyang Technological University, Singapore. https://hdl.handle.net/10356/148502
Abstract: Matrix completion (MC) is a fundamental linear algebra problem to fully recover a low-rank matrix from its incomplete data. It is widely applied in machine learning and statistics, varied from wireless communication, image compression to collaborative filtering. Meanwhile, Alternating Direction Method of Multiplier is a straightforward but effective algorithm for distributed convex optimization. In this work, we will study ADMM in application to matrix completion problem in the noisy setting. Two modified algorithms for noisy matrix completion problem are proposed. Convergence results of these algorithms will be discussed and numerical experiments are conducted to examine the performance of the new algorithms.
URI: https://hdl.handle.net/10356/148502
Fulltext Permission: restricted
Fulltext Availability: With Fulltext
Appears in Collections:SPMS Student Reports (FYP/IA/PA/PI)

Files in This Item:
File Description SizeFormat 
FYP Report_Le Tran Kien.pdf
  Restricted Access
FYP Report655.82 kBAdobe PDFView/Open

Page view(s)

99
Updated on Jan 21, 2022

Download(s)

10
Updated on Jan 21, 2022

Google ScholarTM

Check

Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.