Oblivious Randomized Direct Search for Real-Parameter Optimization

DOI10.1007/978-3-540-87744-8_46zbMath1158.68492OpenAlexW1591945413MaRDI QIDQ3541116

Jens Jägersküpper

Publication date: 25 November 2008

Published in: Algorithms - ESA 2008 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-87744-8_46

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Randomized algorithms (68W20)

Related Items (2)

Precision, local search and unimodal functions ⋮ Static and self-adjusting mutation strengths for multi-valued decision variables

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Lower bounds for randomized direct search with isotropic sampling
• Algorithmic analysis of a basic evolutionary algorithm for continuous optimization
• Lower Bounds for Hit-and-Run Direct Search
• Tight bounds for blind search on the integers
• Mathematical Foundations of Computer Science 2003
• Logic versus Approximation

This page was built for publication: Oblivious Randomized Direct Search for Real-Parameter Optimization