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...

Full description

Saved in:
Bibliographic Details
Published inAIMS mathematics Vol. 9; no. 7; pp. 18475 - 18505
Main Authors Li, Jia, Gao, Yuelin, Chen, Tiantian, Ma, Xiaohua
Format Journal Article
LanguageEnglish
Published AIMS Press 01.01.2024
Subjects
Online AccessGet full text

Cover

Loading…