A smoothing proximal gradient algorithm for matrix rank minimization problem
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2021
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866916359909146624 |
|---|---|
| author | Yu, Quan Zhang, Xinzhen |
| author_facet | Yu, Quan Zhang, Xinzhen |
| contents | In this paper, we study the low-rank matrix minimization problem, where the loss function is convex but nonsmooth and the penalty term is defined by the cardinality function. We first introduce an exact continuous relaxation, that is, both problems have the same minimzers and the same optimal value. In particular, we introduce a class of lifted stationary point of the relaxed problem and show that any local minimizer of the relaxed problem must be a lifted stationary point. In addition, we derive lower bound property for the nonzero singular values of the lifted stationary point and hence also of the local minimizers of the relaxed problem. Then the smoothing proximal gradient (SPG) algorithm is proposed to find a lifted stationary point of the continuous relaxation model. Moreover, it is shown that the whole sequence generated by SPG algorithm converges to a lifted stationary point. At last, numerical examples show the efficiency of the SPG algorithm. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2103_09530 |
| institution | arXiv |
| publishDate | 2021 |
| record_format | arxiv |
| spellingShingle | A smoothing proximal gradient algorithm for matrix rank minimization problem Yu, Quan Zhang, Xinzhen Optimization and Control 15A03, 15A83, 90C30, 65K05 In this paper, we study the low-rank matrix minimization problem, where the loss function is convex but nonsmooth and the penalty term is defined by the cardinality function. We first introduce an exact continuous relaxation, that is, both problems have the same minimzers and the same optimal value. In particular, we introduce a class of lifted stationary point of the relaxed problem and show that any local minimizer of the relaxed problem must be a lifted stationary point. In addition, we derive lower bound property for the nonzero singular values of the lifted stationary point and hence also of the local minimizers of the relaxed problem. Then the smoothing proximal gradient (SPG) algorithm is proposed to find a lifted stationary point of the continuous relaxation model. Moreover, it is shown that the whole sequence generated by SPG algorithm converges to a lifted stationary point. At last, numerical examples show the efficiency of the SPG algorithm. |
| title | A smoothing proximal gradient algorithm for matrix rank minimization problem |
| topic | Optimization and Control 15A03, 15A83, 90C30, 65K05 |
| url | https://arxiv.org/abs/2103.09530 |