A generalized robust minimization framework for low-rank matrix recovery
type: Item
instance of: scholarly article
title: A generalized robust minimization framework for low-rank matrix recovery
zbMATH Open document ID: 1407.90258
DOI: 10.1155/2014/656074
author: Wenze Shao
author: Q. Ge
author: Haisong Deng
author: Haibo Li
author: Zong-liang Gan
published in: Mathematical Problems in Engineering
publication date: 2019-02-08T00:00:00Z
review text: Summary: 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 \leq 1)\) and \(L_q\)\((0 < q \leq 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.
Mathematics Subject Classification ID: 90C25
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 65Fxx
zbMATH DE Number: 7016963
Wikidata QID: Q59068696
describes a project that uses: UNLocBoX
MaRDI profile type: MaRDI publication profile
full work available at URL: https://doi.org/10.1155/2014/656074
OpenAlex ID: W2010469867
cites work: Robust principal component analysis?
cites work: A Singular Value Thresholding Algorithm for Matrix Completion
cites work: Q4908856
cites work: Proximal Splitting Methods in Signal Processing
cites work: A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
cites work: Q3161693
cites work: Robust PCA and subspace tracking from incomplete observations using \(\ell _0\)-surrogates
description: scientific article; zbMATH DE number 7016963