返回
Metaheuristic vs. deterministic global optimization algorithms: The univariate case
DOI:10.1016/j.amc.2017.05.014.png)
摘要
En 中文
Many practical problems involve the search for the global extremum in the space of the system parameters. The functions to be optimized are often highly multiextremal, blackbox with unknown analytical representations, and hard to evaluate even in the case of one parameter to be adjusted in the presence of non-linear constraints. The interest of both the stochastic (in particular, metaheuristic) and mathematical programming (in particular, deterministic) communities to the comparison of metaheuristic and deterministic classes of methods is well recognized. Although both the communities have a huge number of journal and proceedings papers, a few of them are really dedicated to a systematic comparison of the methods belonging to these two classes. This paper meets the requirement of such a comparison between nature-inspired metaheuristic and deterministic algorithms (more than 125,0 0 0 launches of the methods have been performed) and presents an attempt (beneficial to practical fields including engineering design) to bring together two rather disjoint communities of metaheuristic and mathematical programming researchers and applied users. (C) 2017 Elsevier Inc. All rights reserved.
Keyword:
Constrained global optimization
Numerical comparison
Lipschitz-based deterministic approaches
Nature-inspired metaheuristics
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.4
论文数:
2.3W
被引数:
3.3W
机构
引用论文
Global Convergence of Radial Basis Function Trust-Region Algorithms for Derivative-Free Optimization无导数优化的径向基函数信赖域算法的全局收敛性
SIAM REVIEW
IF6.1
A recombinant capsid protein from Dengue-2 induces protection in mice against homologous virus
Vaccine
IF0

