IDEAS home Printed from https://ideas.repec.org/a/spr/coopap/v58y2014i1p1-29.html
   My bibliography  Save this article

Efficient algorithms for robust and stable principal component pursuit problems

Author

Listed:
  • Necdet Aybat
  • Donald Goldfarb
  • Shiqian Ma

Abstract

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 applications in computer vision, image processing and web data ranking. It has been shown that under certain conditions, the solution to the NP-hard RPCA problem can be obtained by solving a convex optimization problem, namely the robust principal component pursuit (RPCP). Moreover, if the observed data matrix has also been corrupted by a dense noise matrix in addition to gross sparse error, then the stable principal component pursuit (SPCP) problem is solved to recover the low-rank matrix. In this paper, we develop efficient algorithms with provable iteration complexity bounds for solving RPCP and SPCP. Numerical results on problems with millions of variables and constraints such as foreground extraction from surveillance video, shadow and specularity removal from face images and video denoising from heavily corrupted data show that our algorithms are competitive to current state-of-the-art solvers for RPCP and SPCP in terms of accuracy and speed. Copyright Springer Science+Business Media New York 2014

Suggested Citation

  • Necdet Aybat & Donald Goldfarb & Shiqian Ma, 2014. "Efficient algorithms for robust and stable principal component pursuit problems," Computational Optimization and Applications, Springer, vol. 58(1), pages 1-29, May.
    • Handle: RePEc:spr:coopap:v:58:y:2014:i:1:p:1-29
    DOI: 10.1007/s10589-013-9613-0
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10589-013-9613-0
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10589-013-9613-0?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. NESTEROV, Yu., 2005. "Smooth minimization of non-smooth functions," LIDAM Reprints CORE 1819, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    2. K. Kiwiel & C.H. Rosa & A. Ruszczynski, 1995. "Decomposition via Alternating Linearization," Working Papers wp95051, International Institute for Applied Systems Analysis.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Le Han & Shujun Bi & Shaohua Pan, 2016. "Two-stage convex relaxation approach to least squares loss constrained low-rank plus sparsity optimization problems," Computational Optimization and Applications, Springer, vol. 64(1), pages 119-148, May.
    2. N. Aybat & G. Iyengar, 2015. "An alternating direction method with increasing penalty for stable principal component pursuit," Computational Optimization and Applications, Springer, vol. 61(3), pages 635-668, July.
    3. Le Han & Shujun Bi, 2018. "Two-stage convex relaxation approach to low-rank and sparsity regularized least squares loss," Journal of Global Optimization, Springer, vol. 70(1), pages 71-97, January.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Masaru Ito, 2016. "New results on subgradient methods for strongly convex optimization problems with a unified analysis," Computational Optimization and Applications, Springer, vol. 65(1), pages 127-172, September.
    2. TAYLOR, Adrien B. & HENDRICKX, Julien M. & François GLINEUR, 2016. "Exact worst-case performance of first-order methods for composite convex optimization," LIDAM Discussion Papers CORE 2016052, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    3. Dimitris Bertsimas & Nishanth Mundru, 2021. "Sparse Convex Regression," INFORMS Journal on Computing, INFORMS, vol. 33(1), pages 262-279, January.
    4. Alexandre Belloni & Victor Chernozhukov & Lie Wang, 2013. "Pivotal estimation via square-root lasso in nonparametric regression," CeMMAP working papers CWP62/13, Centre for Microdata Methods and Practice, Institute for Fiscal Studies.
    5. DEVOLDER, Olivier & GLINEUR, François & NESTEROV, Yurii, 2013. "First-order methods with inexact oracle: the strongly convex case," LIDAM Discussion Papers CORE 2013016, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    6. David Degras, 2021. "Sparse group fused lasso for model segmentation: a hybrid approach," Advances in Data Analysis and Classification, Springer;German Classification Society - Gesellschaft für Klassifikation (GfKl);Japanese Classification Society (JCS);Classification and Data Analysis Group of the Italian Statistical Society (CLADAG);International Federation of Classification Societies (IFCS), vol. 15(3), pages 625-671, September.
    7. Yunmei Chen & Xiaojing Ye & Wei Zhang, 2020. "Acceleration techniques for level bundle methods in weakly smooth convex constrained optimization," Computational Optimization and Applications, Springer, vol. 77(2), pages 411-432, November.
    8. Silvia Villa & Lorenzo Rosasco & Sofia Mosci & Alessandro Verri, 2014. "Proximal methods for the latent group lasso penalty," Computational Optimization and Applications, Springer, vol. 58(2), pages 381-407, June.
    9. Wenjie Huang & Xun Zhang, 2021. "Randomized Smoothing Variance Reduction Method for Large-Scale Non-smooth Convex Optimization," SN Operations Research Forum, Springer, vol. 2(2), pages 1-28, June.
    10. Le Thi Khanh Hien & Cuong V. Nguyen & Huan Xu & Canyi Lu & Jiashi Feng, 2019. "Accelerated Randomized Mirror Descent Algorithms for Composite Non-strongly Convex Optimization," Journal of Optimization Theory and Applications, Springer, vol. 181(2), pages 541-566, May.
    11. DEVOLDER, Olivier, 2011. "Stochastic first order methods in smooth convex optimization," LIDAM Discussion Papers CORE 2011070, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    12. Boriss Siliverstovs, 2017. "Short-term forecasting with mixed-frequency data: a MIDASSO approach," Applied Economics, Taylor & Francis Journals, vol. 49(13), pages 1326-1343, March.
    13. Ya-Feng Liu & Xin Liu & Shiqian Ma, 2019. "On the Nonergodic Convergence Rate of an Inexact Augmented Lagrangian Framework for Composite Convex Programming," Mathematics of Operations Research, INFORMS, vol. 44(2), pages 632-650, May.
    14. David Müller & Vladimir Shikhman, 2022. "Network manipulation algorithm based on inexact alternating minimization," Computational Management Science, Springer, vol. 19(4), pages 627-664, October.
    15. Gondzio, Jacek, 2012. "Interior point methods 25 years later," European Journal of Operational Research, Elsevier, vol. 218(3), pages 587-601.
    16. A. Chambolle & Ch. Dossal, 2015. "On the Convergence of the Iterates of the “Fast Iterative Shrinkage/Thresholding Algorithm”," Journal of Optimization Theory and Applications, Springer, vol. 166(3), pages 968-982, September.
    17. Nima Rabiei & Jose Muñoz, 2015. "AAR-based decomposition algorithm for non-linear convex optimisation," Computational Optimization and Applications, Springer, vol. 62(3), pages 761-786, December.
    18. ARAVENA, Ignacio & PAPAVASILIOU, Anthony, 2016. "An Asynchronous Distributed Algorithm for solving Stochastic Unit Commitment," LIDAM Discussion Papers CORE 2016038, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    19. Pi, J. & Wang, Honggang & Pardalos, Panos M., 2021. "A dual reformulation and solution framework for regularized convex clustering problems," European Journal of Operational Research, Elsevier, vol. 290(3), pages 844-856.
    20. Franck Iutzeler & Jérôme Malick, 2018. "On the Proximal Gradient Algorithm with Alternated Inertia," Journal of Optimization Theory and Applications, Springer, vol. 176(3), pages 688-710, March.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:coopap:v:58:y:2014:i:1:p:1-29. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.