ADMM algorithms for matrix completion problem in noisy settings
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 Meth...
Main Author: | Le, Tran Kien |
---|---|
Other Authors: | Chua Chek Beng |
Format: | Final Year Project (FYP) |
Language: | English |
Published: |
Nanyang Technological University
2021
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/148502 |
Similar Items
-
EA-ADMM: noisy tensor PARAFAC decomposition based on element-wise average ADMM
by: Gang Yue, et al.
Published: (2022-10-01) -
Matrix completion from any given set of observations
by: Lee, Troy, et al.
Published: (2014) -
Algorithmic verification problems in automata-theoretic settings
by: Bundala, D
Published: (2014) -
ADMM-plus : Japan in ASEAN defence diplomacy
by: Shoji, Tomotaka
Published: (2021) -
An ADMM-based parallel algorithm for solving traffic assignment problem with elastic demand
by: Kai Zhang, et al.
Published: (2023-12-01)