科研之友
微信
新浪微博
Facebook
分享链接
摘要
The rank minimization problem with affine constraints is widely applied in the fields of control, system identification, and machine learning, and attracted much attention and well studied in the past few years. Unlike most of the existing methods where a nuclear norm is used to approximate the rank term, in this paper, we apply the penalty decomposition method to solve the rank minimization problem directly. One subproblem can be solved effectively by using linear conjugate gradient method, and the other one has closed-form solutions by taking full use of the problem's favorable structure. Under some suitable assumptions, the convergence results for the proposed method are given. Finally, we do numerical experiments on randomly generated and real data, the results show that the proposed method is effective and promising.
