## Abstract

The reconstruction of a low-rank matrix from its noisy observation finds its usage in many applications. It can be reformulated into a constrained nuclear norm minimization problem, where the bound η of the constraint is explicitly given or can be estimated by the probability distribution of the noise. When the Lagrangian method is applied to find the minimizer, the solution can be obtained by the singular value thresholding operator, where the thresholding parameter λ is related to the Lagrangian multiplier. In this paper, we first show that the Frobenius norm of the discrepancy between the minimizer and the observed matrix is a strictly monotonically increasing function of λ. From that we derive a closed form solution for λ in terms of η. Since λ is the same as the regularization parameter for the unconstrained regularized problem, our results can be applied to automatically choosing a suitable regularization parameter for the nuclear norm-type regularized minimization problems using the discrepancy principle. The regularization parameters obtained are comparable to (and sometimes better than) those obtained by Stein's unbiased risk estimator approach, while the cost of solving the minimization problem can be reduced by 11-18 times. Numerical experiments with both synthetic data and real MRI data are performed to validate the proposed approach.

Original language | English |
---|---|

Pages (from-to) | 2204-2225 |

Number of pages | 22 |

Journal | SIAM Journal on Scientific Computing |

Volume | 44 |

Issue number | 4 |

DOIs | |

Publication status | Published - 2022 |

Externally published | Yes |

### Bibliographical note

Publisher Copyright:© 2022 Society for Industrial and Applied Mathematics.

## Keywords

- discrepancy principle
- low-rank matrix
- nuclear norm
- regularization parameter
- singular value thresholding