.png){kind=icon}
返回
A new filled function algorithm for constrained global optimization problems
.png){kind=icon}
PRE
AI
DOI：10.1016/j.amc.2010.12.070.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
A new filled function with one parameter is proposed for solving constrained global optimization problems without the coercive condition, in which the filled function contains neither exponential term nor fractional term and is easy to be calculated. A corresponding filled function algorithm is established based on analysis of the properties of the filled function. At last, we perform numerical experiments on some typical test problems using the algorithm and the detailed numerical results show that the algorithm is effective. (C) 2010 Elsevier Inc. All rights reserved.
Keyword:
Constrained global optimization problems
Filled function algorithm
Minimizer
Adjustable parameter
Numerical results
期刊
IF:
3.4
论文数:
2.3W
被引数:
3.3W
机构
引用论文
Finding global minimizer with one-parameter filled function on unconstrained global optimization
.png){kind=icon}
PREAI
分享收藏Spinal Hydatid Cyst Mimicking Arachnoid Cyst on Magnetic Resonance Imaging脊柱棘球蚴囊肿磁共振成像表现为蛛网膜囊肿样改变
OAAI
OAAI分享收藏 没有更多内容
没有更多内容