Simple explanation of the No Free Lunch Theorem of Optimization

Proceedings of the IEEE Conference on Decision and Control

Volumn 5, Issue , 2001, Pages 4409-4414

  Ho, Yu Chi ^a   Pepyne, David L ^a  

^a HARVARD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CONTROL THEORY; DECISION THEORY; FUNCTIONS; MATHEMATICAL OPERATORS; MATRIX ALGEBRA; PERFORMANCE; RANDOM PROCESSES; THEOREM PROVING; VECTORS;

COUNTING LEMMA; FINITE WORLD ASSUMPTION; FUNCTION OPTIMIZATION; IMPOSSIBILITY THEOREM; NO FREE LUNCH THEOREM; PROBLEM MATRIX; STOCHASTIC OPTIMIZATION;

OPTIMIZATION;

EID: 0035708917     PISSN: 01912216     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (14)

1. On the futility of blind search: An algorithmists view of the 'no free lunch'
2. Convergence properties of ordinal comparisons in the simulation of DEDS
3. An explanation of ordinal optimization: Soft computing for hard problems
4. The no free lunch theorem and the human machine interface
5. Remarks on a recent paper on the 'no free lunch' theorems
6. Fundamental limitations on search algorithms: Evolutionary computing in perspective
7. Beyond NFL: A few tentative steps
8. Continuing beyond NFL: Dissecting real world problems
9. No free lunch theorems for optimization