.png){kind=icon}
返回
Global optimality conditions and optimization methods for constrained polynomial programming problems
.png){kind=icon}
OA
AI
DOI：10.1016/j.amc.2015.04.040.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The general constrained polynomial programming problem (GPP) is considered in this paper. Problem (GPP) has a broad range of applications and is proved to be NP-hard. Necessary global optimality conditions for problem (GPP) are established. Then, a new local optimization method for this problem is proposed by exploiting these necessary global optimality conditions. A global optimization method is proposed for this problem by combining this local optimization method together with an auxiliary function. Some numerical examples are also given to illustrate that these approaches are very efficient. (C) 2015 Elsevier Inc. All rights reserved.
Keyword:
Constrained polynomial programming
Problem
Necessary global optimality condition
Linear transformation
Local optimization method
Global optimization method
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.4
论文数:
2.3W
被引数:
3.3W
机构
引用论文
.png){kind=icon}
Advancement of Nanobiomaterials to Deliver Natural Compounds for Tissue Engineering ApplicationsOAAI
OAAI分享收藏Relationship between Social Media and Academic Performance in Distance Education社交媒体与远程教育学术表现之间的关系
OAAI
OAAI分享收藏分享收藏
查看更多内容