应用数学2012，Vol.25Issue(1)：61-70,10.
P*(k)线性互补问题基于一类新核函数的大步校正内点算法
A Large-update Interior-point Algorithm for P * (k) LCPs Based on a New Class of Kernel Functions
摘要
Abstract
In this paper,motivated by the complexity results for LO based on kernel functions,we extend a generic primal-dual interior-point algorithm based on a new class of kernel functions to solve P* (k) LCPs.By using some elegant and simple tools,under the interior-point condition,we show that the large update primal-dual interior-point methods for solving P* (k) LCPs enjoys O(q(2k+ 1)n1/p (log n)1+1/qlog n(ε)-1 ) iteration bound.关键词
核函数/线性互补问题/内点算法/大步校正算法/多项式复杂性Key words
Kernel function/Linear complementarity problem/Interior-point algorithm/Large-update method/Polynomial complexity分类
数理科学引用本文复制引用
陈月姣,张明望..P*(k)线性互补问题基于一类新核函数的大步校正内点算法[J].应用数学,2012,25(1):61-70,10.基金项目
Supported by the Natural Science Foundation of Hubei Province(2008CDZ047) （2008CDZ047）
