.png){kind=icon}
返回
Generalized semi-infinite programming: Theory and methods
.png){kind=icon}
PRE
AI
DOI：10.1016/S0377-2217(99)00132-0.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Generalized semi-infinite optimization problems (GSIP) are considered. The difference between GSIP and standard semi-infinite problems (SIP) is illustrated by examples. By applying the 'Reduction Ansatz', optimality conditions for GSIP are derived. Numerical methods for solving GSIP are considered in comparison with methods for SIP. From a theoretical and a practical point of view it is investigated, under which assumptions a GSIP can be transformed into an SIP. (C) 1999 Elsevier Science B.V. All rights reserved.
Keyword:
semi-infinite programming
optimality conditions
numerical methods
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
暂无机构信息
引用论文
Stopping Rules in Principal Components Analysis: A Comparison of Heuristical and Statistical Approaches.png)
Ecology
EcologyIF0
PREAI
分享收藏
没有更多内容
没有更多内容