Tuning Algorithms for Stochastic Black-Box Optimization: State of the Art and Future Perspectives

DOI10.1007/978-3-030-66515-9_3OpenAlexW3167513112MaRDI QIDQ5153496FDOQ5153496

Authors: Thomas Bartz-Beielstein, Frederik Rehbach, Margarita Rebolledo 

Publication date: 30 September 2021

Published in: Black Box Optimization, Machine Learning, and No-Free Lunch Theorems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-66515-9_3

Recommendations

• scientific article; zbMATH DE number 2222042
• scientific article; zbMATH DE number 5829047
• Tuning an Algorithm Using Design of Experiments
• The future of experimental research
• scientific article; zbMATH DE number 4112399

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Approximation methods and heuristics in mathematical programming (90C59)

Cites Work

• Efficient global optimization of expensive black-box functions
• Paramils: an automatic algorithm configuration framework
• Testing Unconstrained Optimization Software
• PAVER 2.0: an open source environment for automated performance analysis of benchmarking data
• CUTE
• Algorithm 709: testing algorithm implementations
• Optimization of algorithms with OPAL
• The elements of statistical learning. Data mining, inference, and prediction
• The optimization test environment
• The design and analysis of computer experiments.
• Design and analysis of computer experiments. With comments and a rejoinder by the authors
• Title not available (Why is that?)
• A note on performance profiles for benchmarking software
• A Simplex Method for Function Minimization
• Design and analysis of simulation experiments
• Benchmarking optimization software with performance profiles.
• Title not available (Why is that?)
• Title not available (Why is that?)
• An unconstrained optimization test functions collection
• Introduction to evolutionary computing
• Title not available (Why is that?)
• Title not available (Why is that?)
• Sensitivity Analysis in Practice
• Global sensitivity analysis: The primer
• Operational Reasoning for Concurrent Caml Programs and Weak Memory Models
• Finding Optimal Algorithmic Parameters Using Derivative‐Free Optimization
• Using experimental design to find effective parameter settings for heuristics
• Handbook of test problems in local and global optimization
• Global optimization of stochastic black-box systems via sequential kriging meta-models
• Design and Analysis of Optimization Algorithms Using Computational Statistics
• Multi-fidelity optimization via surrogate modelling
• Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
• Benchmarking Derivative-Free Optimization Algorithms
• Stochastic local search. Foundations and applications.
• Tuning an Algorithm Using Design of Experiments
• Title not available (Why is that?)
• Experimental Methods for the Analysis of Optimization Algorithms
• Title not available (Why is that?)
• Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
• Designing and reporting on computational experiments with heuristic methods
• Title not available (Why is that?)
• Design and analysis of simulation experiments
• Stacked regressions
• A new class of test functions for global optimization
• The Sequential Parameter Optimization Toolbox
• The future of experimental research
• Feature Article—Toward an Experimental Method for Algorithm Simulation
• Experimental evaluation of heuristic optimization algorithms: A tutorial
• Title not available (Why is that?)
• Parameter setting in evolutionary algorithms.
• Experimental research in evolutionary computation. The new experimentalism
• Mixed models for the analysis of optimization algorithms
• Evolutionary self-adaptation: a survey of operators and strategy parameters
• Randomly Generated Test Problems for Positive Definite Quadratic Programming
• Title not available (Why is that?)
• A Comparison of Several Current Optimization Methods, and the use of Transformations in Constrained Problems
• Feature Article—Reporting Computational Experiments with Parallel Algorithms: Issues, Measures, and Experts' Opinions
• Title not available (Why is that?)
• Test problem generator by neural network for algorithms that try solving nonlinear programming problems globally
• Best practices for comparing optimization algorithms
• No free lunch theorem: a review

This page was built for publication: Tuning Algorithms for Stochastic Black-Box Optimization: State of the Art and Future Perspectives

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