• Nenhum resultado encontrado

Multilocal Programming: a Derivative-Free Filter Multistart Algorithm

N/A
N/A
Protected

Academic year: 2019

Share "Multilocal Programming: a Derivative-Free Filter Multistart Algorithm"

Copied!
15
0
0

Texto

Loading

Imagem

Fig. 1. Illustration of the multistart method
Table 1. Problem, reference and known number of solutions.
Table 2. Numerical results obtained with bound constrained problems.
Table 3. Results obtained with inequality and equality constrained problems.

Referências

Documentos relacionados

We presented a multistart approach that uses an extended version of the Hooke and Jeeves, coupled with a filter based method as a local solver for solving MVO problems5. The

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

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

The proposed method is based on a branch and bound (BB) scheme, and the NLP problems that appear in the BB tree search are solved to optimality by a derivative-free global method

This paper presents a multistart method based on a derivative-free local search procedure, the Hooke and Jeeves method [8], to locate multiple solutions of nonlinear constrained

Tem estudantes que manejam redes sociais, controlam blogs, mas quando são questionados sobre conceitos ou sobre como usar os elementos do blog, das redes, de forma mais efetiva,

The purpose of the present study was therefore to de- velop and validate a simple and fast method based on an unprecedented application of the LLE-LTP procedure and to determine

Com relação às séries funcionalizadas com TEOS, quando as fibras não são submetidas a nenhum tratamento, como nos casos “-N -C”, houve perda de resistência para todas