Multilocal programming aims to locate all the local solutions of an optimization problem. A stochastic method based on a multistart strategy and a derivative-free filter local search for solving general constrained optimization problems is presented. The filter methodology is integrated into a coordinate search paradigm in order to generate a set of trial approximations that might be acceptable if they improve the constraint violation or the objective function value relative to the current one. Preliminary numerical experiments with a benchmark set of problems show the effectiveness of the proposed method.FC
Locating and identifying points as global minimizers is, in general, a hard and time-consuming task....
Publicado em "AIP Conference Proceedings", vol. 1558In this paper, we present a derivative-free mult...
this article is an extension of the multistart method. Having drawn a quasirandom sample of N points...
Multilocal programming aims to locate all the local solutions of an optimization problem. A stochas...
Multilocal programming aims to locate all the local solutions of an optimization problem. A stochas...
A stochastic global optimization method based on a multistart strategy and a derivative-free filter ...
A stochastic global optimization method based on a multistart strategy and a derivative-free filter ...
Multilocal programming aims to identify all the local solutions of constrained optimization problems...
Multilocal programming aims to identify all the local solutions of constrained optimization problems...
A multistart technique coupled with a derivative-free lter local search algorithm for locating all...
Multilocal programming aims to identify all the local solutions of constrained optimization problems...
Preprint versionMultilocal programming aims to identify all local minimizers of unconstrained or co...
Multilocal programming aims to identify all local maximizers of unconstrained or constrained nonline...
Multilocal programming aims to identify all the local (global and non-global) so-lutions of constrai...
The optimization ofmultimodal functions is a challenging task, in particular when derivatives are no...
Locating and identifying points as global minimizers is, in general, a hard and time-consuming task....
Publicado em "AIP Conference Proceedings", vol. 1558In this paper, we present a derivative-free mult...
this article is an extension of the multistart method. Having drawn a quasirandom sample of N points...
Multilocal programming aims to locate all the local solutions of an optimization problem. A stochas...
Multilocal programming aims to locate all the local solutions of an optimization problem. A stochas...
A stochastic global optimization method based on a multistart strategy and a derivative-free filter ...
A stochastic global optimization method based on a multistart strategy and a derivative-free filter ...
Multilocal programming aims to identify all the local solutions of constrained optimization problems...
Multilocal programming aims to identify all the local solutions of constrained optimization problems...
A multistart technique coupled with a derivative-free lter local search algorithm for locating all...
Multilocal programming aims to identify all the local solutions of constrained optimization problems...
Preprint versionMultilocal programming aims to identify all local minimizers of unconstrained or co...
Multilocal programming aims to identify all local maximizers of unconstrained or constrained nonline...
Multilocal programming aims to identify all the local (global and non-global) so-lutions of constrai...
The optimization ofmultimodal functions is a challenging task, in particular when derivatives are no...
Locating and identifying points as global minimizers is, in general, a hard and time-consuming task....
Publicado em "AIP Conference Proceedings", vol. 1558In this paper, we present a derivative-free mult...
this article is an extension of the multistart method. Having drawn a quasirandom sample of N points...