| 框式凸二次规划宽邻域原始-对偶势下降内点算法 |
| |
| 引用本文： | 沈忠环,张明望,赵玉琴.框式凸二次规划宽邻域原始-对偶势下降内点算法[J].兰州理工大学学报,2009,35(1). |
| |
| 作者姓名： | 沈忠环 张明望 赵玉琴 |
| |
| 作者单位： | 三峡大学,理学院,湖北,宜昌,443002 |
| |
| 基金项目： | 湖北省高校重点科研项目 |
| |
| 摘 要： | 基于线性规划原始-对偶势下降内点算法的思想,对框式凸二次规划提出一种新的内点算法宽邻域原始-对偶势下降内点算法.算法选取牛顿方向作为迭代方向,利用势函数选择迭代步长,分析算法的多项式迭代复杂性,并证明新算法具有较好的迭代复杂性O(nL).
|
| 关 键 词： | 框式凸二次规划 宽邻域 势下降内点算法 迭代复杂性 |
A wide-neighborhood primal-dual interior-point algorithm based on reduced potential function for convex quadratic programming with box constrains |
| |
| SHEN Zhong-huan,ZHANG Ming-wang,ZHAO Yu-qin.A wide-neighborhood primal-dual interior-point algorithm based on reduced potential function for convex quadratic programming with box constrains[J].Journal of Lanzhou University of Technology,2009,35(1). |
| |
| Authors: | SHEN Zhong-huan ZHANG Ming-wang ZHAO Yu-qin |
| |
| Institution: | College of Science;China Three Gorges University;Yichang 443002;China |
| |
| Abstract: | Based on the idea of primal-dual interior-point algorithm with potential reduction for linear programming,a new interior-point algorithm called wide-neighborhood primal-dual potential-reduction interior-point algorithm was devised.In this algorithm,the Newton-direction was used as its iteration direction and its iteration step was determined by using potential function to analyze the complexity of polynomial iteration in the algorithm,proving that this new algorithm possessed a better iteration complexity O... |
| |
| Keywords: | convex quadratic programming with box constrains wide-neighborhood potential-reduction interior-point algorithm iteration complexity |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
