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

DOI10.1023/A:1022530520406zbMath1046.90063OpenAlexW16717595MaRDI QIDQ1411331

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

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

zbMATH Keywords

DCAinverse problemd.c. programmingTikhonov regularizationill-posed problembranch-and-bound technique

Mathematics Subject Classification ID

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

Related Items

A closedness condition and its applications to DC programs with convex constraints ⋮ 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 branch and reduce approach for solving a class of low rank d.c. programs