.png){kind=icon}
.png){kind=icon}
Return
Penalty functions and two-step selection procedure based DIRECT-type algorithm for constrained global optimization
.png){kind=icon}
PRE
AI
DOI：10.1007/s00158-018-2181-2.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Applied optimization problems often include constraints. Although the well-known derivative-free global-search DIRECT algorithm performs well solving box-constrained global optimization problems, it does not naturally address constraints. In this article, we develop a new algorithm DIRECT-GLce for general constrained global optimization problems incorporating two-step selection procedure and penalty function approach in our recent DIRECT-GL algorithm. The proposed algorithm effectively explores hyper-rectangles with infeasible centers which are close to boundaries of feasibility and may cover feasible regions. An extensive experimental investigation revealed the potential of the proposed approach compared with other existing DIRECT-type algorithms for constrained global optimization problems, including important engineering problems.
Keywords:
DIRECT-type algorithm
DIRECT-type constraint-handling
Nonconvex optimization
Derivative-free optimization
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4
Papers:
4.8K
Citations:
1.7W