A separable surrogate function method for sparse and low-rank matrices decomposition

DOI10.1080/02331934.2019.1678157zbMath1439.65058OpenAlexW2981152383MaRDI QIDQ5110318

Zisheng Liu, Xuenian Liu, Ji-Cheng Li

Publication date: 18 May 2020

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331934.2019.1678157

zbMATH Keywords

sparse matriximage decompositionrobust principal component analysislow-rank matrix

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Computing methodologies for image processing (68U10) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Numerical methods for low-rank matrix approximation; matrix compression (65F55)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fixed point and Bregman iterative methods for matrix rank minimization
• A variable-penalty alternating directions method for convex optimization
• Some convergence properties of a method of multipliers for linearly constrained monotone variational inequalities
• Latent semantic indexing: A probabilistic analysis
• A new inexact alternating directions method for monotone variational inequalities
• Lower bounds for the low-rank matrix approximation
• Principal component analysis.
• Exact matrix completion via convex optimization
• Recovering Low-Rank and Sparse Components of Matrices from Incomplete and Noisy Observations
• Robust principal component analysis?
• A Singular Value Thresholding Algorithm for Matrix Completion
• Rank-Sparsity Incoherence for Matrix Decomposition
• Alternating Direction Method for Image Inpainting in Wavelet Domains
• Fixed-Point Continuation for $\ell_1$-Minimization: Methodology and Convergence
• Inertial Proximal ADMM for Linearly Constrained Separable Convex Optimization
• Proximal Thresholding Algorithm for Minimization over Orthonormal Bases
• Why Simple Shrinkage Is Still Relevant for Redundant Representations?
• Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
• On the rank minimization problem over a positive semidefinite linear matrix inequality
• Modified subgradient extragradient algorithms for variational inequality problems and fixed point problems
• A class of multilevel structured low-rank approximation arising in material processing
• An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
• A NEW MODEL FOR SPARSE AND LOW-RANK MATRIX DECOMPOSITION

This page was built for publication: A separable surrogate function method for sparse and low-rank matrices decomposition