No Free Lunch Theorems: Limitations and Perspectives of Metaheuristics

DOI10.1007/978-3-642-33206-7_1zbMath1328.68196OpenAlexW37779569MaRDI QIDQ3459671

Christian Igel

Publication date: 11 January 2016

Published in: Theory and Principled Methods for the Design of Metaheuristics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-33206-7_1

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Cites Work

• Unnamed Item
• Continuous lunches are free plus the design of optimal optimization algorithms
• On classes of functions for which no free lunch results hold
• Efficient covariance matrix update for variable metric evolution strategies
• Neutrality and self-adaptation
• A no-free-lunch theorem for non-uniform distributions of target functions
• Optimization with randomized search heuristics -- the (A)NFL theorem, realistic scenarios, and difficult functions.

This page was built for publication: No Free Lunch Theorems: Limitations and Perspectives of Metaheuristics