A unified framework for nonconvex nonsmooth sparse and low-rank decomposition by majorization-minimization algorithm
From MaRDI portal
Publication:2095019
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
Cites work
- scientific article; zbMATH DE number 3484309 (Why is no real title available?)
- scientific article; zbMATH DE number 6142618 (Why is no real title available?)
- A generalized robust minimization framework for low-rank matrix recovery
- Accelerated Alternating Projections for Robust Principal Component Analysis
- Alternating direction method of multipliers for a class of nonconvex and nonsmooth problems with applications to background/foreground extraction
- Alternating direction method with self-adaptive penalty parameters for monotone variational inequalities
- Background Subtraction Based on Low-Rank and Structured Sparse Decomposition
- Best Pair Formulation & Accelerated Scheme for Non-Convex Principal Component Pursuit
- Decomposition method with a variable parameter for a class of monotone variational inequality problems
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- Estimating differential latent variable graphical models with applications to brain connectivity
- Generalized singular value thresholding operator based nonconvex low-rank and sparse decomposition for moving object detection
- Handbook of robust low-rank and sparse matrix decomposition. Applications in image and video processing
- Latent variable graphical model selection via convex optimization
- Linearized alternating direction method with parallel splitting and adaptive penalty for separable convex programs in machine learning
- Multiple-prespecified-dictionary sparse representation for compressive sensing image reconstruction with nonconvex regularization
- Nonconvex Nonsmooth Low Rank Minimization via Iteratively Reweighted Nuclear Norm
- Nonconvex Regularized Robust PCA Using the Proximal Block Coordinate Descent Algorithm
- Nonconvex Splitting for Regularized Low-Rank + Sparse Decomposition
- Nonconvex nonsmooth low-rank minimization for generalized image compressed sensing via group sparse representation
- Rank-Sparsity Incoherence for Matrix Decomposition
- Recovering low-rank and sparse matrix based on the truncated nuclear norm
- Reduced rank regression via adaptive nuclear norm penalization
- Robust principal component analysis?
- Stable recovery of low-rank matrix via nonconvex Schatten \(p\)-minimization
- Understanding analysis
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
- Weighted Schatten <inline-formula> <tex-math notation="LaTeX">$p$ </tex-math> </inline-formula>-Norm Minimization for Image Denoising and Background Subtraction
- Weighted nuclear norm minimization and its applications to low level vision
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)
