.png){kind=icon}
返回
A new penalty function algorithm for convex quadratic programming
.png){kind=icon}
PRE
AI
DOI：10.1016/S0377-2217(96)00138-5.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, we develop an exterior point algorithm for convex quadratic programming using a penalty function approach. Each iteration in the algorithm consists of a single Newton step followed by a reduction in the value of the penalty parameter. The points generated by the algorithm follow an exterior path that we define. Convergence of the algorithm is established. The proposed algorithm was motivated by the work of Al-Sultan and Murty on nearest point problems, a special quadratic program. A preliminary implementation of the algorithm produced encouraging results. In particular, the algorithm requires a small and almost constant number of iterations to solve the small to medium size problems tested. (C) 1997 Elsevier Science B.V.
Keyword:
quadratic programming
exterior point algorithm
exterior path
penalty methods
Newton's method
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
暂无机构信息
引用论文
Bimodal counterpropagating-responsive sensing material for the detection of histamine.png)
RSC Advances
OAAI
RSC AdvancesIF0
OAAI分享收藏
查看更多内容