.png){kind=icon}
返回
Optimality conditions and optimization methods for quartic polynomial optimization
.png){kind=icon}
PRE
AI
DOI：10.1016/j.amc.2014.01.074.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper multivariate quartic polynomial optimization program (QPOP) is considered. Quartic optimization problems arise in various practical applications and are proved to be NP hard. We discuss necessary global optimality conditions for quartic problem (QPOP). And then we present a new (strongly or e-strongly) local optimization method according to necessary global optimality conditions, which may escape and improve some KKT points. Finally we design a global optimization method for problem (QPOP) by combining the new (strongly or c-strongly) local optimization method and an auxiliary function. Numerical examples show that our algorithms are efficient and stable. (C) 2014 Elsevier Inc. All rights reserved.
Keyword:
Quartic polynomial optimization problem
Necessary global optimality condition
Linear transformation
Local optimization method
Global optimization method
期刊
IF:
3.4
论文数:
2.3W
被引数:
3.3W
机构
引用论文
.png){kind=icon}
Advancement of Nanobiomaterials to Deliver Natural Compounds for Tissue Engineering Applications
OAAI
OAAI分享收藏分享收藏
查看更多内容