A unified framework for nonconvex nonsmooth sparse and low-rank decomposition by majorization-minimization algorithm
DOI10.1016/J.JFRANKLIN.2022.09.002zbMATH Open1505.65187OpenAlexW4295277374MaRDI QIDQ2095019FDOQ2095019
Authors: Qian-Zhen Zheng, Ping-Feng Xu 
Publication date: 9 November 2022
Published in: Journal of the Franklin Institute (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jfranklin.2022.09.002
Recommendations
- A new model for sparse and low-rank matrix decomposition
- scientific article; zbMATH DE number 6142618
- A separable surrogate function method for sparse and low-rank matrices decomposition
- An alternating direction method with continuation for nonconvex low rank minimization
- Nonconvex mixed matrix minimization
alternating direction method of multipliersmajorization-minimization algorithmlow-rank decomposition
Numerical optimization and variational techniques (65K10) Computational methods for sparse matrices (65F50) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Numerical methods for low-rank matrix approximation; matrix compression (65F55)
Cites Work
- Reduced rank regression via adaptive nuclear norm penalization
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- Alternating direction method with self-adaptive penalty parameters for monotone variational inequalities
- Robust principal component analysis?
- Latent variable graphical model selection via convex optimization
- Rank-Sparsity Incoherence for Matrix Decomposition
- Handbook of robust low-rank and sparse matrix decomposition. Applications in image and video processing
- Decomposition method with a variable parameter for a class of monotone variational inequality problems
- Title not available (Why is that?)
- Nonconvex Splitting for Regularized Low-Rank + Sparse Decomposition
- Title not available (Why is that?)
- Stable recovery of low-rank matrix via nonconvex Schatten \(p\)-minimization
- Accelerated Alternating Projections for Robust Principal Component Analysis
- Linearized alternating direction method with parallel splitting and adaptive penalty for separable convex programs in machine learning
- A generalized robust minimization framework for low-rank matrix recovery
- Background Subtraction Based on Low-Rank and Structured Sparse Decomposition
- Weighted Schatten <inline-formula> <tex-math notation="LaTeX">$p$ </tex-math> </inline-formula>-Norm Minimization for Image Denoising and Background Subtraction
- Alternating direction method of multipliers for a class of nonconvex and nonsmooth problems with applications to background/foreground extraction
- Multiple-prespecified-dictionary sparse representation for compressive sensing image reconstruction with nonconvex regularization
- Weighted nuclear norm minimization and its applications to low level vision
- Nonconvex Nonsmooth Low Rank Minimization via Iteratively Reweighted Nuclear Norm
- Nonconvex nonsmooth low-rank minimization for generalized image compressed sensing via group sparse representation
- Estimating differential latent variable graphical models with applications to brain connectivity
- Recovering low-rank and sparse matrix based on the truncated nuclear norm
- Nonconvex Regularized Robust PCA Using the Proximal Block Coordinate Descent Algorithm
- Generalized singular value thresholding operator based nonconvex low-rank and sparse decomposition for moving object detection
- Best Pair Formulation & Accelerated Scheme for Non-Convex Principal Component Pursuit
- Understanding analysis
Cited In (1)
Uses Software
This page was built for publication: A unified framework for nonconvex nonsmooth sparse and low-rank decomposition by majorization-minimization algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2095019)
