Continuous lunches are free plus the design of optimal optimization algorithms
The authors investigate extensions of no-free-lunch theorems for countably infinite and continuous domains and derive an optimal optimization algorithm assuming a prior distribution on the distribution of functions and a finite number of iterates.
scientific article; zbMATH DE number 5677433
scientific article