A new filled function method based on global search for solving unconstrained optimization problems
The filled function method is a deterministic algorithm for finding a global minimizer of global optimization problems, and its effectiveness is closely related to the form of the constructed filled function. Currently, the filled functions mainly have three drawbacks in form, namely, parameter adju...
Prif Awduron: | , , , |
---|---|
Fformat: | Erthygl |
Iaith: | English |
Cyhoeddwyd: |
AIMS Press
2024-06-01
|
Cyfres: | AIMS Mathematics |
Pynciau: | |
Mynediad Ar-lein: | https://www.aimspress.com/article/doi/10.3934/math.2024900?viewType=HTML |