On the iteratively regularized Gauss-Newton method in Banach spaces with applications to parameter identification problems

From MaRDI portal
Publication:2391810

DOI10.1007/S00211-013-0529-5zbMATH Open1281.65086arXiv1306.2191OpenAlexW2136606968MaRDI QIDQ2391810FDOQ2391810


Authors: Qinian Jin, Min Zhong Edit this on Wikidata


Publication date: 5 August 2013

Published in: Numerische Mathematik (Search for Journal in Brave)

Abstract: In this paper we propose an extension of the iteratively regularized Gauss--Newton method to the Banach space setting by defining the iterates via convex optimization problems. We consider some a posteriori stopping rules to terminate the iteration and present the detailed convergence analysis. The remarkable point is that in each convex optimization problem we allow non-smooth penalty terms including L1 and total variation (TV) like penalty functionals. This enables us to reconstruct special features of solutions such as sparsity and discontinuities in practical applications. Some numerical experiments on parameter identification in partial differential equations are reported to test the performance of our method.


Full work available at URL: https://arxiv.org/abs/1306.2191




Recommendations




Cites Work


Cited In (36)





This page was built for publication: On the iteratively regularized Gauss-Newton method in Banach spaces with applications to parameter identification problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2391810)