An Alternating Intensification/Diversification (AID) method is proposed to tackle global optimization problems, focusing here on global function minimization over continuous variables. Our method is a local search procedure that is particularly easy to implement, and can readily be embedded as a supporting strategy within more sophisticated methods that make use of population-based designs. We perform computational tests comparing the AID method to 20 other algorithms, many of them representing a similar or higher level of sophistication, on a total of 28 benchmark functions. The results show that the new approach generally obtains good quality solutions for unconstrained global optimization problems, suggesting the utility of its underlyin...
Recent developments in (Global) Optimization are surveyed in this paper. We collected and commented ...
We propose a new globalization strategy that can be used in unconstrained optimization algorithms to...
L'idée générale de ce travail est de proposer une nouvelle classe d'algorithmes permettant d'amélior...
Optimization problems abound in most fields of science, engineering, and technology. In many of thes...
Geometric and information frameworks for constructing global optimization algorithms are considered,...
In this paper we deal with the use of local searches within global optimization algorithms. We discu...
We propose in this paper novel global descent methods for unconstrained global optimization problems...
The interface between computer science and operations research has drawn much attention recently esp...
A large number of algorithms introduced in the literature to find the global minimum of a real func...
AbstractThis paper considers the nonlinearly constrained continuous global minimization problem. Bas...
This thesis looks at some theoretical and practical aspects of global optimization - as we shall see...
Global optimization problems involve essential difficulties as, for instance, avoiding convergence t...
The global optimization of a mathematical model determines the best parameters such that a target or...
In this survey paper we present some results obtained in the Centre for Informatics and Applied Opti...
The global optimization of a mathematical model determines the best parameters such that a target or...
Recent developments in (Global) Optimization are surveyed in this paper. We collected and commented ...
We propose a new globalization strategy that can be used in unconstrained optimization algorithms to...
L'idée générale de ce travail est de proposer une nouvelle classe d'algorithmes permettant d'amélior...
Optimization problems abound in most fields of science, engineering, and technology. In many of thes...
Geometric and information frameworks for constructing global optimization algorithms are considered,...
In this paper we deal with the use of local searches within global optimization algorithms. We discu...
We propose in this paper novel global descent methods for unconstrained global optimization problems...
The interface between computer science and operations research has drawn much attention recently esp...
A large number of algorithms introduced in the literature to find the global minimum of a real func...
AbstractThis paper considers the nonlinearly constrained continuous global minimization problem. Bas...
This thesis looks at some theoretical and practical aspects of global optimization - as we shall see...
Global optimization problems involve essential difficulties as, for instance, avoiding convergence t...
The global optimization of a mathematical model determines the best parameters such that a target or...
In this survey paper we present some results obtained in the Centre for Informatics and Applied Opti...
The global optimization of a mathematical model determines the best parameters such that a target or...
Recent developments in (Global) Optimization are surveyed in this paper. We collected and commented ...
We propose a new globalization strategy that can be used in unconstrained optimization algorithms to...
L'idée générale de ce travail est de proposer une nouvelle classe d'algorithmes permettant d'amélior...