A generalized robust minimization framework for low-rank matrix recovery

DOI10.1155/2014/656074zbMath1407.90258OpenAlexW2010469867WikidataQ59068696 ScholiaQ59068696MaRDI QIDQ1718892

Qi Ge, Hai-Bo Li, Hai-Song Deng, Wen-Ze Shao, Zong-liang Gan

Publication date: 8 February 2019

Published in: Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2014/656074

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Numerical linear algebra (65Fxx)

Related Items (2)

Decomposition into low-rank plus additive matrices for background/foreground separation: a review for a comparative evaluation with a large-scale dataset ⋮ A unified framework for nonconvex nonsmooth sparse and low-rank decomposition by majorization-minimization algorithm

Uses Software

• UNLocBoX

Cites Work

• Unnamed Item
• Unnamed Item
• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• Robust PCA and subspace tracking from incomplete observations using \(\ell _0\)-surrogates
• Proximal Splitting Methods in Signal Processing
• Robust principal component analysis?
• A Singular Value Thresholding Algorithm for Matrix Completion

This page was built for publication: A generalized robust minimization framework for low-rank matrix recovery