Free lunches on the discrete Lipschitz class

DOI10.1016/J.TCS.2010.12.028zbMATH Open1209.68279OpenAlexW1978844253MaRDI QIDQ633702FDOQ633702

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

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

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)

Cites Work

• Introduction to algorithms
• Probability Inequalities for Sums of Bounded Random Variables
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Simplified drift analysis for proving lower bounds in evolutionary computation
• A no-free-lunch theorem for non-uniform distributions of target functions
• Towards an analytic framework for analysing the computation time of evolutionary algorithms
• On the analysis of the \((1+1)\) evolutionary algorithm
• Randomized local search, evolutionary algorithms, and the minimum spanning tree problem
• Algorithmic analysis of a basic evolutionary algorithm for continuous optimization
• Optimization with randomized search heuristics -- the (A)NFL theorem, realistic scenarios, and difficult functions.
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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

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)