.png){kind=icon}
返回
An adaptive single-point algorithm for global numerical optimization
.png){kind=icon}
PRE
AI
DOI：10.1016/j.eswa.2013.08.018.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper describes a novel algorithm for numerical optimization, called Simple Adaptive Climbing (SAC). SAC is a simple efficient single-point approach that does not require a careful fine-tunning of its two parameters. SAC algorithm shares many similarities with local optimization heuristics, such as random walk, gradient descent, and hill-climbing. SAC has a restarting mechanism, and a powerful adaptive mutation process that resembles the one used in Differential Evolution. The algorithms SAC is capable of performing global unconstrained optimization efficiently in high dimensional test functions. This paper shows results on 15 well-known unconstrained problems. Test results confirm that SAC is competitive against state-of-the-art approaches such as micro-Particle Swarm Optimization, CMA-ES or Simple Adaptive Differential Evolution. (C) 2013 Elsevier Ltd. All rights reserved.
Keyword:
Unconstrained problems
Numerical optimization
Hill-climbing
Adaptive behavior
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.5
论文数:
3.0W
被引数:
10.2W
机构
引用论文
Differential Evolution Algorithm With Strategy Adaptation for Global Numerical Optimization求解全局数值优化问题的策略自适应差分进化算法
OAAI
OAAI分享收藏Complementary and non-matching afferent compartments in the cat's superior colliculus: Innervation of the acetylcholinesterase-poor domain of the intermediate gray layer.png)
Neuroscience
NeuroscienceIF0
PREAI
分享收藏分享收藏分享收藏
查看更多内容