A framework for co-optimization algorithm performance and its application to worst-case optimization

DOI10.1016/j.tcs.2014.10.038zbMath1314.68295OpenAlexW1978292370MaRDI QIDQ487990

Ezra Winston, Elena Popovici

Publication date: 23 January 2015

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

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

zbMATH Keywords

performanceminimaxmaximinoptimalitycoevolutionsolution conceptsbest worst-caseco-optimizationfree lunchworst-case optimization

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
• Unnamed Item
• Unnamed Item
• Continuous lunches are free plus the design of optimal optimization algorithms
• On classes of functions for which no free lunch results hold
• Robust discrete optimization and its applications
• 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.
• Performance analysis of randomised search heuristics operating with a fixed budget
• Playing Mastermind with Constant-size Memory
• Black-Box Complexity for Bounding the Performance of Randomized Search Heuristics
• Finding the Point of a Polyhedron Closest to the Origin
• Black-box search by elimination of fitness functions
• Unbiased coevolutionary solution concepts
• Monotonicity versus performance in co-optimization
• On the practicality of optimal output mechanisms for co-optimization algorithms

This page was built for publication: A framework for co-optimization algorithm performance and its application to worst-case optimization