28 citations · 131 across the 41 of their papers we have counts for
Showing 2013Show all
3 papers · 1 filter
math.OC2013★ 1 cited
Efficient Algorithms for Robust and Stable Principal Component Pursuit Problems
Necdet Serhat Aybat, Donald Goldfarb, Shiqian Ma
The problem of recovering a low-rank matrix from a set of observations corrupted with gross sparse error is known as the robust principal component analysis (RPCA) and has many app…
math.OC2013
An Alternating Direction Method with Increasing Penalty for Stable Principal Component Pursuit
Necdet Serhat Aybat, Garud Iyengar
The stable principal component pursuit (SPCP) is a non-smooth convex optimization problem, the solution of which enables one to reliably recover the low rank and sparse components…
math.OC2013★ 20 cited
An Augmented Lagrangian Method for Conic Convex Programming
Necdet Serhat Aybat, Garud Iyengar
We propose a new first-order augmented Lagrangian algorithm ALCC for solving convex conic programs of the form min{rho(x)+gamma(x): Ax-b in K, x in chi}, where rho and gamma are cl…