A Literature Survey of Benchmark Functions For Global Optimization Problems

Abstract

Test functions are important to validate and compare the performance of optimization algorithms. There have been many test or benchmark functions reported in the literature; however, there is no standard list or set of benchmark functions. Ideally, test functions should have diverse properties so that can be truly useful to test new algorithms in an unbiased way. For this purpose, we have reviewed and compiled a rich set of 175 benchmark functions for unconstrained optimization problems with diverse properties in terms of modality, separability, and valley landscape. This is by far the most complete set of functions so far in the literature, and tt can be expected this complete set of functions can be used for validation of new optimization in the future.

47 pages

References in corpus (1)

• Test Problems in Optimization

Cited by in corpus (73)

• Nature-Inspired Optimization Algorithms: Challenges and Open Problems
• A consensus-based model for global optimization and its mean-field limit
• Cuckoo Search: A Brief Literature Review
• Operational Framework for Recent Advances in Backtracking Search Optimisation Algorithm: A Systematic Review and Performance Evaluation
• Are Cluster Validity Measures (In)valid?
• SoftAdapt: Techniques for Adaptive Loss Weighting of Neural Networks with Multi-Part Loss Functions
• Parallel Bayesian Global Optimization of Expensive Functions
• Bayesian Optimization with Output-Weighted Optimal Sampling
• Global optimization of Lipschitz functions
• On the Almost Sure Convergence of Stochastic Gradient Descent in Non-Convex Problems
• A supervised learning approach involving active subspaces for an efficient genetic algorithm in high-dimensional optimization problems
• AdaSwarm: Augmenting Gradient-Based optimizers in Deep Learning with Swarm Intelligence
• A directional Gaussian smoothing optimization method for computational inverse design in nanophotonics
• Robot Learning with Crash Constraints
• Spoke-Darts for High-Dimensional Blue-Noise Sampling
• Black-Box Optimization with Local Generative Surrogates
• Cross-validation based adaptive sampling for Gaussian process models
• Conformal Symplectic and Relativistic Optimization
• Binary interaction methods for high dimensional global optimization and machine learning
• Exploration-oriented sampling strategies for global surrogate modeling: A comparison between one-stage and adaptive methods
• Semi-steady-state Jaya Algorithm
• Are we Forgetting about Compositional Optimisers in Bayesian Optimisation?
• A hybrid swarm-based algorithm for single-objective optimization problems involving high-cost analyses
• Convergence analysis of beetle antennae search algorithm and its applications
• Time Efficiency in Optimization with a Bayesian-Evolutionary Algorithm
• A Generalized Evolutionary Metaheuristic (GEM) Algorithm for Engineering Optimization
• ITSO: A novel Inverse Transform Sampling-based Optimization algorithm for stochastic search
• Cost-aware Multi-objective Bayesian optimisation
• A Novel Meta-Heuristic Optimization Algorithm Inspired by the Spread of Viruses
• AdaDGS: An adaptive black-box optimization method with a nonlocal directional Gaussian smoothing gradient
• Stochastic models of Jaya and semi-steady-state Jaya algorithms
• Excursion Search for Constrained Bayesian Optimization under a Limited Budget of Failures
• Budgeted Batch Bayesian Optimization With Unknown Batch Sizes
• Adaptive surrogate models for parametric studies
• Transfer Learning with Gaussian Processes for Bayesian Optimization
• An Improved FOX Optimization Algorithm Using Adaptive Exploration and Exploitation for Global Optimization
• Black-box optimization on hyper-rectangle using Recursive Modified Pattern Search and application to ROC-based Classification Problem
• Artificial Intelligence Algorithms for Natural Language Processing and the Semantic Web Ontology Learning
• A Spectral Approach for the Design of Experiments: Design, Analysis and Algorithms
• Clustering sequence data with mixture Markov chains with covariates using multiple simplex constrained optimization routine (MSiCOR)
• Convex Relaxation Regression: Black-Box Optimization of Smooth Functions by Learning Their Convex Envelopes
• Active preference learning based on radial basis functions
• Social Algorithms
• A Bi-Objective Optimization Based Acquisition Strategy for Batch Bayesian Global Optimization
• Universal heavy-ball method for nonconvex optimization under Hölder continuous Hessians
• An Efficient Global Optimization Algorithm with Adaptive Estimates of the Local Lipschitz Constants
• GLISp-r: A preference-based optimization algorithm with convergence guarantees
• A fast and simple modification of Newton's method helping to avoid saddle points
• On the convergence of an improved and adaptive kinetic simulated annealing
• Iterative algorithm with structured diagonal Hessian approximation for solving nonlinear least squares problems
• Surrogate-based Optimization using Mutual Information for Computer Experiments (optim-MICE)
• Systematic Testing of Genetic Algorithms: A Metamorphic Testing based Approach
• Counterexample Guided Inductive Optimization
• A Cross Entropy based Optimization Algorithm with Global Convergence Guarantees
• Fast Calculation of the Knowledge Gradient for Optimization of Deterministic Engineering Simulations
• Multi-level informed optimization via decomposed Kriging for large design problems under uncertainty
• Subdomain Separability in Global Optimization
• SMART-MC: Characterizing the Dynamics of Multiple Sclerosis Therapy Transitions Using a Covariate-Based Markov Model
• A Largest Empty Hypersphere Metaheuristic for Robust Optimisation with Implementation Uncertainty
• Structured two-point stepsize gradient methods for nonlinear least squares
• A seven-point algorithm for piecewise smooth univariate minimization
• C-GLISp: Preference-Based Global Optimization under Unknown Constraints with Applications to Controller Calibration
• Swarm-based optimization with jumps: a kinetic BGK framework and convergence analysis
• Automatic Generation of Algorithms for Black-Box Robust Optimisation Problems
• Ideological Sublations: Resolution of Dialectic in Population-based Optimization
• Applying Evolutionary Metaheuristics for Parameter Estimation of Individual-Based Models
• Improving Intelligence of Evolutionary Algorithms Using Experience Share and Replay
• ASOC: An Adaptive Parameter-free Stochastic Optimization Techinique for Continuous Variables
• A Testing Environment for Continuous Colormaps
• Making Differentiable Architecture Search less local
• A Granular Sieving Algorithm for Deterministic Global Optimization
• Graduated Optimization of Black-Box Functions
• Vilin: Unconstrained Numerical Optimization Application