.png){kind=icon}
返回
Global optimization with nonfactorable constraints
.png){kind=icon}
PRE
AI
DOI：10.1021/ie020199j.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper presents an approach for the global optimization of constrained nonlinear programming problems in which some of the constraints are nonfactorable, defined by a computational model for which no explicit analytical representation is available. A three-phase approach to the global optimization is considered. In the sampling phase, the nonfactorable functions and their gradients are evaluated and an interpolation function is constructed. In the global optimization phase, the interpolants are used as surrogates in a deterministic global optimization algorithm. In the final local optimization phase, the global optimum of the interpolation problem is used as a starting point for a local optimization of the original problem. The interpolants are designed in such a way as to allow valid over- and underestimation functions to be constructed to provide the global optimization algorithm with a guarantee of is an element of-global optimality for the surrogate problem.
Keyword:
ALPHA-BB
INTERPOLATION
NLPS
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
I
IF:
3.9
论文数:
4.0W
被引数:
9.6W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏分享收藏
查看更多内容