A unified framework for nonconvex nonsmooth sparse and low-rank decomposition by majorization-minimization algorithm
type: Item
instance of: scholarly article
title: A unified framework for nonconvex nonsmooth sparse and low-rank decomposition by majorization-minimization algorithm
zbMATH Open document ID: 1505.65187
author: Qian-Zhen Zheng
author: Ping-Feng Xu
published in: Journal of the Franklin Institute
publication date: 2022-11-09T00:00:00Z
Mathematics Subject Classification ID: 65F55
Mathematics Subject Classification ID: 65F50
Mathematics Subject Classification ID: 65K10
Mathematics Subject Classification ID: 94A08
zbMATH DE Number: 7613840
zbMATH Keywords: low-rank decomposition
zbMATH Keywords: majorization-minimization algorithm
zbMATH Keywords: alternating direction method of multipliers
describes a project that uses: RASL
MaRDI profile type: Publication
full work available at URL: j.jfranklin.2022.09.002
OpenAlex ID: W4295277374
cites work: Robust principal component analysis?
cites work: Handbook of robust low-rank and sparse matrix decomposition. Applications in image and video processing
cites work: Background Subtraction Based on Low-Rank and Structured Sparse Decomposition
cites work: Latent variable graphical model selection via convex optimization
cites work: Rank-Sparsity Incoherence for Matrix Decomposition
cites work: Estimating differential latent variable graphical models with applications to brain connectivity
cites work: Q4908856
cites work: Nonconvex Nonsmooth Low Rank Minimization via Iteratively Reweighted Nuclear Norm
cites work: Nonconvex Splitting for Regularized Low-Rank + Sparse Decomposition
cites work: Nonconvex Regularized Robust PCA Using the Proximal Block Coordinate Descent Algorithm
cites work: Alternating Direction Method of Multipliers for a Class of Nonconvex and Nonsmooth Problems with Applications to Background/Foreground Extraction
cites work: Generalized singular value thresholding operator based nonconvex low-rank and sparse decomposition for moving object detection
cites work: Multiple-prespecified-dictionary sparse representation for compressive sensing image reconstruction with nonconvex regularization
cites work: Nonconvex nonsmooth low-rank minimization for generalized image compressed sensing via group sparse representation
cites work: Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
cites work: Recovering low-rank and sparse matrix based on the truncated nuclear norm
cites work: Weighted nuclear norm minimization and its applications to low level vision
cites work: Weighted Schatten $p$ -Norm Minimization for Image Denoising and Background Subtraction
cites work: Stable recovery of low-rank matrix via nonconvex Schatten \(p\)-minimization
cites work: Accelerated Alternating Projections for Robust Principal Component Analysis
cites work: Best Pair Formulation & Accelerated Scheme for Non-Convex Principal Component Pursuit
cites work: A generalized robust minimization framework for low-rank matrix recovery
cites work: Reduced rank regression via adaptive nuclear norm penalization
cites work: Alternating direction method with self-adaptive penalty parameters for monotone variational inequalities
cites work: Linearized alternating direction method with parallel splitting and adaptive penalty for separable convex programs in machine learning
cites work: Decomposition method with a variable parameter for a class of monotone variational inequality problems
cites work: Understanding Analysis
cites work: Q4067293
cites work: Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
DOI: 10.1016/J.JFRANKLIN.2022.09.002
description: scientific article; zbMATH DE number 7613840