Convergence of Proximal Iteratively Reweighted Nuclear Norm Algorithm for Image Processing.
basic_science · Level V
Where this comes from
- Record sourced from PubMed, PMID 28858798.
- Also identified by DOI 10.1109/TIP.2017.2745200.
- No licence information is recorded for this record.
- Because redistribution is not established, this page shows the abstract only. Follow the links below for the full text.
Abstract
The nonsmooth and nonconvex regularization has many applications in imaging science and machine learning research due to its excellent recovery performance. A proximal iteratively reweighted nuclear norm algorithm has been proposed for the nonsmooth and nonconvex matrix minimizations. In this paper, we aim to investigate the convergence of the algorithm. With the Kurdyka-Łojasiewicz property, we prove the algorithm globally converges to a critical point of the objective function. The numerical results presented in this paper coincide with our theoretical findings.