Skip to content

No free lunch theorems for optimization

David H. Wolpert, William G. Macready

IEEE Transactions on Evolutionary Computation · 1997 · 14,717 citations

No retraction on record in OpenAlex.Check Crossref now

Cite this paper

Wolpert, D. H., & Macready, W. G. (1997). No free lunch theorems for optimization. IEEE Transactions on Evolutionary Computation, 1(1), 67–82. https://doi.org/10.1109/4235.585893

In text: (Wolpert & Macready, 1997)

Ask a question about this research

One question, free, no account. Anchorcite finds the papers, checks each against Crossref and links every sentence of the answer to the passage it comes from.

Abstract

A framework is developed to explore the connection between effective optimization algorithms and the problems they are solving. A number of "no free lunch" (NFL) theorems are presented which establish that for any algorithm, any elevated performance over one class of problems is offset by performance over another class. These theorems result in a geometric interpretation of what it means for an algorithm to be well suited to an optimization problem. Applications of the NFL theorems to information-theoretic aspects of optimization and benchmark measures of performance are also presented. Other issues addressed include time-varying optimization problems and a priori "head-to-head" minimax distinctions between optimization algorithms, distinctions that result despite the NFL theorems' enforcing of a type of uniformity over all algorithms.

  1. A fast and elitist multiobjective genetic algorithm: NSGA-II2002
  2. Particle swarm optimization2002
  3. Optimization by Simulated Annealing1983
  4. Statistical Learning Theory1999
  5. A new optimizer using particle swarm theory2002

Metadata from OpenAlex (CC0). Citations are generated from the published record.