Change search
ReferencesLink to record
Permanent link

Direct link
A Generalized Robust Minimization Framework for Low-Rank Matrix Recovery
Show others and affiliations
2014 (English)In: Mathematical problems in engineering (Print), ISSN 1024-123X, E-ISSN 1563-5147, 656074- p.Article in journal (Refereed) Published
Abstract [en]

This paper considers the problem of recovering low-rank matrices which are heavily corrupted by outliers or large errors. To improve the robustness of existing recovery methods, the problem is solved by formulating it as a generalized nonsmooth nonconvex minimization functional via exploiting the Schatten p-norm (0 < p <= 1) and L-q(0 <q <= 1) seminorm. Two numerical algorithms are provided based on the augmented Lagrange multiplier (ALM) and accelerated proximal gradient (APG) methods as well as efficient root-finder strategies. Experimental results demonstrate that the proposed generalized approach is more inclusive and effective compared with state-of-the-art methods, either convex or nonconvex.

Place, publisher, year, edition, pages
2014. 656074- p.
Keyword [en]
Thresholding Algorithm
National Category
Other Mathematics
URN: urn:nbn:se:kth:diva-146584DOI: 10.1155/2014/656074ISI: 000336137200001ScopusID: 2-s2.0-84901775196OAI: diva2:724662

QC 20150701

Available from: 2014-06-13 Created: 2014-06-12 Last updated: 2015-07-01Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Search in DiVA

By author/editor
Li, Haibo
By organisation
Media Technology and Interaction Design, MID
In the same journal
Mathematical problems in engineering (Print)
Other Mathematics

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 30 hits
ReferencesLink to record
Permanent link

Direct link