| 基于代数变换求解P0阵线性互补问题的不可行内点算法 |
| |
| 引用本文： | 龚小玉,张明望. 基于代数变换求解P0阵线性互补问题的不可行内点算法[J]. 中国科学技术大学学报, 2007, 37(3): 234-237 |
| |
| 作者姓名： | 龚小玉 张明望 |
| |
| 作者单位： | 三峡大学理学院,湖北宜昌,443002 |
| |
| 摘 要： | 基于代数变换和KMM算法的框架,通过在牛顿方程中嵌入一种自调节功能,提出了一种新的求解P0阵线性互补问题的不可行内点算法,并证明了该算法的全局收敛性.
|
| 关 键 词： | 线性互补问题 不可行内点算法 代数变换 P0矩阵 全局收敛性 |
| 文章编号： | 0253-2778(2007)03-0234-04 |
| 修稿时间： | 2006-07-10 |
An infeasible interior point algorithm for P0-LCP based on algebraic transformation |
| |
| GONG Xiao-yu,ZHANG Ming-wang. An infeasible interior point algorithm for P0-LCP based on algebraic transformation[J]. Journal of University of Science and Technology of China, 2007, 37(3): 234-237 |
| |
| Authors: | GONG Xiao-yu ZHANG Ming-wang |
| |
| Affiliation: | College of Science, China Three Gorges University, Yichang 443002, China |
| |
| Abstract: | Based on the algebraic transformation and the frame of KMM algorithm,a self-adjusting factor was embedded into Newton equations for P0 linear complementarity problem,a new infeasible interior point algorithm for P0 linear complementarity problem(P0-LCP) was developed and its global convergence analysis was established. |
| |
| Keywords: | linear complementarity problem infeasible interior point algorithm algebraic transformation P0-matrix global convergence |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
