A generalized robust minimization framework for low-rank matrix recovery
DOI10.1155/2014/656074zbMATH Open1407.90258OpenAlexW2010469867WikidataQ59068696 ScholiaQ59068696MaRDI QIDQ1718892FDOQ1718892
Authors: Wenze Shao, Q. Ge, Haisong Deng, Haibo Li, 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
Recommendations
- Exact low-rank matrix completion from sparsely corrupted entries via adaptive outlier pursuit
- Proximity point algorithm for low-rank matrix recovery from sparse noise corrupted data
- Low-rank matrix recovery with Ky Fan 2-\(k\)-norm
- Proximal iteratively reweighted algorithm for low-rank matrix recovery
- Robust inexact alternating optimization for matrix completion with outliers
Numerical mathematical programming methods (65K05) Convex programming (90C25) Numerical linear algebra (65Fxx)
Cites Work
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Robust principal component analysis?
- A Singular Value Thresholding Algorithm for Matrix Completion
- Proximal splitting methods in signal processing
- An accelerated proximal gradient algorithm for nuclear norm regularized linear least squares problems
- Title not available (Why is that?)
- Robust PCA and subspace tracking from incomplete observations using \(\ell _0\)-surrogates
Cited In (19)
- Matrix recovery from nonconvex regularized least absolute deviations
- A Fast Majorize–Minimize Algorithm for the Recovery of Sparse and Low-Rank Matrices
- Non-convex low-rank matrix recovery with arbitrary outliers via median-truncated gradient descent
- Low-rank matrix recovery with composite optimization: good conditioning and rapid convergence
- Robust Low-Rank Tensor Minimization via a New Tensor Spectral $k$ -Support Norm
- Low-rank matrix recovery with Ky Fan 2-\(k\)-norm
- Scalable robust matrix recovery: Frank-Wolfe meets proximal methods
- Max-norm optimization for robust matrix recovery
- Perturbation analysis of low-rank matrix stable recovery
- Robust low-rank data matrix approximations
- An Unbiased Approach to Low Rank Recovery
- Practical matrix completion and corruption recovery using proximal alternating robust subspace minimization
- A smoothing majorization method for \(l^2_2-l^p_p\) matrix minimization
- Nonconvex nonsmooth low-rank minimization for generalized image compressed sensing via group sparse representation
- New robust principal component analysis for joint image alignment and recovery via affine transformations, Frobenius and \(L_{2,1}\) norms
- Proximity point algorithm for low-rank matrix recovery from sparse noise corrupted data
- Exact low-rank matrix completion from sparsely corrupted entries via adaptive outlier pursuit
- A unified framework for nonconvex nonsmooth sparse and low-rank decomposition by majorization-minimization algorithm
- Decomposition into low-rank plus additive matrices for background/foreground separation: a review for a comparative evaluation with a large-scale dataset
Uses Software
This page was built for publication: A generalized robust minimization framework for low-rank matrix recovery
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1718892)
