Simultaneously Sparse and Low-Rank Matrix Reconstruction via Nonconvex and Nonseparable Regularization

DOI10.1109/TSP.2018.2867995MaRDI QIDQ4622409zbMATH OpenOpenAlexWikidataFDO

Authors Wei Chen

Publication date 12 February 2019

Published in IEEE Transactions on Signal Processing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tsp.2018.2867995

Mathematics Subject Classification ID

Matrix completion problems (15A83) Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Applications of mathematical programming (90C90)

Cited in

(9)

• Low-rank and sparse matrix recovery via inexact Newton-like method with non-monotone search
• Low-rank and joint-sparse signal recovery using sparse Bayesian learning in a WBAN
• Rate Optimal Denoising of Simultaneously Sparse and Low Rank Matrices
• scientific article; zbMATH DE number 7403729 (Why is no real title available?)
• A Fast Majorize–Minimize Algorithm for the Recovery of Sparse and Low-Rank Matrices
• LOW-RANK AND SPARSE MATRIX RECOVERY FROM NOISY OBSERVATIONS VIA 3-BLOCK ADMM ALGORITHM
• Beyond symmetry: best submatrix selection for the sparse truncated SVD
• An efficient asymptotic DC method for sparse and low-rank matrix recovery
• An augmented Lagrangian method with exact multipliers for non-separable composite \ell₀-\ell₂ regularization

This page was built for publication: Simultaneously Sparse and Low-Rank Matrix Reconstruction via Nonconvex and Nonseparable Regularization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4622409)