Add to ORKGIn this talk we consider the problem of finding all the global solutions of a nonlinear optimization problem. We propose a new algorithm that combines the simulated annealing method with a stretching function technique in order to generate a sequence of global optimization problems that are defined whenever a new global solution is identified. Computational experiments with a set of well-known test problems show that the proposed method is effective
We consider the problem of finding all the global (and some local) minimizers of a given nonlinear o...
In the early 1980s, Kirkpatrick et al. [1] and, independently, Černý [2] introduced simulated anneal...
Simulated annealing is a relatively new technique for solving global optimization problems. The Hide...
In this work we consider the problem of finding all the global maximizers of a given nonlinear optim...
In this work we consider the problem of finding all the global maximizers of a given nonlinear optim...
In this paper we consider the problem of finding all the global maximizers of a given nonlinear opti...
Work partially supported by FCT grant POCTI/MAT/58957/2004.In this work we consider the problem of f...
In this paper we are concerned with global optimization, which can be defined as the problem of find...
This paper presents a new simulated annealing algorithm to solve constrained multi-global optimizati...
In a multiglobal optimization problem we aim to find all the global solutions of a constrained nonli...
In a multiglobal optimization problem we aim to find all the global solutions of a constrained nonli...
Abstract. Global optimization involves the difficult task of the identification of global extremitie...
To solve nonlinear semi-infinite programming problems we use a global reduction method. The method r...
We present a reduction type algorithm for solving nonlinear semi-infinite programming problems. The ...
Simulated annealing is a global optimization method that distinguishes between different local optim...
We consider the problem of finding all the global (and some local) minimizers of a given nonlinear o...
In the early 1980s, Kirkpatrick et al. [1] and, independently, Černý [2] introduced simulated anneal...
Simulated annealing is a relatively new technique for solving global optimization problems. The Hide...
In this work we consider the problem of finding all the global maximizers of a given nonlinear optim...
In this work we consider the problem of finding all the global maximizers of a given nonlinear optim...
In this paper we consider the problem of finding all the global maximizers of a given nonlinear opti...
Work partially supported by FCT grant POCTI/MAT/58957/2004.In this work we consider the problem of f...
In this paper we are concerned with global optimization, which can be defined as the problem of find...
This paper presents a new simulated annealing algorithm to solve constrained multi-global optimizati...
In a multiglobal optimization problem we aim to find all the global solutions of a constrained nonli...
In a multiglobal optimization problem we aim to find all the global solutions of a constrained nonli...
Abstract. Global optimization involves the difficult task of the identification of global extremitie...
To solve nonlinear semi-infinite programming problems we use a global reduction method. The method r...
We present a reduction type algorithm for solving nonlinear semi-infinite programming problems. The ...
Simulated annealing is a global optimization method that distinguishes between different local optim...
We consider the problem of finding all the global (and some local) minimizers of a given nonlinear o...
In the early 1980s, Kirkpatrick et al. [1] and, independently, Černý [2] introduced simulated anneal...
Simulated annealing is a relatively new technique for solving global optimization problems. The Hide...