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

DOI10.1016/J.TCS.2014.10.038MaRDI QIDQ487990zbMATH OpenOpenAlexFDO

Authors Elena Popovici, Ezra Winston

Publication date 23 January 2015

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

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

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

zbMATH Keywords

performanceminimaxoptimalitymaximincoevolutionsolution conceptsbest worst-caseco-optimizationfree lunchworst-case optimization

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)

Recommendations

• Monotonicity versus performance in co-optimization
• On the practicality of optimal output mechanisms for co-optimization algorithms
• COCO: a platform for comparing continuous optimizers in a black-box setting
• Continuous lunches are free plus the design of optimal optimization algorithms
• Conditions that obviate the no-free-lunch theorems for optimization

Cites work

• scientific article; zbMATH DE number 1975089 (Why is no real title available?)
• scientific article; zbMATH DE number 2040662 (Why is no real title available?)
• A ``no free lunch tutorial: sharpened and focused no free lunch
• A no-free-lunch theorem for non-uniform distributions of target functions
• Black-box complexity for bounding the performance of randomized search heuristics
• Black-box search by elimination of fitness functions
• Continuous lunches are free plus the design of optimal optimization algorithms
• Finding the Point of a Polyhedron Closest to the Origin
• Monotonicity versus performance in co-optimization
• On classes of functions for which no free lunch results hold
• On the practicality of optimal output mechanisms for co-optimization algorithms
• 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
• Robust discrete optimization and its applications
• Unbiased coevolutionary solution concepts

Cited in

(3)

• Optimal synthesis of frameworks under multilevel performance constraints
• 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

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