No-free-lunch theorems in the continuum

DOI10.1016/j.tcs.2015.07.029zbMath1329.68233arXiv1409.2175OpenAlexW1582171764MaRDI QIDQ496010

Aureli Alabert, Ricard Caballero, Alessandro Berti, Marco Ferrante

Publication date: 16 September 2015

Published in: Theoretical Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

stochastic processesblack-box optimisationno-free-lunch

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
• A no-free-lunch theorem for non-uniform distributions of target functions
• Stochastic global optimization.
• Optimizing Without Derivatives: What Does the No Free Lunch Theorem Actually Say?
• On Positive-Definite Functions

This page was built for publication: No-free-lunch theorems in the continuum