| 框式线性规划的多项式预估校正内点算法 |
| |
| 引用本文： | 柏钦玺,黄崇超,王雪.框式线性规划的多项式预估校正内点算法[J].数学杂志,2006,26(4):431-436. |
| |
| 作者姓名： | 柏钦玺 黄崇超 王雪 |
| |
| 作者单位： | 武汉大学数学与统计学院,湖北,武汉,430072 |
| |
| 基金项目： | 教育部高校骨干教师基金 |
| |
| 摘 要： | 本文研究带线性约束的框式线性规划问题,给出了一个预估校正内点算法,分析了该算法的多项式计算复杂性,并证明其迭代复杂度为Ο(nL).
|
| 关 键 词： | 框式线性规划 预估校正内点算法 牛顿方向 迭代复杂度 |
| 文章编号： | 0255-7797（2006）04-0431-06 |
| 收稿时间： | 2004-06-22 |
| 修稿时间： | 2004-06-22 |
A POLYNOMIAL PREDICTOR-CORRECTOR INTERIOR-POINT ALGORITHM FOR LINEAR PROGRAMMING WITH BOX CONSTRAINTS |
| |
| BAI Qin-xi,HUANG Chong-chao,WANG Xue.A POLYNOMIAL PREDICTOR-CORRECTOR INTERIOR-POINT ALGORITHM FOR LINEAR PROGRAMMING WITH BOX CONSTRAINTS[J].Journal of Mathematics,2006,26(4):431-436. |
| |
| Authors: | BAI Qin-xi HUANG Chong-chao WANG Xue |
| |
| Institution: | School of Math. and Statistics, Wuhan University ,Wuhan 430072, China |
| |
| Abstract: | This paper presents a polynomial predictor-corrector interior-point algorithm for linear programming with box constraints. And it is shown that the method is a polynomial-time algorithm and has O(nL) iteration complexity. |
| |
| Keywords: | linear programming with box constraints predictor-corrector interior-point algorithm Newton direction iteration complexity |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
