In , Chambolle proposed an algorithm for minimizing the total variation of an image. In this short note, based on the theory on semismooth operators, we study semismooth Newton’s methods for total variation minimization. The convergence and numerical results are also presented to show the effectiveness of the proposed algorithms.
semismooth Newton’s methods total variation denoising regularization
This is a preview of subscription content, log in to check access.
A. Chambolle, “An algorithm for total variation minimization and applications,” Journal of Mathematical Imaging and Vision, Vol. 20, pp. 89–97, 2004.CrossRefMathSciNetGoogle Scholar
T.F. Chan, G.H. Golub, and P. Mulet, “A nonlinear primal-dual method for total variation-based image restoration,” SIAM J. Sci. Comput., Vol. 20, pp. 1964–1977, 1999.MATHCrossRefMathSciNetGoogle Scholar
F.H. Clarke, Optimization and Nonsmooth Analysis, Wiley: New York, 1983.MATHGoogle Scholar
G.H. Golub and C. Van Loan, Matrix Computations, 3rd ed., The Johns Hopkins University Press, 1996.Google Scholar
H. Jiang and D. Ralph, “Global and local superlinear convergence analysis of Newton-type methods for semismooth equations with smooth least squares,” in Reformulation: Nonsmooth, Piecewise Smooth, Semismooth and Smoothing Methods, M. Fukushima and L. Qi (eds.), Kluwer Acad. Publ., Dordrecht, 1998, pp. 181–209.Google Scholar
G. Golub and C. Van Loan, Matrix Computations, 3rd ed., The Johns Hopkins University Press, 1996.Google Scholar