Pages that link to "Item:Q2892335"
From MaRDI portal
The following pages link to Conditions that obviate the no-free-lunch theorems for optimization (Q2892335):
Displaying 13 items.
- A framework for co-optimization algorithm performance and its application to worst-case optimization (Q487990) (← links)
- No-free-lunch theorems in the continuum (Q496010) (← links)
- Continuous lunches are free plus the design of optimal optimization algorithms (Q848643) (← links)
- Diversity of ability and cognitive style for group decision processes (Q1010126) (← links)
- Optimization, block designs and no free lunch theorems (Q1041724) (← links)
- A no-free-lunch theorem for non-uniform distributions of target functions (Q1774632) (← links)
- Optimization with randomized search heuristics -- the (A)NFL theorem, realistic scenarios, and difficult functions. (Q1853460) (← links)
- No free lunch theorem: a review (Q2337592) (← links)
- On a feasible-infeasible two-population (FI-2Pop) genetic algorithm for constrained optimization: Distance tracing and no free lunch (Q2427178) (← links)
- Learning using anti-training with sacrificial data (Q2810794) (← links)
- A review of No Free Lunch Theorems for search (Q3187400) (← links)
- Population based optimization via differential evolution and adaptive fractional gradient descent (Q5082451) (← links)
- An empirical demonstration of the no free lunch theorem (Q5132871) (← links)
