s-Goodness for Low-Rank Matrix Recovery
Low-rank matrix recovery (LMR) is a rank minimization problem subject to linear equality constraints, and it arises in many fields such as signal and image processing, statistics, computer vision, and system identification and control. This class of optimization problems is generally 𝒩𝒫 hard. A pop...
Saved in:
Main Authors: | Lingchen Kong, Levent Tunçel, Naihua Xiu |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2013-01-01
|
Series: | Abstract and Applied Analysis |
Online Access: | http://dx.doi.org/10.1155/2013/101974 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Restricted p-Isometry Properties of Partially Sparse Signal Recovery
by: Haini Bi, et al.
Published: (2013-01-01) -
A hybrid singular value thresholding algorithm with diagonal-modify for low-rank matrix recovery
by: Ruiping Wen, et al.
Published: (2024-11-01) -
Matrix Ranking: A Tool for Decision-Making and Prioritization
by: Keegan Gay, et al.
Published: (2016-10-01) -
Matrix Ranking: A Tool for Decision-Making and Prioritization
by: Keegan Gay, et al.
Published: (2016-10-01) -
Upper and Lower Bounds for Ranks of the Matrix Expression X-XAX
by: Zhiping Xiong
Published: (2013-01-01)