RPCA Procedure
Details: RPCA Procedure
Robust principal component analysis (RPCA) is a matrix decomposition algorithm that decomposes an input matrix M into a low-rank matrix and a sparse matrix
, where
. This decomposition is obtained by solving a convex programming problem called principal component pursuit (PCP).
Let denote the nuclear norm of the matrix L (that is, the sum of the singular values of L), and let
denote the
norm of S. In this case, PCP can be formulated as
For more information about this formulation, see Candès et al. (2011).
RPCA is robust because the principal components are computed from the low-rank matrix. The sparse matrix includes the outlier values.[10] As a result, many applications of RPCA focus on the sparse matrix.
Two algorithms are implemented in the RPCA procedure: the augmented Lagrange multiplier algorithm and the accelerated proximal gradient algorithm.
[10] The sparse matrix can also include noise. The sparsity of the sparse matrix depends highly on the settings of the and
parameters.