Multi-stage convex relaxation method for low-rank and sparse matrix separation problem
type: Item
instance of: scholarly article
title: Multi-stage convex relaxation method for low-rank and sparse matrix separation problem
zbMATH Open document ID: 1410.65133
author: Le Han
author: Qin Zhang
published in: Applied Mathematics and Computation
publication date: 2019-03-21T00:00:00Z
Mathematics Subject Classification ID: 65F50
zbMATH DE Number: 7040149
zbMATH Keywords: low-rank and sparse matrix separation
zbMATH Keywords: convex relaxation
zbMATH Keywords: multi-stage
zbMATH Keywords: nonconvex
describes a project that uses: LMaFit
describes a project that uses: RASL
MaRDI profile type: Publication
full work available at URL: j.amc.2016.03.001
OpenAlex ID: W2312387974
cites work: Noisy matrix decomposition via convex relaxation: optimal rates in high dimensions
cites work: A Singular Value Thresholding Algorithm for Matrix Completion
cites work: Robust principal component analysis?
cites work: Rank-Sparsity Incoherence for Matrix Decomposition
cites work: Nonconvex Splitting for Regularized Low-Rank + Sparse Decomposition
cites work: The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent
cites work: Nonlocal Sparse and Low-Rank Regularization for Optical Flow Estimation
cites work: Robust Matrix Decomposition With Sparse Corruptions
cites work: Median filtering‐based methods for static background extraction from surveillance video
cites work: Augmented Lagrangian alternating direction method for matrix separation based on low-rank factorization
cites work: Recovering Low-Rank and Sparse Components of Matrices from Incomplete and Noisy Observations
cites work: Robust PCA via Outlier Pursuit
cites work: TILT: transform invariant low-rank textures
DOI: 10.1016/J.AMC.2016.03.001
description: scientific article; zbMATH DE number 7040149