No Free Lunch Theorem: A Review

Stavros P. Adam (), Stamatios-Aggelos N. Alexandropoulos (), Panos M. Pardalos () and Michael N. Vrahatis ()
Additional contact information
Stavros P. Adam: University of Ioannina
Stamatios-Aggelos N. Alexandropoulos: University of Patras
Panos M. Pardalos: University of Florida
Michael N. Vrahatis: University of Patras

A chapter in Approximation and Optimization, 2019, pp 57-82 from Springer

Abstract: Abstract The “No Free Lunch” theorem states that, averaged over all optimization problems, without re-sampling, all optimization algorithms perform equally well. Optimization, search, and supervised learning are the areas that have benefited more from this important theoretical concept. Formulation of the initial No Free Lunch theorem, very soon, gave rise to a number of research works which resulted in a suite of theorems that define an entire research field with significant results in other scientific areas where successfully exploring a search space is an essential and critical task. The objective of this paper is to go through the main research efforts that contributed to this research field, reveal the main issues, and disclose those points that are helpful in understanding the hypotheses, the restrictions, or even the inability of applying No Free Lunch theorems.

Date: 2019
References: Add references at CitEc
Citations: View citations in EconPapers (11)

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:spochp:978-3-030-12767-1_5

Ordering information: This item can be ordered from
http://www.springer.com/9783030127671

DOI: 10.1007/978-3-030-12767-1_5

Access Statistics for this chapter

More chapters in Springer Optimization and Its Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().