| 框式约束凸二次规划问题的内点算法 |
| |
| 引用本文： | 马圣容.框式约束凸二次规划问题的内点算法[J].南京晓庄学院学报,2011,27(3):19-22. |
| |
| 作者姓名： | 马圣容 |
| |
| 作者单位： | 南京晓庄学院数学与信息技术学院,江苏南京,211171 |
| |
| 摘 要： | 目前已经有许多关于凸二次规划问题的研究,如文1]2]5]等,文章对文1]所给的原始-对偶内点算法理论上的某些缺陷加以更正,给出了框式约束凸二次规划问题的一个修正原始-对偶内点算法并进行了证明.
|
| 关 键 词： | 内点算法 框式约束凸二次规划 迭代 |
The Primal-dual Interior Point Algorithm with Box Constrains |
| |
| MA Sheng-rong.The Primal-dual Interior Point Algorithm with Box Constrains[J].Journal of Nanjing Xiaozhuang College,2011,27(3):19-22. |
| |
| Authors: | MA Sheng-rong |
| |
| Institution: | MA Sheng-rong(Department of Mathematics,Nanjing Xiaozhuang University,Nanjing 211171,Jiangsu) |
| |
| Abstract: | Currently there have been many studies on convex quadratic programming as given in essays 1] and 2].In this article,some defects of the primal-dual interior point algorithm given in essay 1] are corrected,and then a modified primal-dual interior point algorithm for convex quadratic programming problem with box constraints is offered.Finally,such a modification is proved in theory. |
| |
| Keywords: | interior point algorithm quadratic programming problem with box constrains iterative |
| 本文献已被 维普 万方数据 等数据库收录！ |
|
