On classes of functions for which no free lunch results hold

DOI10.1016/S0020-0190(03)00222-9zbMath1162.68816arXivcs/0108011WikidataQ56431138 ScholiaQ56431138MaRDI QIDQ1007637

Marc Toussaint, Christian Igel

Publication date: 23 March 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/cs/0108011

zbMATH Keywords

optimizationcombinatorial problemsrandomized algorithmsno free lunch

Mathematics Subject Classification ID

Randomized algorithms (68W20)

Related Items (9)

No Free Lunch Theorems: Limitations and Perspectives of Metaheuristics ⋮ Hybridization of tabu search with feasible and infeasible local searches for the quadratic multiple knapsack problem ⋮ A no free lunch theorem for multi-objective optimization ⋮ Practical performance models of algorithms in evolutionary program induction and other domains ⋮ On a feasible-infeasible two-population (FI-2Pop) genetic algorithm for constrained optimization: Distance tracing and no free lunch ⋮ A framework for co-optimization algorithm performance and its application to worst-case optimization ⋮ A no-free-lunch theorem for non-uniform distributions of target functions ⋮ Efficient covariance matrix update for variable metric evolution strategies ⋮ Optimization, block designs and no free lunch theorems

Cites Work

• Optimization with randomized search heuristics -- the (A)NFL theorem, realistic scenarios, and difficult functions.
• Unnamed Item

This page was built for publication: On classes of functions for which no free lunch results hold