A new model for sparse and low-rank matrix decomposition
DOI10.11948/2017037zbMATH Open1488.65103OpenAlexW2595682877MaRDI QIDQ5149591FDOQ5149591
Jianchao Bai, Jicheng Li, Zisheng Liu, Xuenian Liu, Guo Li
Publication date: 11 February 2021
Published in: Journal of Applied Analysis & Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.11948/2017037
Recommendations
- Robust PCA using nonconvex rank approximation and sparse regularizer
- scientific article
- A novel robust principal component analysis algorithm of nonconvex rank approximation
- Robust principal component pursuit via inexact alternating minimization on matrix manifolds
- Robust principal component analysis using facial reduction
Factor analysis and principal components; correspondence analysis (62H25) Numerical mathematical programming methods (65K05) Computational methods for sparse matrices (65F50) Nonconvex programming, global optimization (90C26) Numerical methods for low-rank matrix approximation; matrix compression (65F55)
Cites Work
- Principal component analysis.
- Robust principal component analysis?
- A Singular Value Thresholding Algorithm for Matrix Completion
- Exact matrix completion via convex optimization
- Latent semantic indexing: A probabilistic analysis
- Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
- Semidefinite Programming
- Rank-Sparsity Incoherence for Matrix Decomposition
- A proximal-based deomposition method for compositions method for convex minimization problems
- Title not available (Why is that?)
- Fixed point and Bregman iterative methods for matrix rank minimization
- Title not available (Why is that?)
- On the rank minimization problem over a positive semidefinite linear matrix inequality
- A new approach to collaborative filtering: operator estimation with spectral regularization
- Real-Time Discriminative Background Subtraction
Cited In (14)
- An inexact ADMM with proximal-indefinite term and larger stepsize
- Low-rank and sparse matrices fitting algorithm for low-rank representation
- A separable surrogate function method for sparse and low-rank matrices decomposition
- A parameterized proximal point algorithm for separable convex optimization
- General parameterized proximal point algorithm with applications in statistical learning
- Generalized symmetric ADMM for separable convex optimization
- A faster generalized ADMM-based algorithm using a sequential updating scheme with relaxed step sizes for multiple-block linearly constrained separable convex programming
- A partial PPA block-wise ADMM for multi-block linearly constrained separable convex optimization
- Rank-Sparsity Incoherence for Matrix Decomposition
- Title not available (Why is that?)
- Strongly convex programming for exact matrix completion and robust principal component analysis
- Lower bounds for the low-rank matrix approximation
- A New Insight on Augmented Lagrangian Method with Applications in Machine Learning
- A partially proximal S-ADMM for separable convex optimization with linear constraints
Uses Software
This page was built for publication: A new model for sparse and low-rank matrix decomposition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5149591)
