Abstract
This paper deals with the minimization problem associated with Tikhonov regularization where the penalty term is a ℓp‐norm with p ∈ (1,2). An algorithm based on fixed‐point iterations is proposed, and theoretical convergence results are given. Further, combining projection over the Krylov subspace generated by the Golub‐Kahan bidiagonalization procedure and the proposed iterative algorithm, we derive an iterative procedure that is well suited for large‐scale ℓ2‐ℓp Tikhonov regularization. The performance and efficiency of the proposed algorithms on image restoration problems like 2D tomography and super resolution, as well as on classical discrete ill‐posed problems having solutions with flat and smooth parts or nonsmooth solutions are also illustrated.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
