Comparative studies of the globally convergent convexification algorithm with application to imaging of antipersonnel land mines

DOI10.1080/00036810701609869zbMath1131.65086MaRDI QIDQ5441016

Jianguo Xin, Michael V. Klibanov

Publication date: 7 February 2008

Published in: Applicable Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00036810701609869

zbMATH Keywords

global convergence; numerical results; least squares minimization; tails; steepest descent method; coefficient inverse problems; second order hyperbolic equation; convexification algorithm; detection and imaging of land mines

Mathematics Subject Classification ID

35R30: Inverse problems for PDEs

65M12: Stability and convergence of numerical methods for initial value and initial-boundary value problems involving PDEs

65M60: Finite element, Rayleigh-Ritz and Galerkin methods for initial value and initial-boundary value problems involving PDEs

35L15: Initial value problems for second-order hyperbolic equations

65M32: Numerical methods for inverse problems for initial value and initial-boundary value problems involving PDEs

Related Items

On a hyperbolic coefficient inverse problem via partial dynamic boundary measurements

Uses Software

• KELLEY

Cites Work

• Numerical Solution of a Subsurface Imaging Inverse Problem
• Numerical studies on the globally convergent convexification algorithm in 2D
• Uniform Strict Convexity of a Cost Functional for Three-Dimensional Inverse Scattering Problem
• A sequential minimization algorithm based on the convexification approach
• A unified framework for constructing globally convergent algorithms for multidimensional coefficient inverse problems
• Inverse problems for a perturbed dissipative half-space