A New Approximation of the Matrix Rank Function and Its Application to Matrix Rank Minimization

作者：Li, Chengjin^*

来源：Journal of Optimization Theory and Applications, 2014, 163(2): 569-594.

DOI：10.1007/s10957-013-0477-3

• Matrix rank minimization
• Approximation function
• Projected gradient method
• Successive projected gradient method

The matrix rank minimization problem is widely applied in many fields such as control, signal processing and system identification. However, the problem is NP-hard in general and is computationally hard to directly solve in practice. In this paper, we provide a new approximation function of the matrix rank function, and the corresponding approximation problems can be used to approximate the matrix rank minimization problem within any level of accuracy. Furthermore, the successive projected gradient method, which is designed based on the monotonicity and the Frechet derivative of these new approximation function, can be used to solve the matrix rank minimization this problem by using the projected gradient method to find the stationary points of a series of approximation problems. Finally, the convergence analysis and the preliminary numerical results are given.

• 出版日期2014-11
• 单位福建师范大学