.png){kind=icon}
.png){kind=icon}
Return
Deterministic approaches for solving practical black-box global optimization problems
.png){kind=icon}
OA
AI
DOI：10.1016/j.advengsoft.2014.09.014.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In many important design problems, some decisions should be made by finding the global optimum of a multiextremal objective function subject to a set of constrains. Frequently, especially in engineering applications, the functions involved in optimization process are black-box with unknown analytical representations and hard to evaluate. Such computationally challenging decision-making problems often cannot be solved by traditional optimization techniques based on strong suppositions about the problem (convexity, differentiability, etc.). Nature and evolutionary inspired metaheuristics are also not always successful in finding global solutions to these problems due to their multiextremal character. In this paper, some innovative and powerful deterministic approaches developed by the authors to construct numerical methods for solving the mentioned problems are surveyed. Their efficiency is shown on solving both the classes of random test problems and some practical engineering tasks. (C) 2014 Civil-Comp Ltd and Elsevier Ltd. All rights reserved.
Keywords:
Global optimization
Black-box functions
Derivative-free methods
Lipschitz condition
Applied problems
Geophysical inverse problems
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
5.7
Papers:
3.3K
Citations:
1.2W