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: | Fangfang Xu, Peng Pan |
|---|---|
| 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!
|
Similar Items
-
A Class of Weighted Low Rank Approximation of the Positive Semidefinite Hankel Matrix
by: Jianchao Bai, et al.
Published: (2015-01-01) -
Singular Value and Matrix Norm Inequalities between Positive Semidefinite Matrices and Their Blocks
by: Feng Zhang, et al.
Published: (2024-01-01) -
Efficient Positive Semidefinite Matrix Approximation by Iterative Optimisations and Gradient Descent Method
by: Vali Asimit, et al.
Published: (2025-02-01) -
GBD and $ \mathcal{L} $-positive semidefinite elements in $ C^* $-algebras
by: Kezheng Zuo, et al.
Published: (2025-03-01) -
A Novel Approach for Solving Semidefinite Programs
by: Hong-Wei Jiao, et al.
Published: (2014-01-01)