A unified framework for nonconvex nonsmooth sparse and low-rank decomposition by majorization-minimization algorithm
Recovering a low-rank matrix and a sparse matrix from an observed matrix, known as sparse and low-rank decomposition (SLRD), is becoming a hot topic in recent years. The most popular model for SLRD is to use the ℓ1 norm and nuclear norm for the sparse and low-rank approximation. Since this convex mo...
Saved in:
| Published in: | Journal of the Franklin Institute Vol. 359; no. 16; pp. 9376 - 9400 |
|---|---|
| Main Authors: | , |
| Format: | Journal Article |
| Language: | English |
| Published: |
Elsevier Ltd
01.11.2022
|
| ISSN: | 0016-0032, 1879-2693 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!