.png){kind=icon}
返回
A parametric linear relaxation algorithm for globally solving nonconvex quadratic programming
.png){kind=icon}
PRE
AI
DOI：10.1016/j.amc.2014.11.032.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this article, we present a parametric linear relaxation algorithm for globally solving the nonconvex quadratic programming (NQP). In this algorithm, a new parametric linearized technique is proposed for generating parametric linear relaxation programming (PLRP) of the NQP, which can be used to determine the lower bound of global minimum value of the NQP. To improve the convergent speed of the proposed algorithm, a pruning operation is employed to compress the investigated region. By subdividing subsequently the initial domain and solving subsequently a series of parametric linear relaxation programming problems over the subdivided domain, the proposed algorithm is convergent to the global minimum of the NQP. Finally, an engineering problem for the design of heat exchanger network and some test examples are used to verify the effectiveness of the proposed algorithm. (C) 2014 Elsevier Inc. All rights reserved.
Keyword:
Nonconvex quadratic programming
Global optimization
Parametric linearized technique
Pruning operation
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.4
论文数:
2.3W
被引数:
3.3W
机构
引用论文
Cotton Based Self-Powered Temperature Sensor Based on Au-Augmented WS2 Triboelectric Nanogenerator
PREAI
分享收藏
The future relevance of medical geography for health planning, health and development in the third world.png)
GeoJournal
GeoJournalIF0
PREAI
分享收藏分享收藏
查看更多内容