A customized proximal point algorithm for stable principal component pursuit with nonnegative constraint

被引：0
|
作者：
Kaizhan Huai
Mingfang Ni
Feng Ma
Zhanke Yu
机构：
[1] PLA University of Science and Technology,College of Communications Engineering
来源：
Journal of Inequalities and Applications | / 2015卷
关键词：
proximal point method; customized; stable principal component pursuit; primal-dual algorithm;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
The stable principal component pursuit (SPCP) problem represents a large class of mathematical models appearing in sparse optimization-related applications such as image restoration, web data ranking. In this paper, we focus on designing a new primal-dual algorithm for the SPCP problem with nonnegative constraint. Our method is based on the framework of proximal point algorithm. By taking full exploitation to the special structure of the SPCP problem, the method enjoys the advantage of being easily implementable. Global convergence result is established for the proposed method. Preliminary numerical results demonstrate that the method is efficient.
引用
收藏
相关论文
共 50 条
  • [1] A customized proximal point algorithm for stable principal component pursuit with nonnegative constraint
    Huai, Kaizhan
    Ni, Mingfang
    Ma, Feng
    Yu, Zhanke
    [J]. JOURNAL OF INEQUALITIES AND APPLICATIONS, 2015, : 1 - 13
  • [2] A Proximal Fully Parallel Splitting Method for Stable Principal Component Pursuit
    Sun, Hongchun
    Liu, Jing
    Sun, Min
    [J]. MATHEMATICAL PROBLEMS IN ENGINEERING, 2017, 2017
  • [3] Stable Principal Component Pursuit
    Zhou, Zihan
    Li, Xiaodong
    Wright, John
    Candes, Emmanuel
    Ma, Yi
    [J]. 2010 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, 2010, : 1518 - 1522
  • [4] A generalized inexact Uzawa method for stable principal component pursuit problem with nonnegative constraints
    Huai, Kaizhan
    Ni, Mingfang
    Yu, Zhanke
    Zheng, Xiang
    Ma, Feng
    [J]. NUMERICAL ALGORITHMS, 2018, 77 (03) : 653 - 674
  • [5] A generalized inexact Uzawa method for stable principal component pursuit problem with nonnegative constraints
    Kaizhan Huai
    Mingfang Ni
    Zhanke Yu
    Xiang Zheng
    Feng Ma
    [J]. Numerical Algorithms, 2018, 77 : 653 - 674
  • [6] STABLE QUATERNION PRINCIPAL COMPONENT PURSUIT
    Li, Wenxin
    Zhang, Ying
    [J]. PACIFIC JOURNAL OF OPTIMIZATION, 2023, 19 (04): : 607 - 623
  • [7] Manifold Proximal Point Algorithms for Dual Principal Component Pursuit and Orthogonal Dictionary Learning
    Chen, Shixiang
    Deng, Zengde
    Ma, Shiqian
    So, Anthony Man-Cho
    [J]. CONFERENCE RECORD OF THE 2019 FIFTY-THIRD ASILOMAR CONFERENCE ON SIGNALS, SYSTEMS & COMPUTERS, 2019, : 259 - 263
  • [8] Manifold Proximal Point Algorithms for Dual Principal Component Pursuit and Orthogonal Dictionary Learning
    Chen, Shixiang
    Deng, Zengde
    Ma, Shiqian
    So, Anthony Man-Cho
    [J]. IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2021, 69 : 4759 - 4773
  • [9] Stable Analysis of Compressive Principal Component Pursuit
    You, Qingshan
    Wan, Qun
    [J]. ALGORITHMS, 2017, 10 (01)
  • [10] A variational approach to stable principal component pursuit
    Aravkin, Aleksandr
    Becker, Stephen
    Cevher, Volkan
    Olsen, Peder
    [J]. UNCERTAINTY IN ARTIFICIAL INTELLIGENCE, 2014, : 32 - 41
12345