# Efficient Optimization Algorithms for Robust Principal Component Analysis and Its Variants

arXiv: https://arxiv.org/abs/1806.03430 · HTML: https://mlsanity.com/paper/1806.03430/

## Key facts

- Cited by 5 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 9 Jun 2018.

## Built on by (most cited first, 5 of 5)

- [LQ-LoRA: Low-rank Plus Quantized Matrix Decomposition for Efficient Language Model Finetuning](https://mlsanity.com/paper/2311.12023/) (2023)
- [Hankel-structured Tensor Robust PCA for Multivariate Traffic Time Series Anomaly Detection](https://mlsanity.com/paper/2110.04352/) (2021)
- [Rethinking Point Cloud Filtering: A Non-Local Position Based Approach](https://mlsanity.com/paper/2110.07253/) (2021)
- [Bregman Douglas-Rachford Splitting Method](https://mlsanity.com/paper/2509.08739/) (2025)
- [Linear Convergence of the Frank-Wolfe Algorithm over Product Polytopes](https://mlsanity.com/paper/2505.11259/) (2025)

## Abstract (arXiv)

Robust PCA has drawn significant attention in the last decade due to its success in numerous application domains, ranging from bio-informatics, statistics, and machine learning to image and video processing in computer vision. Robust PCA and its variants such as sparse PCA and stable PCA can be formulated as optimization problems with exploitable special structures. Many specialized efficient optimization methods have been proposed to solve robust PCA and related problems. In this paper we review existing optimization methods for solving convex and nonconvex relaxations/variants of robust PCA, discuss their advantages and disadvantages, and elaborate on their convergence behaviors. We also provide some insights for possible future research directions including new algorithmic frameworks that might be suitable for implementing on multi-processor setting to handle large-scale problems.