一类非单调线性互补问题宽邻域预估校正算法  

A Wide-Neighborhood Predictor-Correcting Algorithm for Class of Nonmonotonic Linear Complementarity Problem

作　　者：张莉[1] 王浚岭[1] 

机构地区：[1]三峡大学理学院,湖北宜昌443002

出　　处：《三峡大学学报（自然科学版）》2007年第1期80-83,共4页Journal of China Three Gorges University：Natural Sciences

基　　金：湖北省教育厅重点科研项目(D200613009)

摘　　要：对于一类非单调线性互补问题给出了一种新的内点算法-宽邻域预估校正算法,算法基于精典预估校正思想,把窄邻域拓展到一个宽邻域里使得算法更快地迭代,讨论了其算法的计算复杂性,并给出了数值实验.A new interior point wide-neighborhood predictor-correcting algorithm for a class of nonmonotonic linear complementarity problem is presented. On the basis of the idea of predictor-correcting, the iteration of the presented algorithm is faster in a wide-neighborhood than in a narrow one. Its computational complexity is discussed; and its numerical experiment is given.

关 键 词：非单调线性互补问题 P矩阵 宽邻域预估校正算法 复杂度 数值实验 

分 类 号：O221[理学—运筹学与控制论]