A sequential minimization algorithm based on the convexification approach

DOI10.1088/0266-5611/19/2/306zbMath1026.78017OpenAlexW1977239492MaRDI QIDQ4405727

Alexandre Timonov, Michael V. Klibanov

Publication date: 16 December 2003

Published in: Inverse Problems (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/7d283f202cdc5014e029a8dd7ab7530990650481

Mathematics Subject Classification ID

Nonlinear programming (90C30) Numerical solutions of ill-posed problems in abstract spaces; regularization (65J20) Numerical solution of inverse problems involving ordinary differential equations (65L09)

Related Items (6)

Imaging of land mines by the globally convergent convexification method using a simplified mathematical model ⋮ A unified framework for constructing globally convergent algorithms for multidimensional coefficient inverse problems ⋮ A new iterative procedure for the numerical solution of coefficient inverse problems ⋮ Comparative studies of the globally convergent convexification algorithm with application to imaging of antipersonnel land mines ⋮ High speed imaging of antipersonnel land mines by the convexification algorithm for a simplified mathematical model in two dimensions ⋮ An efficient algorithm for solving the inverse problem of locating the interfaces using the frequency sounding data.

This page was built for publication: A sequential minimization algorithm based on the convexification approach