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 > Isaac Newton Institute Seminar Series > Convex regularization of discrete-valued inverse problems
Convex regularization of discrete-valued inverse problemsAdd to your list(s) Download to your calendar using vCal
If you have a question about this talk, please contact INI IT. VMVW01 - Variational methods, new optimisation techniques and new fast numerical algorithms We consider inverse problems where where a distributed parameter is known a priori to only take on values from a given discrete set. This property can be promoted in Tikhonov regularization with the aid of a suitable convex but nondifferentiable regularization term. This allows applying standard approaches to show well-posedness and convergence rates in Bregman distance. Using the specific properties of the regularization term, it can be shown that convergence (albeit without rates) actually holds pointwise. Furthermore, the resulting Tikhonov functional can be minimized efficiently using a semi-smooth Newton method. Numerical examples illustrate the properties of the regularization term and the numerical solution. This talk is part of the Isaac Newton Institute Seminar Series series. This talk is included in these lists:
Note that ex-directory lists are not shown. |
Other listsCL's SRG seminar Future Debates Cambridge University Mountaineering ClubOther talksCerebral organoids: modelling human brain development and tumorigenesis in stem cell derived 3D culture Science Makers: multispectral imaging with Raspberry Pi Nuclear fuel manufacture at Westinghouse Springfields past, present and future How to lead a happy life in the midst of uncertainty |