Low-rank and sparse matrix recovery via inexact Newton-like method with non-monotone search
From MaRDI portal
Publication:2178693
DOI10.1016/J.AML.2020.106357zbMATH Open1503.90101OpenAlexW3015045850MaRDI QIDQ2178693FDOQ2178693
Authors: Chuanlong Wang, Qingqing Sun, Qian-Ying Shen 
Publication date: 11 May 2020
Published in: Applied Mathematics Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.aml.2020.106357
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
- Robust principal component analysis?
- Convergence analysis of the augmented Lagrange multiplier algorithm for a class of matrix compressive recovery
- Accelerated Alternating Projections for Robust Principal Component Analysis
- Practical matrix completion and corruption recovery using proximal alternating robust subspace minimization
- Title not available (Why is that?)
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)
