Free lunches on the discrete Lipschitz class

DOI10.1016/J.TCS.2010.12.028MaRDI QIDQ633702zbMATHOpenAlexFDO

Authors Pei Jiang, Ying-Ping Chen

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

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

Recommendations

• No-free-lunch theorems in the continuum
• No free lunch theorems: limitations and perspectives of metaheuristics
• Continuous lunches are free plus the design of optimal optimization algorithms
• No free lunch theorem: a review
• A ``no free lunch tutorial: sharpened and focused no free lunch

Cites work

• scientific article; zbMATH DE number 44452 (Why is no real title available?)
• scientific article; zbMATH DE number 1350773 (Why is no real title available?)
• scientific article; zbMATH DE number 1076783 (Why is no real title available?)
• scientific article; zbMATH DE number 1962832 (Why is no real title available?)
• scientific article; zbMATH DE number 2040662 (Why is no real title available?)
• scientific article; zbMATH DE number 819814 (Why is no real title available?)
• A comparison of simulated annealing with a simple evolutionary algorithm on pseudo-Boolean functions of unitation
• A no-free-lunch theorem for non-uniform distributions of target functions
• AN IMPROVED HYPERCUBE BOUND FOR MULTISEARCHING AND ITS APPLICATIONS
• Algorithmic analysis of a basic evolutionary algorithm for continuous optimization
• Introduction to algorithms
• On the analysis of the \((1+1)\) evolutionary algorithm
• Optimization with randomized search heuristics -- the (A)NFL theorem, realistic scenarios, and difficult functions.
• Probability Inequalities for Sums of Bounded Random Variables
• Randomized local search, evolutionary algorithms, and the minimum spanning tree problem
• Simplified drift analysis for proving lower bounds in evolutionary computation
• Subthreshold-seeking local search
• Towards an analytic framework for analysing the computation time of evolutionary algorithms

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q633702)