Continuous lunches are free plus the design of optimal optimization algorithms
DOI10.1007/S00453-008-9244-5zbMATH Open1206.90133DBLPjournals/algorithmica/AugerT10OpenAlexW2006565216WikidataQ56431139 ScholiaQ56431139MaRDI QIDQ848643FDOQ848643
Publication date: 4 March 2010
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.186.6007
dynamic programmingcomplexityno-free-lunchKolmogorov's extension theoremexpensive optimizationbandit-based Monte-Carlo planning
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Efficient global optimization of expensive black-box functions
- Recent progress in unconstrained nonlinear optimization without derivatives
- An informational approach to the global optimization of expensive-to-evaluate functions
- 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.
- A derivative based surrogate model for approximating and optimizing the output of an expensive computer simulation
- Stochastic process measurability conditions
Cited In (8)
- No Free Lunch Theorems: Limitations and Perspectives of Metaheuristics
- Exposing the grey wolf, moth‐flame, whale, firefly, bat, and antlion algorithms: six misleading optimization techniques inspired by bestial metaphors
- Designing an Optimal Search Algorithm with Respect to Prior Information
- A framework for co-optimization algorithm performance and its application to worst-case optimization
- On the use of fitness landscape features in meta-learning based algorithm selection for the quadratic assignment problem
- No-free-lunch theorems in the continuum
- The Bayesian Search Game
- Evolutionary optimization: pitfalls and booby traps
Uses Software
This page was built for publication: Continuous lunches are free plus the design of optimal optimization algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q848643)
