A New Algorithm for Positive Semidefinite Matrix Completion
Positive semidefinite matrix completion (PSDMC) aims to recover positive semidefinite and low-rank matrices from a subset of entries of a matrix. It is widely applicable in many fields, such as statistic analysis and system control. This task can be conducted by solving the nuclear norm regularized...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2016-01-01
|
| Series: | Journal of Applied Mathematics |
| Online Access: | http://dx.doi.org/10.1155/2016/1659019 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1849695523124019200 |
|---|---|
| author | Fangfang Xu Peng Pan |
| author_facet | Fangfang Xu Peng Pan |
| author_sort | Fangfang Xu |
| collection | DOAJ |
| description | Positive semidefinite matrix completion (PSDMC) aims to recover positive semidefinite and low-rank matrices from a subset of entries of a matrix. It is widely applicable in many fields, such as statistic analysis and system control. This task can be conducted by solving the nuclear norm regularized linear least squares model with positive semidefinite constraints. We apply the widely used alternating direction method of multipliers to solve the model and get a novel algorithm. The applicability and efficiency of the new algorithm are demonstrated in numerical experiments. Recovery results show that our algorithm is helpful. |
| format | Article |
| id | doaj-art-d027353650bb41ecb6f076752c12a2b9 |
| institution | DOAJ |
| issn | 1110-757X 1687-0042 |
| language | English |
| publishDate | 2016-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | Journal of Applied Mathematics |
| spelling | doaj-art-d027353650bb41ecb6f076752c12a2b92025-08-20T03:19:45ZengWileyJournal of Applied Mathematics1110-757X1687-00422016-01-01201610.1155/2016/16590191659019A New Algorithm for Positive Semidefinite Matrix CompletionFangfang Xu0Peng Pan1College of Mathematics and Systems Science, Shandong University of Science and Technology, Qingdao 266590, ChinaCollege of Mathematics and Systems Science, Shandong University of Science and Technology, Qingdao 266590, ChinaPositive semidefinite matrix completion (PSDMC) aims to recover positive semidefinite and low-rank matrices from a subset of entries of a matrix. It is widely applicable in many fields, such as statistic analysis and system control. This task can be conducted by solving the nuclear norm regularized linear least squares model with positive semidefinite constraints. We apply the widely used alternating direction method of multipliers to solve the model and get a novel algorithm. The applicability and efficiency of the new algorithm are demonstrated in numerical experiments. Recovery results show that our algorithm is helpful.http://dx.doi.org/10.1155/2016/1659019 |
| spellingShingle | Fangfang Xu Peng Pan A New Algorithm for Positive Semidefinite Matrix Completion Journal of Applied Mathematics |
| title | A New Algorithm for Positive Semidefinite Matrix Completion |
| title_full | A New Algorithm for Positive Semidefinite Matrix Completion |
| title_fullStr | A New Algorithm for Positive Semidefinite Matrix Completion |
| title_full_unstemmed | A New Algorithm for Positive Semidefinite Matrix Completion |
| title_short | A New Algorithm for Positive Semidefinite Matrix Completion |
| title_sort | new algorithm for positive semidefinite matrix completion |
| url | http://dx.doi.org/10.1155/2016/1659019 |
| work_keys_str_mv | AT fangfangxu anewalgorithmforpositivesemidefinitematrixcompletion AT pengpan anewalgorithmforpositivesemidefinitematrixcompletion AT fangfangxu newalgorithmforpositivesemidefinitematrixcompletion AT pengpan newalgorithmforpositivesemidefinitematrixcompletion |