A new model for sparse and low-rank matrix decomposition
From MaRDI portal
Publication:5149591
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)
Recommendations
- Robust PCA using nonconvex rank approximation and sparse regularizer
- scientific article; zbMATH DE number 7448151
- 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
Cites work
- scientific article; zbMATH DE number 3852340 (Why is no real title available?)
- scientific article; zbMATH DE number 45081 (Why is no real title available?)
- A Singular Value Thresholding Algorithm for Matrix Completion
- A new approach to collaborative filtering: operator estimation with spectral regularization
- A proximal-based deomposition method for compositions method for convex minimization problems
- Exact matrix completion via convex optimization
- Fixed point and Bregman iterative methods for matrix rank minimization
- Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization
- Latent semantic indexing: A probabilistic analysis
- On the rank minimization problem over a positive semidefinite linear matrix inequality
- Principal component analysis.
- Rank-Sparsity Incoherence for Matrix Decomposition
- Real-Time Discriminative Background Subtraction
- Robust principal component analysis?
- Semidefinite Programming
Cited in
(16)- An inexact ADMM with proximal-indefinite term and larger stepsize
- Augmented Lagrangian alternating direction method for matrix separation based on low-rank factorization
- Low-rank and sparse matrices fitting algorithm for low-rank representation
- A parameterized proximal point algorithm for separable convex optimization
- A separable surrogate function method for sparse and low-rank matrices decomposition
- 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
- scientific article; zbMATH DE number 6142618 (Why is no real title available?)
- 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
- A unified framework for nonconvex nonsmooth sparse and low-rank decomposition by majorization-minimization algorithm
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)
