A new iterative procedure for the numerical solution of coefficient inverse problems

Authors:
Alexandre Timonov;Michael V. Klibanov
Affiliations:
Department of Mathematics, University of North Carolina at Charlotte, Charlotte, North Carolina;Department of Mathematics, University of North Carolina at Charlotte, Charlotte, North Carolina
Venue:
Applied Numerical Mathematics - 6th IMACS International symposium on iterative methods in scientific computing
Year:
2005

Citing 5
Cited 0

Practical methods of optimization; (2nd ed.)

Practical methods of optimization; (2nd ed.)
Simulated annealing: theory and applications

Simulated annealing: theory and applications
Nonlinear ill-posed problems

WCNA '92 Proceedings of the first world congress on World congress of nonlinear analysts '92, volume I
Genetic programming: an introduction: on the automatic evolution of computer programs and its applications

Genetic programming: an introduction: on the automatic evolution of computer programs and its applications
Design and Testing of a Generalized Reduced Gradient Code for Nonlinear Programming

ACM Transactions on Mathematical Software (TOMS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

A new iterative procedure for the numerical solution of constrained minimization problems within the framework of the sequential minimization method is presented. The method allows the construction of strictly convex objective functionals and provides the global convergence on a correctness set. The proposed procedure utilizes the contraction property of a map resulted from applying the sequential minimization method to an original inverse problem. The feasibility of the iterative procedure is demonstrated in computational experiments with a model inverse problem of magnetotelluric sounding of layered media.