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...
Saved in:
| 主要作者: | |
|---|---|
| 其他作者: | |
| 格式: | Final Year Project |
| 語言: | English |
| 出版: |
Nanyang Technological University
2021
|
| 主題: | |
| 在線閱讀: | https://hdl.handle.net/10356/148502 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
| 總結: | 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. |
|---|