Exact Low-rank Matrix Recovery via Nonconvex Mp-Minimization

  • Lingchen Kong
  • Naihua Xiu
    • Categories Nonlinear Optimization Tags , , Short URL: https://optimization-online.org/?p=11546

    The low-rank matrix recovery (LMR) arises in many fields such as signal and image processing, statistics, computer vision, system identification and control, and it is NP-hard. It is known that under some restricted isometry property (RIP) conditions we can obtain the exact low-rank matrix solution by solving its convex relaxation, the nuclear norm minimization. In this paper, we consider the nonconvex relaxations by introducing $M_p$-norm ($0

    Citation

    Beijing Jiaotong University, April/2011

    Article

    Download

    View Exact Low-rank Matrix Recovery via Nonconvex Mp-Minimization