Majorization-minimization generalized Krylov subspace methods for lp-lq optimization applied to image restoration

Abstract

A new majorization-minimization framework for lp-lq image restoration is presented. The solution is sought in a generalized Krylov subspace that is build up during the solution process. Proof of convergence to a stationary point of the minimized lp-lq functional is provided for both convex and nonconvex problems. Computed examples illustrate that high-quality restorations can be determined with a modest number of iterations and that the storage requirement of the method is not very large. A comparison with related methods shows the competitiveness of the method proposed.

Cite this paper

@inproceedings{Huang2017MajorizationminimizationGK, title={Majorization-minimization generalized Krylov subspace methods for lp-lq optimization applied to image restoration}, author={Guo-Jhu Huang and Fiorella Sgallari}, year={2017} }