Towards Tikhonov regularization of non-linear ill-posed problems: a dc programming approach

DOI10.1016/S1631-073X(02)02611-0zbMath1018.65072OpenAlexW2038167081MaRDI QIDQ1565934

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

Publication date: 27 May 2003

Published in: Comptes Rendus. Mathématique. Académie des Sciences, Paris (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s1631-073x(02)02611-0

zbMATH Keywords

inverse problemsnon-convex optimizationbranch-and-bound techniquesTikhonov regularization methodnon-linear ill-posed problems

Mathematics Subject Classification ID

Nonlinear ill-posed problems (47J06) Numerical solutions to equations with nonlinear operators (65J15) Numerical solutions of ill-posed problems in abstract spaces; regularization (65J20)

Related Items (2)

The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems ⋮ A branch and reduce approach for solving a class of low rank d.c. programs

Cites Work

• Convex analysis approach to d. c. programming: Theory, algorithms and applications
• Convergence of Tikhonov regularization for constrained ill-posed inverse problems
• A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Towards Tikhonov regularization of non-linear ill-posed problems: a dc programming approach