A generalized robust minimization framework for low-rank matrix recovery
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.
- 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
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A Singular Value Thresholding Algorithm for Matrix Completion
- An accelerated proximal gradient algorithm for nuclear norm regularized linear least squares problems
- scientific article; zbMATH DE number 6142618 (Why is no real title available?)
- Proximal splitting methods in signal processing
- Robust PCA and subspace tracking from incomplete observations using \(\ell _0\)-surrogates
- Robust principal component analysis?
- Practical matrix completion and corruption recovery using proximal alternating robust subspace minimization
- Low-rank matrix recovery with composite optimization: good conditioning and rapid convergence
- A unified framework for nonconvex nonsmooth sparse and low-rank decomposition by majorization-minimization algorithm
- Low-rank matrix recovery with Ky Fan 2-\(k\)-norm
- Robust low-rank data matrix approximations
- Proximity point algorithm for low-rank matrix recovery from sparse noise corrupted data
- Scalable robust matrix recovery: Frank-Wolfe meets proximal methods
- A smoothing majorization method for l^2_2-l^p_p matrix minimization
- Exact low-rank matrix completion from sparsely corrupted entries via adaptive outlier pursuit
- Non-convex low-rank matrix recovery with arbitrary outliers via median-truncated gradient descent
- Perturbation analysis of low-rank matrix stable recovery
- An Unbiased Approach to Low Rank Recovery
- Robust Low-Rank Tensor Minimization via a New Tensor Spectral $k$ -Support Norm
- Decomposition into low-rank plus additive matrices for background/foreground separation: a review for a comparative evaluation with a large-scale dataset
- A Fast Majorize–Minimize Algorithm for the Recovery of Sparse and Low-Rank Matrices
- Matrix recovery from nonconvex regularized least absolute deviations
- Max-norm optimization for robust matrix recovery
- 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
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)
