A partition-based convergence framework for population-based optimization algorithms
From MaRDI portal
Recommendations
- A framework using nested partitions algorithm for convergence analysis of population distribution-based methods
- A global convergence algorithm of particle swarm optimization and its convergence analysis
- A framework for constrained optimization problems based on a modified particle swarm optimization
- On convergence analysis of particle swarm optimization algorithm
- Rough Sets and Current Trends in Computing
Cites work
- A First Course in Optimization Theory
- A unified framework for population-based metaheuristics
- ACO algorithms with guaranteed convergence to the optimal solution
- Benchmarking Derivative-Free Optimization Algorithms
- Branch and bound for piecewise linear neural network verification
- Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces
- Finite Markov chain analysis of classical differential evolution algorithm
- Fuzzy particle swarm optimization with nearest-better neighborhood for multimodal optimization
- Global optimization by multilevel partition
- Linear scaling and the DIRECT algorithm
- Lipschitzian optimization without the Lipschitz constant
- Minimization by Random Search Techniques
- MrDIRECT: a multilevel robust DIRECT algorithm for global optimization problems
- Probabilistic convergence analysis of the stochastic particle swarm optimization model without the stagnation assumption
- Reprint of: On convergence analysis of particle swarm optimization algorithm
Cited in
(1)
This page was built for publication: A partition-based convergence framework for population-based optimization algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6492619)
