Pages that link to "Item:Q391691"

The following pages link to A literature survey of benchmark functions for global optimisation problems (Q391691):

Displaying 50 items.

• Method of outer approximations and adaptive approximations for a class of matrix games (Q328448) (← links)
• A new hybrid algorithm of scatter search and Nelder-Mead algorithms to optimize joint economic lot sizing problem (Q495077) (← links)
• Global dynamic harmony search algorithm: GDHS (Q529904) (← links)
• Elephant swarm water search algorithm for global optimization (Q724625) (← links)
• Another three-term conjugate gradient method close to the memoryless BFGS for large-scale unconstrained optimization problems (Q821530) (← links)
• Atomic orbital search: a novel metaheuristic algorithm (Q823488) (← links)
• Mesh-based Nelder-Mead algorithm for inequality constrained optimization (Q1616932) (← links)
• A largest empty hypersphere metaheuristic for robust optimisation with implementation uncertainty (Q1634054) (← links)
• Best practices for comparing optimization algorithms (Q1642983) (← links)
• A new descent algorithm using the three-step discretization method for solving unconstrained optimization problems (Q1649149) (← links)
• Efficient solution of many instances of a simulation-based optimization problem utilizing a partition of the decision space (Q1657403) (← links)
• Hydrological cycle algorithm for continuous optimization problems (Q1659261) (← links)
• Arbitrarily tight \(\alpha \mathrm{BB}\) underestimators of general non-linear functions over sub-optimal domains (Q1668799) (← links)
• Stability analysis of particle dynamics in gravitational search optimization algorithm (Q1671295) (← links)
• Geodesic and contour optimization using conformal mapping (Q1675629) (← links)
• Hierarchical winner-take-all particle swarm optimization social network for neural model fitting (Q1705051) (← links)
• A structured diagonal Hessian approximation method with evaluation complexity analysis for nonlinear least squares (Q1715713) (← links)
• MAKHA -- a new hybrid swarm intelligence global optimization algorithm (Q1736664) (← links)
• A new swarm intelligence approach for clustering based on krill herd with elitism strategy (Q1736727) (← links)
• Matrix methods for the simplicial Bernstein representation and for the evaluation of multivariate polynomials (Q1740149) (← links)
• Extended prey-predator algorithm with a group hunting scenario (Q1748498) (← links)
• Efficient solution of quadratically constrained quadratic subproblems within the mesh adaptive direct search algorithm (Q1754299) (← links)
• A simplicial homology algorithm for Lipschitz optimisation (Q1756767) (← links)
• Combining cross-entropy and MADS methods for inequality constrained global optimization (Q1981930) (← links)
• Adaptive surrogate-based harmony search algorithm for design optimization of variable stiffness composite materials (Q2021910) (← links)
• Global optimization via inverse distance weighting and radial basis functions (Q2023666) (← links)
• A structured quasi-Newton algorithm with nonmonotone search strategy for structured NLS problems and its application in robotic motion control (Q2029652) (← links)
• A comparison of extremal optimization, differential evolution and particle swarm optimization methods for well placement design in groundwater management (Q2040717) (← links)
• A FPGA-based accelerated architecture for the continuous GRASP (Q2047509) (← links)
• Consensus-based global optimization with personal best (Q2047862) (← links)
• Global optimization based on active preference learning with radial basis functions (Q2051251) (← links)
• Efficient hierarchical surrogate-assisted differential evolution for high-dimensional expensive optimization (Q2053862) (← links)
• GGA: a modified genetic algorithm with gradient-based local search for solving constrained optimization problems (Q2056278) (← links)
• A Metropolis-class sampler for targets with non-convex support (Q2058894) (← links)
• Solving unconstrained optimization problems via hybrid CD-DY conjugate gradient methods with applications (Q2068628) (← links)
• Hopping between distant basins (Q2079697) (← links)
• An opposition-based butterfly optimization algorithm with adaptive elite mutation in solving complex high-dimensional optimization problems (Q2095669) (← links)
• An adaptive Polyak heavy-ball method (Q2102380) (← links)
• Structured spectral algorithm with a nonmonotone line search for nonlinear least squares (Q2106221) (← links)
• Structured diagonal Gauss-Newton method for nonlinear least squares (Q2115053) (← links)
• Bayesian optimization with output-weighted optimal sampling (Q2123965) (← links)
• Hybrid particle swarm optimization and pattern search algorithm (Q2129208) (← links)
• An approximation algorithm for multi-objective optimization problems using a box-coverage (Q2141729) (← links)
• Efficient unconstrained black box optimization (Q2146451) (← links)
• A hybrid conjugate gradient based approach for solving unconstrained optimization and motion control problems (Q2146720) (← links)
• Novel first and second order numerical differentiation techniques and their application to nonlinear analysis of Kirchhoff-Love shells (Q2150252) (← links)
• Binary interaction methods for high dimensional global optimization and machine learning (Q2152587) (← links)
• A concurrent implementation of the surrogate management framework with application to cardiovascular shape optimization (Q2218904) (← links)
• An effective refined artificial bee colony algorithm for numerical optimisation (Q2225163) (← links)
• Variance-based adaptive sequential sampling for polynomial chaos expansion (Q2246308) (← links)