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...
Saved in:
Published in | AIMS mathematics Vol. 9; no. 7; pp. 18475 - 18505 |
---|---|
Main Authors | , , , |
Format | Journal Article |
Language | English |
Published |
AIMS Press
01.01.2024
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Be the first to leave a comment!