Shuffled complex evolution approach for effective and efficient global minimization
Journal of Optimization Theory and Applications
Swarm intelligence
Convergence Properties of the Nelder--Mead Simplex Method in Low Dimensions
SIAM Journal on Optimization
Convergence of the Nelder--Mead Simplex Method to a Nonstationary Point
SIAM Journal on Optimization
SIAM Journal on Optimization
Journal of Global Optimization
Proceedings of the 6th International Conference on Genetic Algorithms
Modern Heuristic Optimization Techniques With Applications To Power Systems
Modern Heuristic Optimization Techniques With Applications To Power Systems
Differential evolution with dynamic stochastic selection for constrained optimization
Information Sciences: an International Journal
Multi-strategy ensemble particle swarm optimization for dynamic optimization
Information Sciences: an International Journal
Self-adaptive multimethod search for global optimization in real-parameter spaces
IEEE Transactions on Evolutionary Computation
A genetic algorithm that adaptively mutates and never revisits
IEEE Transactions on Evolutionary Computation
Differential evolution using a neighborhood-based mutation operator
IEEE Transactions on Evolutionary Computation
Information Sciences: an International Journal
No free lunch theorems for optimization
IEEE Transactions on Evolutionary Computation
The fully informed particle swarm: simpler, maybe better
IEEE Transactions on Evolutionary Computation
A Cooperative approach to particle swarm optimization
IEEE Transactions on Evolutionary Computation
IEEE Transactions on Evolutionary Computation
Evolving Problems to Learn About Particle Swarm Optimizers and Other Search Algorithms
IEEE Transactions on Evolutionary Computation
Opposition-Based Differential Evolution
IEEE Transactions on Evolutionary Computation
Accelerating Differential Evolution Using an Adaptive Local Search
IEEE Transactions on Evolutionary Computation
IEEE Transactions on Image Processing
A cooperative particle swarm optimizer with statistical variable interdependence learning
Information Sciences: an International Journal
On fast and accurate block-based motion estimation algorithms using particle swarm optimization
Information Sciences: an International Journal
Niching particle swarm optimization with local search for multi-modal optimization
Information Sciences: an International Journal
Information Sciences: an International Journal
Hi-index | 0.07 |
Global optimization of high-dimensional problems in practical applications remains a major challenge to the research community of evolutionary computation. The weakness of randomization-based evolutionary algorithms in searching high-dimensional spaces is demonstrated in this paper. A new strategy, SP-UCI is developed to treat complexity caused by high dimensionalities. This strategy features a slope-based searching kernel and a scheme of maintaining the particle population's capability of searching over the full search space. Examinations of this strategy on a suite of sophisticated composition benchmark functions demonstrate that SP-UCI surpasses two popular algorithms, particle swarm optimizer (PSO) and differential evolution (DE), on high-dimensional problems. Experimental results also corroborate the argument that, in high-dimensional optimization, only problems with well-formative fitness landscapes are solvable, and slope-based schemes are preferable to randomization-based ones.