Pages that link to "Item:Q813367"

The following pages link to A numerical evaluation of several stochastic algorithms on selected continuous global optimization test problems (Q813367):

Displaying 50 items.

• \textsc{Oscars}-II: an algorithm for bound constrained global optimization (Q2022219) (← links)
• Optimal feature selection for SAR image classification using biogeography-based optimization (BBO), artificial bee colony (ABC) and support vector machine (SVM): a combined approach of optimization and machine learning (Q2027161) (← links)
• Stopping and restarting strategy for stochastic sequential search in global optimization (Q2269595) (← links)
• Operational framework for recent advances in backtracking search optimisation algorithm: a systematic review and performance evaluation (Q2287628) (← links)
• Certification of real inequalities: templates and sums of squares (Q2349133) (← links)
• GLODS: global and local optimization using direct search (Q2350072) (← links)
• The optimization test environment (Q2357211) (← links)
• Modifications of real code genetic algorithm for global optimization (Q2378969) (← links)
• Integrated crossover rules in real coded genetic algorithms (Q2432882) (← links)
• Evolutionary annealing: global optimization in measure spaces (Q2442637) (← links)
• A derivative-free variant called DFSA of Dekkers and Aarts' continuous simulated annealing algorithm (Q2445214) (← links)
• One side cut accelerated random search (Q2448186) (← links)
• A particle swarm pattern search method for bound constrained global optimization (Q2454725) (← links)
• A differential free point generation scheme in the differential evolution algorithm (Q2457919) (← links)
• Nonlinear optimization with GAMS /LGO (Q2460112) (← links)
• An analytically derived cooling schedule for simulated annealing (Q2460137) (← links)
• How to assess and report the performance of a stochastic algorithm on a benchmark problem: \textit{mean} or \textit{best} result on a number of runs? (Q2463834) (← links)
• Improved particle swarm algorithms for global optimization (Q2479121) (← links)
• A trust-region-based derivative free algorithm for mixed integer programming (Q2515071) (← links)
• A novel population initialization method for accelerating evolutionary algorithms (Q2519634) (← links)
• A numerical study of some modified differential evolution algorithms (Q2572887) (← links)
• Three new stochastic local search algorithms for continuous optimization problems (Q2636613) (← links)
• Differential evolution algorithms using hybrid mutation (Q2643625) (← links)
• Firefly penalty-based algorithm for bound constrained mixed-integer nonlinear programming (Q2810112) (← links)
• Lévy flight artificial bee colony algorithm (Q2822324) (← links)
• Benchmarking deterministic optimization algorithms using an outranking approach (Q2829578) (← links)
• A cover partitioning method for bound constrained global optimization (Q2905347) (← links)
• Numerical studies of some generalized controlled random search algorithms (Q2911580) (← links)
• Self-adaptive artificial bee colony (Q2926475) (← links)
• A comparative study of some real-coded genetic algorithms for unconstrained global optimization (Q3096889) (← links)
• A CARTOPT METHOD FOR BOUND-CONSTRAINED GLOBAL OPTIMIZATION (Q3191188) (← links)
• An improved evolution strategy with adaptive population size (Q3453419) (← links)
• Random derivative-free algorithm for solving unconstrained or bound constrained continuously differentiable non-linear problems (Q3458824) (← links)
• Improved Alopex-based evolutionary algorithm by Gaussian copula estimation of distribution algorithm and its application to the Butterworth filter design (Q4638024) (← links)
• An adaptive constraint handling technique for evolutionary algorithms (Q4916319) (← links)
• Some modifications of low-dimensional simplex evolution and their convergence (Q4924104) (← links)
• Simulated Stochastic Approximation Annealing for Global Optimization With a Square-Root Cooling Schedule (Q4975420) (← links)
• A Supervised Learning Approach Involving Active Subspaces for an Efficient Genetic Algorithm in High-Dimensional Optimization Problems (Q5005000) (← links)
• Particle swarm optimization for problems with variable number of dimensions (Q5058732) (← links)
• A nonmonotone line search method for stochastic optimization problems (Q5086883) (← links)
• Escaping local minima with local derivative-free methods: a numerical investigation (Q5093686) (← links)
• Single Observation Adaptive Search for Continuous Simulation Optimization (Q5131547) (← links)
• Formal Proofs for Nonlinear Optimization (Q5195260) (← links)
• A Collection of Test Multiextremal Optimal Control Problems (Q5244697) (← links)
• Annealing evolutionary stochastic approximation Monte Carlo for global optimization (Q5917855) (← links)
• Annealing evolutionary stochastic approximation Monte Carlo for global optimization (Q5970614) (← links)
• Another evolution of generalized differential evolution: variable number of dimensions (Q6048104) (← links)
• Implementing evolutionary optimization on actual quantum processors (Q6066004) (← links)
• Conditional gradient and bisection algorithms for non-convex optimization problem with random perturbation (Q6106813) (← links)
• Orchard algorithm (OA): a new meta-heuristic algorithm for solving discrete and continuous optimization problems (Q6161963) (← links)