A numerical evaluation of several stochastic algorithms on selected continuous global optimization test problems
From MaRDI portal
Publication:813367
DOI10.1007/S10898-004-9972-2zbMATH Open1093.90028DBLPjournals/jgo/AliKZ05OpenAlexW2124548165WikidataQ57932105 ScholiaQ57932105MaRDI QIDQ813367FDOQ813367
Zelda B. Zabinsky, M. Montaz Ali, Charoenchai Khompatraporn
Publication date: 8 February 2006
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-004-9972-2
Recommendations
simulated annealingdifferential evolutionglobal optimizationgenetic algorithmimproving hit-and-runcontrolled random searchempirical comparison of algorithmshide-and-seekperformance profile and test problemspopulation set based global optimization
Nonconvex programming, global optimization (90C26) Stochastic programming (90C15) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04)
Cites Work
- Testing Unconstrained Optimization Software
- CUTEr and SifDec
- Generalized Simulated Annealing for Function Optimization
- Benchmarking optimization software with performance profiles.
- Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces
- Global optimization by controlled random search
- A controlled random search procedure for global optimisation
- A branch-and-bound algorithm for bound constrained optimization problems without derivatives
- Efficient Monte Carlo Procedures for Generating Points Uniformly Distributed over Bounded Regions
- Population set-based global optimization algorithms: some modifications and numerical studies
- The parallel genetic algorithm as function optimizer
- Generalized descent for global optimization
- Simulated annealing for constrained global optimization
- A deterministic algorithm for global optimization
- Global optimization and simulated annealing
- Comparative assessment of algorithms and software for global optimization
- Improving hit-and-run for global optimization
- Global optimization algorithms for a CAD workstation
- Application of stochastic global optimization algorithms to practical problems
- Global optimization and stochastic differential equations
- Modified controlled random search algorithms
Cited In (only showing first 100 items - show all)
- A trust-region-based derivative free algorithm for mixed integer programming
- Global optimization based on novel heuristics, low-discrepancy sequences and genetic algorithms
- A reassessment of the Snyman-Fatti dynamic search trajectory method for unconstrained global optimization
- Global optimization through a stochastic perturbation of the Polak-Ribière conjugate gradient method
- Minimizing the sum of many rational functions
- Stopping and restarting strategy for stochastic sequential search in global optimization
- Synthesis of the \(\beta\)-distribution as an aid to stochastic global optimization
- The optimization test environment
- An adaptive constraint handling technique for evolutionary algorithms
- Benchmarking nonlinear optimization software in technical computing environments
- Some variants of the controlled random search algorithm for global optimization
- Differential evolution algorithms using hybrid mutation
- Real-coded genetic algorithm with uniform random local search
- A discrete meta-control procedure for approximating solutions to binary programs
- A modification of the \(\alpha \mathrm{BB}\) method for box-constrained optimization and an application to inverse kinematics
- Modifications of real code genetic algorithm for global optimization
- Differential evolution algorithm with separated groups for multi-dimensional optimization problems
- A novel population initialization method for accelerating evolutionary algorithms
- A review of recent advances in global optimization
- Nonlinear optimization with GAMS /LGO
- \textsc{Oscars}-II: an algorithm for bound constrained global optimization
- Pattern discrete and mixed hit-and-run for global optimization
- A metamodel-assisted evolutionary algorithm for expensive optimization
- Rosenbrock artificial bee colony algorithm for accurate global optimization of numerical functions
- A simulated annealing driven multi-start algorithm for bound constrained global optimization
- A CARTOPT METHOD FOR BOUND-CONSTRAINED GLOBAL OPTIMIZATION
- Higher and lower-level knowledge discovery from Pareto-optimal sets
- Integrated crossover rules in real coded genetic algorithms
- Enhancing PSO methods for global optimization
- Differential evolution with preferential crossover
- On the convergence of two sequential Monte Carlo methods for maximum a posteriori sequence estimation and stochastic global optimization
- Heuristic-based firefly algorithm for bound constrained nonlinear binary optimization
- Differential evolution with generalized differentials
- A particle swarm pattern search method for bound constrained global optimization
- A comparative study of some real-coded genetic algorithms for unconstrained global optimization
- A Collection of Test Multiextremal Optimal Control Problems
- Enhancing the performance of biogeography-based optimization using polyphyletic migration operator and orthogonal learning
- Spectral projected gradient method for stochastic optimization
- A differential free point generation scheme in the differential evolution algorithm
- An investigation into the performance of particle swarm optimization with various chaotic maps
- Tight convex underestimators for \({\mathcal{C}^2}\)-continuous problems. II: Multivariate functions
- Particle swarm optimization for problems with variable number of dimensions
- One side cut accelerated random search
- Improved particle swarm algorithms for global optimization
- A nonmonotone line search method for stochastic optimization problems
- A numerical study of some modified differential evolution algorithms
- A filling function method for unconstrained global optimization
- Population model-based optimization
- An analytically derived cooling schedule for simulated annealing
- Gauss-Newton-based BFGS method with filter for unconstrained minimization
- A cover partitioning method for bound constrained global optimization
- Subset simulation for unconstrained global optimization
- Low dimensional simplex evolution: a new heuristic for global optimization
- Integrated experimental design and nonlinear optimization to handle computationally expensive models under resource constraints
- Globally convergent evolution strategies for constrained optimization
- Optimizing radial basis functions by d.c. programming and its use in direct search for global derivative-free optimization
- Self-adaptive randomized and rank-based differential evolution for multimodal problems
- The interacting-particle algorithm with dynamic heating and cooling
- Bounds tightening based on optimality conditions for nonconvex box-constrained optimization
- Global minimum cost design of a welded square stiffened plate supported at four corners
- Continuous global optimization through the generation of parametric curves
- Comparative assessment of algorithms and software for global optimization
- GLODS: global and local optimization using direct search
- An optimization algorithm inspired by social creativity systems
- A multi-start opposition-based particle swarm optimization algorithm with adaptive velocity for bound constrained global optimization
- Global optimization using a genetic algorithm with hierarchically structured population
- Formal Proofs for Nonlinear Optimization
- Operational framework for recent advances in backtracking search optimisation algorithm: a systematic review and performance evaluation
- Escaping local minima with local derivative-free methods: a numerical investigation
- Parallel and interacting stochastic approximation annealing algorithms for global optimisation
- Evolutionary annealing: global optimization in measure spaces
- Title not available (Why is that?)
- Analysis-of-Marginal-Tail-Means (ATM): A Robust Method for Discrete Black-Box Optimization
- A deterministic method for continuous global optimization using a dense curve
- Random derivative-free algorithm for solving unconstrained or bound constrained continuously differentiable non-linear problems
- Stochastic subgradient algorithm for nonsmooth nonconvex optimization
- A derivative-free variant called DFSA of Dekkers and Aarts' continuous simulated annealing algorithm
- Numerical studies of some generalized controlled random search algorithms
- Orchard algorithm (OA): a new meta-heuristic algorithm for solving discrete and continuous optimization problems
- Three new stochastic local search algorithms for continuous optimization problems
- Incremental quasi-Newton algorithms for solving a nonconvex, nonsmooth, finite-sum optimization problem
- Self-adaptive artificial bee colony
- Improved Alopex-based evolutionary algorithm by Gaussian copula estimation of distribution algorithm and its application to the Butterworth filter design
- Certification of real inequalities: templates and sums of squares
- Another evolution of generalized differential evolution: variable number of dimensions
- An overview of stochastic approximation Monte Carlo
- Best practices for comparing optimization algorithms
- 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
- A Supervised Learning Approach Involving Active Subspaces for an Efficient Genetic Algorithm in High-Dimensional Optimization Problems
- Implementing evolutionary optimization on actual quantum processors
- Testing the topographical global initialization strategy in the framework of an unconstrained optimization method
- Simulated Stochastic Approximation Annealing for Global Optimization With a Square-Root Cooling Schedule
- Efficient solution of many instances of a simulation-based optimization problem utilizing a partition of the decision space
- How difficult is nonlinear optimization? A practical solver tuning approach, with illustrative results
- A hybrid direct search and projected simplex gradient method for convex constrained minimization
- An improved evolution strategy with adaptive population size
- Using estimated gradients in bound-constrained global optimization
- Lévy flight artificial bee colony algorithm
- Finding global minima via kernel approximations
- Annealing evolutionary stochastic approximation Monte Carlo for global optimization
Uses Software
This page was built for publication: A numerical evaluation of several stochastic algorithms on selected continuous global optimization test problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q813367)
