Simple explanation of the no-free-lunch theorem and its implications

DOI10.1023/A:1021251113462zbMath1031.91018MaRDI QIDQ1411370

Yu-Chi Ho, David L. Pepyne

Publication date: 27 October 2003

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

zbMATH Keywords

sensitivity; optimization; complexity; decision making; robustness; learning; search; strategy selection; impossibility theorem; No-free-lunch theorem; representation and encoding

Mathematics Subject Classification ID

91B06: Decision theory

90C31: Sensitivity, stability, parametric optimization

90C15: Stochastic programming

Related Items

Maximum principle for optimal distributed control of the viscous dullin-gottwald-Holm equation, Analytical and numerical comparisons of biogeography-based optimization and genetic algorithms, Maximum principle for optimal boundary control of the Kuramoto-Sivashinsky equation, An analysis of the equilibrium of migration models for biogeography-based optimization, Recent progress on reservoir history matching: a review, A novel population initialization method for accelerating evolutionary algorithms, Optimal control of age-structured population dynamics for spread of universally fatal diseases

Cites Work

• Unnamed Item
• Unnamed Item
• Convergence properties of ordinal comparison in the simulation of discrete event dynamic systems
• An explanation of ordinal optimization: Soft computing for hard problems