.png){kind=icon}
返回
Filled function method that avoids minimizing the objective function again
.png){kind=icon}
PRE
AI
DOI：10.1080/02331934.2025.2577808.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Filled function algorithm is an effective method for global optimization problems by keeping jumping out of the local minimizer until the global one. The traditional filled function approach goes by minimizing filled function and objective function alternately to find a better local minimizer. Motivated by this, we improve the previous definition of filled function and construct a novel filled function. The proposed filled function does not contain exponential terms, logarithmic terms and parameters that need to be adjusted, and more importantly its minimizers are the better minimizers of the objective function than the current one. The objective function only needs to be minimized once in the proposed corresponding filled function algorithm, which breaks the situation of minimizing filled function and objective function alternately, effectively reduces the number of local optimization and speeds up the process of global optimization. Numerical experiments show that the algorithm is feasible and effective.
Keyword:
Filled function
global optimization
global minimizer
local minimizer
期刊
O
IF:
1.8
论文数:
121
被引数:
0
机构
暂无机构信息
引用论文
A novel convergent filled function algorithm for multi-dimensional global optimization.png)
Optimization
OptimizationIF0
PREAI
分享收藏A filled function which has the same local minimizer of the objective function一个填充函数，它与目标函数具有相同的局部极小值点
PREAI
分享收藏
分享收藏分享收藏Finding global minima with an inflection point-based filled function algorithm基于拐点填充函数算法的全局最小值求解
PREAI
分享收藏A new parameter-free continuously differentiable filled function algorithm for solving nonlinear equations and data fitting problems一种无需参数的连续可微填充函数算法，用于求解非线性方程和数据拟合问题
PREAI
分享收藏A novel single-parameter continuously differentiable filled function for global optimizationOptimization
OptimizationIF0
PREAI
分享收藏
查看更多内容