广东石油化工学院学报Issue(4)：79-83,5.
一种新的求解P*（k）阵原始－对偶路径跟踪算法磁
A New Primal-dual Path-following Method forLinear Complementarity Problem
龚小玉1
作者信息
- 1. 广东石油化工学院理学院，广东茂名525000
- 折叠
摘要
Abstract
In this paper ,we describe a new primal -dual path-following method for solving linear complementarity problem .The algorithm is based on a new technique for finding the search direction and the strategy of the central path .Moreover ,we show that the polynomial complexity of the algorithm is O( nlog [n+4(1+ k)δ2 ]εμ0 ) ,which coincides with the best interior point method in present .关键词
内点算法/路径跟踪算法/多项式复杂性/P* (k)阵线性互补问题Key words
interior-point algorithm/path-following method/polynomial-time complexity/-linear complementarity problem分类
数理科学引用本文复制引用
龚小玉..一种新的求解P*（k）阵原始－对偶路径跟踪算法磁[J].广东石油化工学院学报,2013,(4):79-83,5.
