A new iterative procedure for the numerical solution of coefficient inverse problems
DOI10.1016/j.apnum.2004.09.031zbMath1072.65110MaRDI QIDQ557949
Alexandre Timonov, Michael V. Klibanov
Publication date: 30 June 2005
Published in: Applied Numerical Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apnum.2004.09.031
global convergence; numerical examples; Coefficient inverse problems; Contractive operator; Convexification approach; magnetotelluric sounding; Sequential minimization method; Strict convexity; Successive approximations
90C90: Applications of mathematical programming
65L20: Stability and convergence of numerical methods for ordinary differential equations
65L10: Numerical solution of boundary value problems involving ordinary differential equations
34A55: Inverse problems involving ordinary differential equations
65L09: Numerical solution of inverse problems involving ordinary differential equations
Related Items
Cites Work
- Global optimization methods for multimodal inverse problems
- A new slant on the inverse problems of electromagnetic frequency sounding: ‘convexification’ of a multiextremal objective function via the Carleman weight functions
- Layer stripping: a direct numerical method for impedance imaging
- Inverse problems and Carleman estimates
- A Convergent Layer Stripping Algorithm for the Radially Symmetric Impedence Tomography Problem
- Design and Testing of a Generalized Reduced Gradient Code for Nonlinear Programming
- Approximation of unbounded operators by bounded operators and related extremal problems
- A sequential minimization algorithm based on the convexification approach
- A unified framework for constructing globally convergent algorithms for multidimensional coefficient inverse problems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item