.png){kind=icon}
返回
Canonical primal-dual algorithm for solving fourth-order polynomial minimization problems
.png){kind=icon}
PRE
AI
DOI：10.1016/j.amc.2013.11.013.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper focuses on implementation of a general canonical primal-dual algorithm for solving a class of fourth-order polynomial minimization problems. A critical issue in the canonical duality theory has been addressed, i.e., in the case that the canonical dual problem has no interior critical point in its feasible space S, a quadratic perturbation method is introduced to recover the global solution through a primal-dual iterative approach, and a gradient-based method is further used to refine the solution. A series of test problems, including the benchmark polynomials and several instances of the sensor network localization problems, have been used to testify the effectiveness of the proposed algorithm. Crown Copyright (C) 2013 Published by Elsevier Inc. All rights reserved.
Keyword:
Global optimization
Canonical dual algorithm
Polynomial optimization
期刊
IF:
3.4
论文数:
2.3W
被引数:
3.3W
机构
引用论文
.png){kind=icon}
Multi-scale modelling and canonical dual finite element method in phase transitions of solids固体相变的多尺度建模和规范对偶有限元方法
OAAI
OAAI分享收藏
查看更多内容