A numerical evaluation of several stochastic algorithms on selected continuous global optimization test problems
From MaRDI portal
(Redirected from Publication:813367)
Recommendations
Cites work
- A branch-and-bound algorithm for bound constrained optimization problems without derivatives
- A controlled random search procedure for global optimisation
- A deterministic algorithm for global optimization
- Application of stochastic global optimization algorithms to practical problems
- Benchmarking optimization software with performance profiles.
- CUTEr and SifDec
- Comparative assessment of algorithms and software for global optimization
- Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces
- Efficient Monte Carlo Procedures for Generating Points Uniformly Distributed over Bounded Regions
- Generalized Simulated Annealing for Function Optimization
- Generalized descent for global optimization
- Global optimization algorithms for a CAD workstation
- Global optimization and simulated annealing
- Global optimization and stochastic differential equations
- Global optimization by controlled random search
- Improving hit-and-run for global optimization
- Modified controlled random search algorithms
- Population set-based global optimization algorithms: some modifications and numerical studies
- Simulated annealing for constrained global optimization
- Testing Unconstrained Optimization Software
- The parallel genetic algorithm as function optimizer
Cited in
(only showing first 100 items - show all)- Single Observation Adaptive Search for Continuous Simulation Optimization
- 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
- Benchmarking deterministic optimization algorithms using an outranking approach
- Operational framework for recent advances in backtracking search optimisation algorithm: a systematic review and performance evaluation
- Formal Proofs for Nonlinear Optimization
- Minimizing the sum of many rational functions
- Global optimization through a stochastic perturbation of the Polak-Ribière conjugate gradient method
- Parallel and interacting stochastic approximation annealing algorithms for global optimisation
- Synthesis of the \(\beta\)-distribution as an aid to stochastic global optimization
- Stopping and restarting strategy for stochastic sequential search in global optimization
- Escaping local minima with local derivative-free methods: a numerical investigation
- The optimization test environment
- Evolutionary annealing: global optimization in measure spaces
- An adaptive constraint handling technique for evolutionary algorithms
- scientific article; zbMATH DE number 7705675 (Why is no real title available?)
- A deterministic method for continuous global optimization using a dense curve
- Analysis-of-Marginal-Tail-Means (ATM): A Robust Method for Discrete Black-Box Optimization
- Random derivative-free algorithm for solving unconstrained or bound constrained continuously differentiable non-linear problems
- A derivative-free variant called DFSA of Dekkers and Aarts' continuous simulated annealing algorithm
- A CARTopt method for bound-constrained global optimization
- Some variants of the controlled random search algorithm for global optimization
- Benchmarking nonlinear optimization software in technical computing environments
- Stochastic subgradient algorithm for nonsmooth nonconvex optimization
- Numerical studies of some generalized controlled random search algorithms
- 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
- Orchard algorithm (OA): a new meta-heuristic algorithm for solving discrete and continuous optimization problems
- Modifications of real code genetic algorithm for global optimization
- Three new stochastic local search algorithms for continuous optimization problems
- Differential evolution algorithm with separated groups for multi-dimensional optimization problems
- A review of recent advances in global optimization
- A novel population initialization method for accelerating evolutionary algorithms
- Self-adaptive artificial bee colony
- Incremental quasi-Newton algorithms for solving a nonconvex, nonsmooth, finite-sum optimization problem
- Certification of real inequalities: templates and sums of squares
- Nonlinear optimization with GAMS /LGO
- Improved Alopex-based evolutionary algorithm by Gaussian copula estimation of distribution algorithm and its application to the Butterworth filter design
- \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
- Another evolution of generalized differential evolution: variable number of dimensions
- Best practices for comparing optimization algorithms
- An overview of stochastic approximation Monte Carlo
- 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 simulated annealing driven multi-start algorithm for bound constrained global optimization
- A Supervised Learning Approach Involving Active Subspaces for an Efficient Genetic Algorithm in High-Dimensional Optimization Problems
- Higher and lower-level knowledge discovery from Pareto-optimal sets
- Testing the topographical global initialization strategy in the framework of an unconstrained optimization method
- Integrated crossover rules in real coded genetic algorithms
- Enhancing PSO methods for global optimization
- Implementing evolutionary optimization on actual quantum processors
- Differential evolution with preferential crossover
- 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
- 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
- Enhancing the performance of biogeography-based optimization using polyphyletic migration operator and orthogonal learning
- A particle swarm pattern search method for bound constrained global optimization
- 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?
- A comparative study of some real-coded genetic algorithms for unconstrained global optimization
- 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
- A hybrid direct search and projected simplex gradient method for convex constrained minimization
- One side cut accelerated random search
- Improved particle swarm algorithms for global optimization
- Particle swarm optimization for problems with variable number of dimensions
- A numerical study of some modified differential evolution algorithms
- A nonmonotone line search method for stochastic optimization problems
- A filling function method for unconstrained global optimization
- Population model-based optimization
- An improved evolution strategy with adaptive population size
- An analytically derived cooling schedule for simulated annealing
- Gauss-Newton-based BFGS method with filter for unconstrained minimization
- Subset simulation for unconstrained global optimization
- Low dimensional simplex evolution: a new heuristic for global optimization
- A cover partitioning method for bound constrained global optimization
- Integrated experimental design and nonlinear optimization to handle computationally expensive models under resource constraints
- Globally convergent evolution strategies for constrained optimization
- Using estimated gradients in bound-constrained global optimization
- Lévy flight artificial bee colony algorithm
- On benchmarking stochastic global optimization algorithms
- Self-adaptive randomized and rank-based differential evolution for multimodal problems
- Optimizing radial basis functions by d.c. programming and its use in direct search for global derivative-free optimization
- The interacting-particle algorithm with dynamic heating and cooling
- Bounds tightening based on optimality conditions for nonconvex box-constrained optimization
- Finding global minima via kernel approximations
- Global minimum cost design of a welded square stiffened plate supported at four corners
- Some modifications of low-dimensional simplex evolution and their convergence
- Continuous global optimization through the generation of parametric curves
- Annealing evolutionary stochastic approximation Monte Carlo for global optimization
- Annealing evolutionary stochastic approximation Monte Carlo for global optimization
- Comparative assessment of algorithms and software for global optimization
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)
