Dual Smoothing and Level Set Techniques for Variational Matrix Decomposition

03/01/2016
by   Aleksandr Y. Aravkin, et al.
0

We focus on the robust principal component analysis (RPCA) problem, and review a range of old and new convex formulations for the problem and its variants. We then review dual smoothing and level set techniques in convex optimization, present several novel theoretical results, and apply the techniques on the RPCA problem. In the final sections, we show a range of numerical experiments for simulated and real-world problems.

READ FULL TEXT

page 23

page 28

page 29

page 30

research
09/14/2017

Informed Non-convex Robust Principal Component Analysis with Features

We revisit the problem of robust principal component analysis with featu...
research
10/14/2020

Rapid Robust Principal Component Analysis: CUR Accelerated Inexact Low Rank Estimation

Robust principal component analysis (RPCA) is a widely used tool for dim...
research
01/15/2021

Local Search Algorithms for Rank-Constrained Convex Optimization

We propose greedy and local search algorithms for rank-constrained conve...
research
05/12/2022

Multigrid methods for 3D H(𝐜𝐮𝐫𝐥) problems with nonoverlapping domain decomposition smoothers

We propose V–cycle multigrid methods for vector field problems arising f...
research
02/11/2018

Convex Formulations for Fair Principal Component Analysis

Though there is a growing body of literature on fairness for supervised ...
research
06/06/2017

Hyperplane Clustering Via Dual Principal Component Pursuit

We extend the theoretical analysis of a recently proposed single subspac...
research
07/01/2021

Computational Aspects of Characteristic Mode Decomposition – An Overview

Nearly all practical applications of the theory of characteristic modes ...

Please sign up or login with your details

Forgot password? Click here to reset