Free lunches on the discrete Lipschitz class

DOI10.1016/J.TCS.2010.12.028zbMath1209.68279OpenAlexW1978844253MaRDI QIDQ633702

Ying-Ping Chen, Pei Jiang

Publication date: 29 March 2011

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

Full work available at URL: https://doi.org/10.1016/j.tcs.2010.12.028

zbMATH Keywords

Lipschitz continuitydiscrete Lipschitz classno-free-lunch theoremsampling-test schemesubthreshold-seeker

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Approximation methods and heuristics in mathematical programming (90C59) Lipschitz (Hölder) classes (26A16) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Simplified drift analysis for proving lower bounds in evolutionary computation
• Towards an analytic framework for analysing the computation time of evolutionary algorithms
• Randomized local search, evolutionary algorithms, and the minimum spanning tree problem
• On the analysis of the \((1+1)\) evolutionary algorithm
• 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.
• Algorithmic analysis of a basic evolutionary algorithm for continuous optimization
• A comparison of simulated annealing with a simple evolutionary algorithm on pseudo-Boolean functions of unitation
• Subthreshold-seeking local search
• AN IMPROVED HYPERCUBE BOUND FOR MULTISEARCHING AND ITS APPLICATIONS
• Probability Inequalities for Sums of Bounded Random Variables

This page was built for publication: Free lunches on the discrete Lipschitz class