Conditions that Obviate the No-Free-Lunch Theorems for Optimization

DOI10.1287/ijoc.1060.0194zbMath1241.90063OpenAlexW2141243022MaRDI QIDQ2892335

Gary J. Koehler

Publication date: 18 June 2012

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/ijoc.1060.0194

zbMATH Keywords

no free lunchblackbox search

Mathematics Subject Classification ID

Nonlinear programming (90C30) Search theory (90B40)

Related Items (3)

Population based optimization via differential evolution and adaptive fractional gradient descent ⋮ On a feasible-infeasible two-population (FI-2Pop) genetic algorithm for constrained optimization: Distance tracing and no free lunch ⋮ Diversity of ability and cognitive style for group decision processes

This page was built for publication: Conditions that Obviate the No-Free-Lunch Theorems for Optimization