Convexification-based globally convergent numerical method for a 1D coefficient inverse problem with experimental data
Michael V. Klibanov, Thuy T. Le, Loc H. Nguyen, Anders Sullivan, Lam, Nguyen

TL;DR
This paper introduces a convexification-based numerical method for solving a 1D coefficient inverse problem using experimental data, ensuring global convergence and robustness against initial guesses.
Contribution
The paper develops a new convexification approach with a Carleman estimate, guaranteeing global convergence for a 1D inverse problem with experimental data.
Findings
The method achieves accurate reconstruction of the dielectric constant from backscattering data.
Numerical results demonstrate successful application to both simulated and experimental data.
The approach guarantees convergence without requiring an initial guess.
Abstract
To compute the spatially distributed dielectric constant from the backscattering data, we study a coefficient inverse problem for a 1D hyperbolic equation. To solve the inverse problem, we establish a new version of Carleman estimate and then employ this estimate to construct a cost functional which is strictly convex on a convex bounded set with an arbitrary diameter in a Hilbert space. The strict convexity property is rigorously proved. This result is called the convexification theorem and is considered as the central analytical result of this paper. Minimizing this convex functional by the gradient descent method, we obtain the desired numerical solution to the coefficient inverse problems. We prove that the gradient descent method generates a sequence converging to the minimizer and we also establish a theorem confirming that the minimizer converges to the true solution as the noise…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
