A literature survey of benchmark functions for global optimisation problems
From MaRDI portal
(Redirected from Publication:391691)
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.
Recommendations
Cited in
(only showing first 100 items - show all)- Surrogate-based optimization with adaptive parallel infill strategy enhanced by inaccurate multi-objective search
- Another three-term conjugate gradient method close to the memoryless BFGS for large-scale unconstrained optimization problems
- Atomic orbital search: a novel metaheuristic algorithm
- Swarm-based optimization with random descent
- A new algorithm with structured diagonal Hessian approximation for solving nonlinear least squares problems and application to robotic motion control
- Operational framework for recent advances in backtracking search optimisation algorithm: a systematic review and performance evaluation
- Global optimization based on active preference learning with radial basis functions
- An adaptive Polyak heavy-ball method
- Structured spectral algorithm with a nonmonotone line search for nonlinear least squares
- Structured diagonal Gauss-Newton method for nonlinear least squares
- A concurrent implementation of the surrogate management framework with application to cardiovascular shape optimization
- A comparative study on recently-introduced nature-based global optimization methods in complex mechanical system design
- Automatic generation of algorithms for robust optimisation problems using grammar-guided genetic programming
- scientific article; zbMATH DE number 7705675 (Why is no real title available?)
- An unconstrained optimization test functions collection
- Analysis-of-Marginal-Tail-Means (ATM): A Robust Method for Discrete Black-Box Optimization
- Conformal symplectic and relativistic optimization
- Kriging-based unconstrained global optimization through multi-point sampling
- A new swarm intelligence approach for clustering based on krill herd with elitism strategy
- Matrix methods for the simplicial Bernstein representation and for the evaluation of multivariate polynomials
- Geodesic and contour optimization using conformal mapping
- Trends in Consensus-Based Optimization
- Some improved Dai-Yuan conjugate gradient methods for large-scale unconstrained optimization problems
- A Benchmark Study on Steepest Descent and Conjugate Gradient Methods-Line Search Conditions Combinations in Unconstrained Optimization
- Stability analysis of particle dynamics in gravitational search optimization algorithm
- Ethnic groups chaos game optimization algorithm for optimal design of steel structures considering seismic risk
- Honey badger algorithm: new metaheuristic algorithm for solving optimization problems
- Parallel Bayesian global optimization of expensive functions
- Mesh-based Nelder-Mead algorithm for inequality constrained optimization
- An approximation algorithm for multi-objective optimization problems using a box-coverage
- Bayesian optimization with output-weighted optimal sampling
- A spectral approach for the design of experiments: design, analysis and algorithms
- A new hybrid optimization algorithm for the estimation of Archie parameters
- Integrated optimization algorithm: a metaheuristic approach for complicated optimization
- Efficient solution of quadratically constrained quadratic subproblems within the mesh adaptive direct search algorithm
- Global solution of constrained min-max problems with inflationary differential evolution
- Extended prey-predator algorithm with a group hunting scenario
- Optimal Learning for Stochastic Optimization with Nonlinear Parametric Belief Models
- Approximation in the extended functional tensor train format
- Combining Bayesian optimization and Lipschitz optimization
- Hybrid particle swarm optimization and pattern search algorithm
- Elephant swarm water search algorithm for global optimization
- A spectral KRMI conjugate gradient method under the strong-Wolfe line search
- A new class of nonlinear conjugate gradient method for unconstrained optimization models and its application in portfolio selection
- \texttt{GLISp-r}: a preference-based optimization algorithm with convergence guarantees
- Constrained Consensus-Based Optimization
- A largest empty hypersphere metaheuristic for robust optimisation with implementation uncertainty
- Cross-validation-based adaptive sampling for Gaussian process models
- Adaptive surrogate-based harmony search algorithm for design optimization of variable stiffness composite materials
- Purposeful cross-validation: a novel cross-validation strategy for improved surrogate optimizability
- Global dynamic harmony search algorithm: GDHS
- An adaptive multi-objective optimization method for optimum design of distribution networks
- Beetle antennae search for neural network model with application to population prediction: an intelligent optimization algorithm
- Best practices for comparing optimization algorithms
- A new evolutionary optimization method based on center of mass
- Delayed weighted gradient method with simultaneous step-sizes for strongly convex optimization
- A structured quasi-Newton algorithm with nonmonotone search strategy for structured NLS problems and its application in robotic motion control
- A Supervised Learning Approach Involving Active Subspaces for an Efficient Genetic Algorithm in High-Dimensional Optimization Problems
- A modified reptile search algorithm for parametric estimation of fractional order model of lithium battery
- Black-box optimization on hyper-rectangle using recursive modified pattern search and application to ROC-based classification problem
- A new descent algorithm using the three-step discretization method for solving unconstrained optimization problems
- Anisotropic diffusion in consensus-based optimization on the sphere
- A structured Fletcher-Revees spectral conjugate gradient method for unconstrained optimization with application in robotic model
- An efficient new hybrid CG-method as convex combination of DY and CD and HS algorithms
- Implementing evolutionary optimization on actual quantum processors
- Affine invariance of \textit{meta}-heuristic algorithms
- Novel first and second order numerical differentiation techniques and their application to nonlinear analysis of Kirchhoff-Love shells
- Method of outer approximations and adaptive approximations for a class of matrix games
- Binary interaction methods for high dimensional global optimization and machine learning
- Efficient solution of many instances of a simulation-based optimization problem utilizing a partition of the decision space
- Hydrological cycle algorithm for continuous optimization problems
- Two efficient nonlinear conjugate gradient methods for Riemannian manifolds
- Granular sieving algorithm for selecting best n$$ n $$ parameters
- Power system oscillation damping controller design: a novel approach of integrated HHO-PSO algorithm
- A globally convergent modified multivariate version of the method of moving asymptotes
- A quasi fractional order gradient descent method with adaptive stepsize and its application in system identification
- Honey formation optimization framework for design problems
- scientific article; zbMATH DE number 7415103 (Why is no real title available?)
- A FPGA-based accelerated architecture for the continuous GRASP
- Consensus-based global optimization with personal best
- Particle swarm metaheuristics for robust optimisation with implementation uncertainty
- Efficient hybrid Bayesian optimization algorithm with adaptive expected improvement acquisition function
- Structured adaptive spectral-based algorithms for nonlinear least squares problems with robotic arm modelling applications
- Asymptotic optimality of myopic ranking and selection procedures
- A new hybrid CG method as convex combination
- Benchmark function generators for single-objective robust optimisation algorithms
- From particle swarm optimization to consensus based optimization: stochastic modeling and mean-field limit
- Mean‐standard deviation model for minimum cost flow problem
- Multi-robot co-operation for stick carrying application using hybridization of meta-heuristic algorithm
- Global optimization via inverse distance weighting and radial basis functions
- Efficient hierarchical surrogate-assisted differential evolution for high-dimensional expensive optimization
- GGA: a modified genetic algorithm with gradient-based local search for solving constrained optimization problems
- Hierarchical gradient-based optimization with B-splines on sparse grids
- Benchmark test functions with \(2^n\)-solutions
- An effective refined artificial bee colony algorithm for numerical optimisation
- Quadratic interpolation boosted black widow spider-inspired optimization algorithm with wavelet mutation
- Quantum evolutionary algorithm with rotational gate and \(H_\epsilon\)-gate updating in real and integer domains for optimization
- A Metropolis-class sampler for targets with non-convex support
- Arbitrarily tight \(\alpha \mathrm{BB}\) underestimators of general non-linear functions over sub-optimal domains
- Subdomain separability in global optimization
This page was built for publication: A literature survey of benchmark functions for global optimisation problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q391691)
