Global optimization using dimensional jumping and fuzzy adaptive simulated annealing

Authors:
Hime A. Oliveira, Jr.;Antonio Petraglia
Affiliations:
Federal University of Rio de Janeiro, Program of Electrical Engineering, COPPE/UFRJ, Rio de Janeiro, Brazil;Federal University of Rio de Janeiro, Program of Electrical Engineering, COPPE/UFRJ, Rio de Janeiro, Brazil
Venue:
Applied Soft Computing
Year:
2011

Citing 6
Cited 0

Minimizing multimodal functions of continuous variables with the “simulated annealing” algorithm: Corrigenda for this article is available here

ACM Transactions on Mathematical Software (TOMS)
Differential Evolution: A Practical Approach to Global Optimization (Natural Computing Series)

Differential Evolution: A Practical Approach to Global Optimization (Natural Computing Series)
Global Optimization with Non-Convex Constraints - Sequential and Parallel Algorithms (Nonconvex Optimization and its Applications Volume 45) (Nonconvex Optimization and Its Applications)

Global Optimization with Non-Convex Constraints - Sequential and Parallel Algorithms (Nonconvex Optimization and its Applications Volume 45) (Nonconvex Optimization and Its Applications)
Differential Evolution: In Search of Solutions (Springer Optimization and Its Applications)

Differential Evolution: In Search of Solutions (Springer Optimization and Its Applications)
Lipschitz and Hölder global optimization using space-filling curves

Applied Numerical Mathematics
Very fast simulated re-annealing

Mathematical and Computer Modelling: An International Journal

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper proposes a new multi-start, stochastic global optimization algorithm that uses dimensional reduction techniques based upon approximations of space-filling curves, simulated annealing and particle swarm optimization, aiming at finding global minima of real-valued functions that are not necessarily well behaved, that is, are not required to be differentiable, continuous, or even satisfying Lipschitz conditions. The overall idea is as follows: given a real-valued function F with a multidimensional and compact domain D, the method builds an equivalent one-dimensional problem by composing F with a linearization of D, searches for a small population of candidates and returns to the original high-dimensional domain, this time with a small set of promising starting points.