Fetching the paper…
Reading the bibliography…
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.
M. Frank and P. Wolfe, “An algorithm for quadratic programming,” Naval Res. Logis. Quart. , vol. 3, pp. 95–110, 1956
1956
Earlier work this paper cites.
D. Gabay and B. Mercier, “A dual algorithm for the solution of nonlinear variational problems via finite-element approximations,” Comp. Math. Appl. , vol. 2, pp. 17–40, 1976
1976
Earlier work this paper cites.
P. L. Lions and B. Mercier, “Splitting algorithms for the sum of two nonlinear operators,” SIAM Journal on Numerical Analysis , vol. 16, pp. 964–979, 1979
1979
Earlier work this paper cites.
D. Gabay, “Applications of the method of multipliers to variational inequalities,” in Augmented Lagrangian Methods: Applications to the Solution of Boundary Value Problems , M. Fortin and R. Glowinski, Eds. Amsterdam: North-Hollan, 1983
1983
Earlier work this paper cites.
M. Fortin and R. Glowinski, Augmented Lagrangian methods: applications to the numerical solution of boundary-value problems . North-Holland Pub. Co., 1983
1983
Earlier work this paper cites.
G. Cohen and D. L. Zhu, “Decomposition coordination methods in large scale optimization problems. the nondifferentiable case and the use of augmented lagrangians,” Advances in large scale systems , vol. 1, pp. 203–266, 1984
1984
Earlier work this paper cites.
J. Eckstein and D. P. Bertsekas, “On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators,” Mathematical Programming , vol. 55, pp. 293–318, 1992
1992
Earlier work this paper cites.
R. M. Larsen, “Lanczos bidiagonalization with partial reorthogonalization,” DAIMI Report Series , vol. 27, no. 537, 1998
1998
Earlier work this paper cites.
K. Kurdyka, “On gradients of functions definable in o-minimal structures,” Annales de l’institut Fourier , vol. 146, pp. 769–783, 1998
1998
Earlier work this paper cites.
A. P. Ruszczyński, Nonlinear optimization . Princeton university press, 2006, vol. 13
2006
Earlier work this paper cites.
P. L. Combettes and J.-C. Pesquet, “A douglas-rachford splitting approach to nonsmooth convex variational signal recovery,” IEEE Journal of Selected Topics in Signal Processing , vol. 1, no. 4, pp. 564–574, 2007
2007
Earlier work this paper cites.
P. Tseng, “On accelerated proximal gradient methods for convex-concave optimization,” Manuscript , 2008
2008
Earlier work this paper cites.
A. S. Lewis and J. Malick, “Alternating projections on manifolds,” Mathematics of Operations Research , vol. 33, no. 1, pp. 216–234, 2008
2008
Earlier work this paper cites.
P.-A. Absil, R. Mahony, and R. Sepulchre, Optimization algorithms on matrix manifolds . Princeton University Press, 2008
2008
Earlier work this paper cites.
E. J. Candès, X. Li, Y. Ma, and J. Wright, “Robust principal component analysis?” Journal of ACM , vol. 58, no. 1, pp. 1–37, 2009
2009
Earlier work this paper cites.
Z. Lin, A. Ganesh, J. Wright, L. Wu, M. Chen, and Y. Ma, “Fast convex optimization algorithms for exact recovery of a corrupted low-rank matrix,” in International Workshop on Computational Advances in Multi-Sensor Adaptive Processing , 2009
2009
Earlier work this paper cites.
Z. Lin, M. Chen, L. Wu, and Y. Ma, “The augmented lagrange multiplier method for exact recovery of corrupted low-rank matrices,” UIUC Technical Report UILU-ENG-09-2215, Tech. Rep., 2009
2009
Earlier work this paper cites.
A. Beck and M. Teboulle, “A fast iterative shrinkage-thresholding algorithm for linear inverse problems,” SIAM J. Imaging Sciences , vol. 2, no. 1, pp. 183–202, 2009
2009
Earlier work this paper cites.
T. Goldstein and S. Osher, “The split Bregman method for l1-regularized problems,” SIAM Journal on Imaging Sciences , vol. 2, no. 2, pp. 323–343, 2009
2009
Earlier work this paper cites.
2009
Earlier work this paper cites.
H. Xu, C. Caramanis, and S. Sanghavi, “Robust PCA via outlier pursuit,” in Advances in Neural Information Processing Systems 23 , J. D. Lafferty, C. K. I. Williams, J. Shawe-Taylor, R. S. Zemel, and A. Culotta, Eds. Curran Associates, Inc., 2010, pp. 2496–2504. [Online]. Available: http://papers.nips.cc/paper/4005-robust-pca-via-outlier-pursuit.pdf
2010
Earlier work this paper cites.
B. Recht, M. Fazel, and P. A. Parrilo, “Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization,” SIAM review , vol. 52, no. 3, pp. 471–501, 2010
2010
Earlier work this paper cites.
Z. Zhou, J. Wright, X. Li, E. J. Candès, and Y. Ma, “Stable principal component pursuit,” in Proceedings of International Symposium on Information Theory, , 2010
2010
Earlier work this paper cites.
J. Yang, Y. Zhang, and W. Yin, “A fast alternating direction method for tvl1-l2 signal reconstruction from partial fourier data,” IEEE Journal of Selected Topics in Signal Processing Special Issue on Compressed Sensing , vol. 4, no. 2, pp. 288–297, 2010
2010
Earlier work this paper cites.
L. Balzano, R. Nowak, and B. Recht, “Online identification and tracking of subspaces from highly incomplete information,” in Allerton Conference , 2010
2010
Earlier work this paper cites.
V. Chandrasekaran, S. Sanghavi, P. A. Parrilo, and A. S. Willsky, “Rank-sparsity incoherence for matrix decomposition,” SIAM Journal on Optimization , vol. 21, no. 2, pp. 572–596, 2011
2011
Earlier work this paper cites.
M. Tao and X. Yuan, “Recovering low-rank and sparse components of matrices from incomplete and noisy observations,” SIAM Journal on Optimization , vol. 21, no. 1, pp. 57–81, 2011
2011
Cited alongside, same era.
T. Zhou and D. Tao, “Godec: Randomized low-rank and sparse matrix decomposition in noisy case,” in ICML , 2011
2011
Cited alongside, same era.
J. Yang and Y. Zhang, “Alternating direction algorithms for l1-problems in compressive sensing,” SIAM Journal on Scientific Computing , vol. 33, no. 1, pp. 250–278, 2011
2011
Cited alongside, same era.
2011
Cited alongside, same era.
——, “Sparse convex optimization methods for machine learning,” Ph.D. dissertation, ETH Zurich, Oct. 2011
P. P. Markopoulos, G. N. Karystinos, and D. A. Pados, “Optimal algorithms for L1-subspace signal processing,” IEEE Transactions on Signal Processing , vol. 62, pp. 5046–5058, 2014
2014
Later among the works it cites.
A. Podosinnikova, S. Setzer, and M. Hein, “Robust PCA: Optimization of the robust reconstruction error over the stiefel manifold,” GCPR , 2014
2014
Later among the works it cites.
N. Shahid, V. Kalofolias, X. Bresson, M. Bronstein, and P. Vandergheynst, “Robust principal component analysis on graphs,” in ICCV , 2015
2015
Later among the works it cites.
H. Zhang, Y. Zhou, and Y. Liang, “Analysis of robust PCA via local incoherence,” 2015
2015
Later among the works it cites.
N. S. Aybat and G. Iyengar, “An alternating direction method with increasing penalty for stable principal component pursuit,” Computational Optimization and Applications , vol. 61, pp. 635–668, 2015
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2011
Cited alongside, same era.
A. E. Waters, A. C. Sankaranarayanan, and R. Baraniuk, “Sparcs: Recovering lowrank and sparse matrices from compressive measurements,” in NIPS , 2011
2011
Cited alongside, same era.
N. Boumal and P.-A. Absil, “RTRMC: A Riemannian trust-region method for low-rank matrix completion,” in NIPS , 2011
2011
Cited alongside, same era.
Y. Peng, A. Ganesh, J. Wright, W. Xu, and Y. Ma, “Rasl: Robust alignment by sparse and low-rank decomposition for linearly correlated images,” IEEE Transactions on Pattern Analysis and Machine Intelligence , vol. 34, no. 11, pp. 2233–2246, 2012
2012
Cited alongside, same era.
B. He and X. Yuan, “On the 𝒪 ( 1 / n ) \mathcal{O}(1/n) convergence rate of douglas-rachford alternating direction method,” SIAM Journal on Numerical Analysis , vol. 50, pp. 700–709, 2012
2012
Cited alongside, same era.
G. Liu, Z. Lin, S. Yan, J. Sun, Y. Yu, and Y. Ma, “Robust recovery of subspace structures by low-rank representation,” IEEE Transactions on Pattern Analysis and Machine Intelligence , vol. 35, no. 1, pp. 171–184, 2013
2013
Cited alongside, same era.
X. Yuan and J. Yang, “Sparse and low-rank matrix decomposition via alternating direction methods,” Pacific Journal of Optimization , vol. 9, no. 1, pp. 167–180, 2013
2013
Cited alongside, same era.
D. Goldfarb, S. Ma, and K. Scheinberg, “Fast alternating linearization methods for minimizing the sum of two convex functions,” Mathematical Programming Series A , vol. 141, no. 1-2, pp. 349–382, 2013
2013
Cited alongside, same era.
2015
Later among the works it cites.
M. Hintermüller and T. Wu, “Robust principal component pursuit via inexact alternating minimization on matrix manifolds,” Journal of Mathematical Imaging and Vision , vol. 51, no. 3, pp. 361–377, 2015
2015
Later among the works it cites.
T. Lin, S. Ma, and S. Zhang, “On the sublinear convergence rate of multi-block ADMM,” Journal of the Operations Research Society of China , vol. 3, no. 3, pp. 251–274, 2015
2015
Later among the works it cites.
X. Li, M. K. Ng, and X. Yuan, “Median filtering-based methods for static background extraction from surveillance video,” Numerical Linear Algebra with Applications , vol. 22, pp. 845–865, 2015
2015
Later among the works it cites.
S. Ma, D. Johnson, C. Ashby, D. Xiong, C. L. Cramer, J. H. Moore, S. Zhang, and X. Huang, “SPARCoC: a new framework for molecular pattern discovery and cancer gene identification,” PLoS ONE , vol. 10, no. 3, p. e0117135, 2015
2015
Later among the works it cites.
X. Yi, D. Park, Y. Chen, and C. Caramanis, “Fast algorithms for robust PCA via gradient descent,” 2016
2016
Later among the works it cites.
N. S. Aybat, Handbook of Robust Low Rank and Sparse Matrix Decomposition: Applications in Image and Video Processing . CRC Press, Taylor and Francis Group, 2016, ch. Algorithms for Stable PCA
2016
Later among the works it cites.
C. Mu, Y. Zhang, J. Wright, and D. Goldfarb, “Scalable robust matrix recovery: Frank-wolfe meets proximal methods,” SIAM Journal on Scientific Computing , vol. 38, no. 5, pp. A3291–A3317, 2016
2016
Later among the works it cites.
Q. Gu, Z. Wang, and H. Liu, “Low-rank and sparse structure pursuit via alternating minimization,” in AISTATS , 2016
2016
Later among the works it cites.
2016
Later among the works it cites.
C. Chen, B. He, Y. Ye, and X. Yuan, “The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent,” Mathematical Programming , vol. 155, pp. 57–79, 2016
2016
Later among the works it cites.
S. Ghadimi, G. Lan, and H. Zhang, “Mini-batch stochastic approximation methods for nonconvex stochastic composite optimization,” Math. Program. , vol. 155, no. 1, pp. 267–305, 2016
2016
Later among the works it cites.
2016
Later among the works it cites.
D. Drusvyatskiy and H. Wolkowicz, “The many faces of degeneracy in conic optimization,” Foundations and Trends in Optimization , vol. 3, no. 2, pp. 77–170, 2016
2016
Later among the works it cites.
T. Zhang and Y. Yang, “Robust PCA by manifold optimization,” https://arxiv.org/abs/1708.00257 , 2017
2017
Later among the works it cites.
T. Lin, S. Ma, and S. Zhang, “Global convergence of unmodified 3-block ADMM for a class of convex minimization problems,” Journal of Scientific Computing , 2017
2017
Later among the works it cites.
L. Yang, T. K. Pong, and X. Chen, “Alternating direction method of multipliers for a class of nonconvex and nonsmooth problems with applications to background/foreground extraction,” SIAM J. Imaging Sciences , vol. 10, pp. 74–110, 2017
2017
Later among the works it cites.
2017
Later among the works it cites.
S. Huang and H. Wolkowicz, “Low-rank matrix completion using nuclear norm with facial reduction,” Journal of Global Optimization , 2017
2017
Later among the works it cites.
2018
Closest in time.
J. Wright, A. Ganesh, S. Rao, Y. Peng, and Y. Ma, “Robust principal component analysis: Exact recovery of corrupted low-rank matrices via convex optimization,” in Advances in Neural Information Processing Systems 22 , Y. Bengio, D. Schuurmans, J. D. Lafferty, C. K. I. Williams, and A. Culotta, Eds. Curran Associates, Inc., 2009, pp. 2080–2088. [Online]. Available: http://papers.nips.cc/paper/3704-robust-principal-component-analysis-exact-recovery-of-corrupted-low-rank-matrices-via-convex-optimization.pdf
2088
Closest in time.