A sequential minimization algorithm based on the convexification approach

DOI10.1088/0266-5611/19/2/306MaRDI QIDQ4405727zbMATH OpenOpenAlexFDO

Authors Michael V. Klibanov, Alexander Timonov

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

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

Recommendations

• A new slant on the inverse problems of electro-magnetic frequency sounding: `Convexification' of a multiextremal objective function via the Carleman weight functions
• Numerical Solution of an Inverse Problem of Imaging of Antipersonnel Land Mines By the Globally Convergent Convexification Algorithm
• A new version of the convexification method for a 1D coefficient inverse problem with experimental data
• Convexification of a 3-D coefficient inverse scattering problem
• A new iterative procedure for the numerical solution of coefficient inverse problems

Cited in

(14)

• An efficient algorithm for solving the inverse problem of locating the interfaces using the frequency sounding data.
• Alternating minimization as sequential unconstrained minimization: a survey
• Strengthening the sequential convex MINLP technique by perspective reformulations
• Approximate methods for convex minimization problems with series-parallel structure
• A new slant on the inverse problems of electro-magnetic frequency sounding: `Convexification' of a multiextremal objective function via the Carleman weight functions
• High speed imaging of antipersonnel land mines by the convexification algorithm for a simplified mathematical model in two dimensions
• On the Convergence of a Sequential Penalty Function Method for Constrained Minimization
• A unified framework for constructing globally convergent algorithms for multidimensional coefficient inverse problems
• Sequential greedy approximation for certain convex optimization problems
• Imaging of land mines by the globally convergent convexification method using a simplified mathematical model
• A Sequential Minimization Technique for Elliptic Quasi-variational Inequalities with Gradient Constraints
• Comparative studies of the globally convergent convexification algorithm with application to imaging of antipersonnel land mines
• A new iterative procedure for the numerical solution of coefficient inverse problems
• Simultaneous estimation of piecewise constant coefficients in elliptic pdes via Bayesian level-set methods

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4405727)