Solving an inverse problem for an elliptic equation by d.c. programming

DOI10.1023/A:1022530520406zbMATH Open1046.90063OpenAlexW16717595MaRDI QIDQ1411331FDOQ1411331

Dinh Nho Hào, Pham Dinh Tao, Le Thi Hoai An

Publication date: 27 October 2003

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1022530520406

Recommendations

• Towards Tikhonov regularization of non-linear ill-posed problems: a dc programming approach
• On the determination of the unknown coefficients in a linear elliptic equation
• scientific article; zbMATH DE number 418855
• Finding the coefficients of a linear elliptic equation
• Solving an inverse elliptic coefficient problem by convex non-linear semidefinite programming

zbMATH Keywords

inverse problemTikhonov regularizationDCAill-posed problemd.c. programmingbranch-and-bound technique

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59) Nonconvex programming, global optimization (90C26)

Cited In (4)

• A branch and reduce approach for solving a class of low rank d.c. programs
• The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
• Parameter identification in Helmholtz-type equations with a variable coefficient using a regularized DRBEM
• A closedness condition and its applications to DC programs with convex constraints

This page was built for publication: Solving an inverse problem for an elliptic equation by d.c. programming

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