Convergence of Proximal Iteratively Reweighted Nuclear Norm Algorithm for Image Processing
Related Experiment Video
Updated: Feb 23, 2026

Quantifying Intermembrane Distances with Serial Image Dilations
Published on: September 28, 2018
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.
Related Concept Videos
Nuclear Overhauser Enhancement (NOE)
Newton’s Method
Application of Linearization and Approximation
Insensitive Nuclei Enhanced by Polarization Transfer (INEPT)
Reconstruction of Signal using Interpolation
Region of Convergence of Laplace Tarnsform
Consider a decaying exponential signal that begins at a specific time. When deriving its Laplace transform, the time-domain variable is replaced with a complex variable. This...
