COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. |
University of Cambridge > Talks.cam > CCIMI Seminars > Iteratively Reweighted FGMRES and FLSQR for sparse reconstruction
Iteratively Reweighted FGMRES and FLSQR for sparse reconstructionAdd to your list(s) Download to your calendar using vCal
If you have a question about this talk, please contact J.W.Stevens. Krylov subspace methods are powerful iterative solvers for large-scale linear inverse problems, such as those arising in image deblurring and computed tomography. In this talk I will present two new algorithms to efficiently solve L2-Lp regularized problems that enforce sparsity in the solution. The proposed approach is based on building a sequence of quadratic problems approximating the original L2-Lp objective function, and partially solving them using flexible Krylov-Tikhonov methods. These algorithms are built upon a solid theoretical justification for converge, and have the advantage of building a single (flexible) approximation (Krylov) Subspace that encodes regularization through variable ``preconditioning’’. The performance of the algorithms will be shown through a variety of numerical examples. This is a joint work with Julianne Chung (Virginia Tech), James Nagy (Emory University) and Malena Sabate Landman (University of Bath). This talk is part of the CCIMI Seminars series. This talk is included in these lists:
Note that ex-directory lists are not shown. |
Other listsGeneral Microelectronics Group SeminarOther talksTALK POSTPONED Sugar and spice and all things nice – a journey into taste sensors in the body Service-Aware Provisioning for Greener & Smarter Cellular Networks Wolfson (Ancient) Warfare Wednesdays — Greek Warfare and Historiography Science & Engineering |