.png){kind=icon}
Return
FLEXIBLE KRYLOV METHODS FOR lp REGULARIZATION
.png){kind=icon}
OA
AI
DOI：10.1137/18M1194456.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper we develop flexible Krylov methods for efficiently computing regularized solutions to large-scale linear inverse problems with an l(2) fit-to-data term and an l(p) penalization term, for p >= 1. First we approximate the p-norm penalization term as a sequence of 2-norm penalization terms using adaptive regularization matrices in an iterative reweighted norm fashion, and then we exploit flexible preconditioning techniques to efficiently incorporate the weight updates. To handle general (nonsquare) l(p)-regularized least-squares problems, we introduce a flexible Golub-Kahan approach and exploit it within a Krylov-Tikhonov hybrid framework. Furthermore, we show that both the flexible Golub-Kahan and the flexible Arnoldi approaches for p = 1 can be used to efficiently compute solutions that are sparse with respect to some transformations. The key benefits of our approach compared to existing optimization methods for l(p) regularization are that inner-outer iteration schemes are replaced by efficient projection methods on linear subspaces of increasing dimension and that expensive regularization parameter selection techniques can be avoided. Theoretical insights are provided, and numerical results from image deblurring and tomographic reconstruction illustrate the benefits of this approach, compared to well-established methods.
Keywords:
l(p) regularization
sparsity reconstruction
iterative reweighted norm
flexible Golub-Kahan
hybrid regularization
image deblurring
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
2.6
Papers:
5.1K
Citations:
1.8W
Organization
Cited Papers
Cloning and retinal expression of melatonin receptors in the European sea bass, Dicentrarchus labraxOAAI
OAAIShareSaveShareSave
How little data is enough? Phase-diagram analysis of sparsity-regularized X-ray computed tomography.png)
PHILOSOPHICAL TRANSACTIONS OF THE ROYAL SOCIETY A-MATHEMATICAL PHYSICAL AND ENGINEERING SCIENCESOAAI
PHILOSOPHICAL TRANSACTIONS OF THE ROYAL SOCIETY A-MATHEMATICAL PHYSICAL AND ENGINEERING SCIENCESIF3.7
OAAIShareSave
View more