Publication: Research - peer-review › Article in proceedings – Annual report year: 2012
For non-linear inverse problems, the mathematical structure of the mapping from model parameters to data is usually unknown or partly unknown. Absence of information about the mathematical structure of this function prevents us from presenting an analytical solution, so our solution depends on our ability to produce efficient search algorithms. Such algorithms may be completely problem-independent (which is the case for the so-called 'meta-heuristics' or 'blind-search' algorithms), or they may be designed with the structure of the concrete problem in mind. We show that pure meta-heuristics are inefficient for large-scale, non-linear inverse problems, and that the 'no-free-lunch' theorem holds. We discuss typical objections to the relevance of this theorem. A consequence of the no-free-lunch theorem is that algorithms adapted to the mathematical structure of the problem perform more efficiently than pure meta-heuristics. We study problem-adapted inversion algorithms that exploit the knowledge of the smoothness of the misfit function of the problem. Optimal sampling strategies exist for such problems, but many of these problems remain hard. © 2012 Springer-Verlag.
|Title of host publication||Applied Parallel and Scientific Computing. Proceedings of the PARA 2010 Meeting : Revised Selected Papers, Part I|
|Conference||10th International Conference on Applied Parallel and Scientific Computing|
|Period||06/06/10 → 09/06/10|
|Name||Lecture Notes in Computer Science|
Loading map data...