A new parameter free filled function for solving unconstrained global optimization problems
The filled function method is an efficient approach for finding a global minimizer of global optimization problems. This paper introduces a new filled function which overcomes the drawbacks of sensitivity to parameters, containing exponential or logarithmic terms, discontinuity and non-differentiabi...
Uloženo v:
| Vydáno v: | International journal of computer mathematics Ročník ahead-of-print; číslo ahead-of-print; s. 1 - 14 |
|---|---|
| Hlavní autor: | |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Abingdon
Taylor & Francis
02.01.2021
Taylor & Francis Ltd |
| Témata: | |
| ISSN: | 0020-7160, 1029-0265 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Shrnutí: | The filled function method is an efficient approach for finding a global minimizer of global optimization problems. This paper introduces a new filled function which overcomes the drawbacks of sensitivity to parameters, containing exponential or logarithmic terms, discontinuity and non-differentiability for some previous filled functions. It proposes a filled function without any parameters to be adjusted. This filled function has no exponential or logarithmic terms which make the filled function numerically unstable. Also it is continuously differentiable, so gradient information is available in order to use effective local minimization algorithms. Theories of the proposed filled function are investigated and an algorithm for unconstrained global optimization is presented. Numerical results on many test problems with large number of variables are reported. A comparison with some existing algorithms shows that this algorithm is efficient and reliable. |
|---|---|
| Bibliografie: | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| ISSN: | 0020-7160 1029-0265 |
| DOI: | 10.1080/00207160.2020.1731484 |