Limits to Nonlinear Inversion

  • Klaus Mosegaard
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7133)


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.


Genetic Algorithm Inverse Problem Simulated Annealing Radial Basis Function Acceptable Solution 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Nolet, G., van Trier, J., Huisman, R.: A formalism for nonlinear inversion of seismic surface waves. Geoph. Res. Lett. 13, 26–29 (1986)CrossRefGoogle Scholar
  2. 2.
    Nolet, G.: Partitioned wave-form inversion and 2D structure under the NARS array. J. Geophys. Res. 95, 8499–8512 (1990)CrossRefGoogle Scholar
  3. 3.
    Snieder, R.: The role of nonlinearity in inverse problems. Inverse Problems 14, 387–404 (1998)MathSciNetCrossRefzbMATHGoogle Scholar
  4. 4.
    Sambridge, M.: Exploring multi-dimensional landscapes without a map. Inverse Problems 14(3), 427–440 (1998)MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    Kirkpatrick, S.C., Gelatt, D., Vecchi, M.P.: Optimization by simulated annealing. Science 220, 671–680 (1983)MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    Holland, J.H.: Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor (1975)Google Scholar
  7. 7.
    Goldberg, D.E.: Genetic Algorithms in Search, Optimization and Machine Learning. Kluwer Academic Publishers, Boston (1989)zbMATHGoogle Scholar
  8. 8.
    Glover, F.: Future Paths for Integer Programming and Links to Artificial Intelligence. Comput. & Ops. Res. 13(5), 533–549 (1986)MathSciNetCrossRefzbMATHGoogle Scholar
  9. 9.
    Sambridge, M.: Geophysical inversion with a Neighbourhood algorithm -I. Searching a parameter space. Geoph. Jour. Int. 138, 479–494 (1999a)CrossRefGoogle Scholar
  10. 10.
    Sambridge, M.: Geophysical inversion with a Neighbourhood algorithm -II. Appraising the ensemble. Geoph. Jour. Int. 138, 727–746 (1999b)CrossRefGoogle Scholar
  11. 11.
    Cauchy, A.L.: First Turin Memoir (1831)Google Scholar
  12. 12.
    Mosegaard, K., Tarantola, A.: Monte Carlo sampling of solutions to inverse problems. J. Geophys. Res. 100(B7), 12,431–12,447 (1995)Google Scholar
  13. 13.
    Khachiyan, L.G.: The problem of computing the volume of polytopes is np-hard. Uspekhi Mat. Nauk. 44, 199–200 (1989)zbMATHGoogle Scholar
  14. 14.
    Wolpert, D.H., Macready, W.G.: No Free Lunch Theorems for Optimization. IEEE Transactions on Evolutionary Computation 1, 67–82 (1997)CrossRefGoogle Scholar
  15. 15.
    Brown, A.L.: Uniform approximation by radial basis functions. In: Light, W.A. (ed.) Advances in Numerical Analysis, vol. 2, pp. 203–206. Oxford University Press, Oxford (1992)Google Scholar
  16. 16.
    Papadimitriou, C.H., Steiglitz: Combinatorial Optimization: Algorithms and Complexity. Dover Publications, Inc., Mineola (1998)Google Scholar
  17. 17.
    Hastings, W.K.: Monte Carlo sampling methods using Markov Chain and their applications. Biometrika 57, 97–109 (1970)MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Klaus Mosegaard
    • 1
  1. 1.Department of Informatics and Mathematical Modeling, and Center for Energy Resources EngineeringTechnical University of DenmarkLyngbyDenmark

Personalised recommendations