Multilocal programming aims to identify all the local solutions of constrained optimization problems. The purpose of this paper is to analyze the effect of stopping rules on the performance of a particular multistart method, which relies on a derivative-free local search procedure to converge to a solution, when solving multilocal optimization problems. The method herein presented implements the approximate descent direction method combined with a filter methodology to handle the constraints by forcing the local search towards the feasible region. Two stopping rules are tested on five classical multimodal problems.FC
This paper presents a new reduction-type method for solving semi-infinite programming problems, wher...
This paper presents a new reduction-type method for solving semi-infinite programming problems, wher...
Preprint versionMultilocal programming aims to identify all local minimizers of unconstrained or co...
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...
Multilocal programming aims to identify all the local (global and non-global) so-lutions of constrai...
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...
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 local maximizers of unconstrained or constrained nonline...
Preprint versionMultilocal programming aims to identify all local minimizers of unconstrained or co...
A multistart technique coupled with a derivative-free lter local search algorithm for locating all...
Stopping rule for multi-start local search is investigated for application to structural optimizatio...
This paper presents a new reduction-type method for solving semi-infinite programming problems, wher...
This paper presents a new reduction-type method for solving semi-infinite programming problems, wher...
Preprint versionMultilocal programming aims to identify all local minimizers of unconstrained or co...
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...
Multilocal programming aims to identify all the local (global and non-global) so-lutions of constrai...
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...
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 local maximizers of unconstrained or constrained nonline...
Preprint versionMultilocal programming aims to identify all local minimizers of unconstrained or co...
A multistart technique coupled with a derivative-free lter local search algorithm for locating all...
Stopping rule for multi-start local search is investigated for application to structural optimizatio...
This paper presents a new reduction-type method for solving semi-infinite programming problems, wher...
This paper presents a new reduction-type method for solving semi-infinite programming problems, wher...
Preprint versionMultilocal programming aims to identify all local minimizers of unconstrained or co...