Low-rank and sparse matrix recovery via inexact Newton-like method with non-monotone search
From MaRDI portal
(Redirected from Publication:2178693)
Recommendations
- Fast alternating minimization method with non-monotone search for low-rank and sparse matrix recovery
- Simultaneously Sparse and Low-Rank Matrix Reconstruction via Nonconvex and Nonseparable Regularization
- Exact low-rank matrix recovery via nonconvex Schatten \(p\)-minimization
- Nonconvex Robust Low-Rank Matrix Recovery
- Recovery of simultaneous low rank and two-way sparse coefficient matrices, a nonconvex approach
- Robust recovery of low-rank matrices with non-orthogonal sparse decomposition from incomplete measurements
- Low-rank matrix recovery via iteratively reweighted least squares minimization
- Convex optimization techniques for the efficient recovery of a sparsely corrupted low-rank matrix
- A truncated Newton algorithm for nonconvex sparse recovery
- Methods for sparse and low-rank recovery under simplex constraints
Cites work
- Accelerated Alternating Projections for Robust Principal Component Analysis
- Convergence analysis of the augmented Lagrange multiplier algorithm for a class of matrix compressive recovery
- Practical matrix completion and corruption recovery using proximal alternating robust subspace minimization
- Robust PCA by manifold optimization
- Robust principal component analysis?
Cited in
(4)- A non-monotone alternating directional method for matrix recovery problem
- Recovery of simultaneous low rank and two-way sparse coefficient matrices, a nonconvex approach
- Fast alternating minimization method with non-monotone search for low-rank and sparse matrix recovery
- Robust recovery of low-rank matrices with non-orthogonal sparse decomposition from incomplete measurements
This page was built for publication: Low-rank and sparse matrix recovery via inexact Newton-like method with non-monotone search
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2178693)
