@Article{JCM-19-2,
author = {Zhe-Ming, Wang and Zheng-Hai, Huang and Zhou, Kun-Ping},
title = {An Asymptotical $O((k + 1)n^3L)$ Affine Scaling Algorithm for the $P_*(k)$-Matrix Linear Complementarity Problem},
journal = {Journal of Computational Mathematics},
year = {2001},
volume = {19},
number = {2},
pages = {177--186},
abstract = {<p style="text-align: justify;">Based on the generalized Dikin-type direction proposed by Jansen et al in 1997, we give out in this paper a generalized Dinkin-type affine scaling algorithm for solving the $P_*(k)$-matrix linear complementarity problem (LCP). By using high-order correctors technique and rank-one updating, the iteration complexity and the total computational turn out asymptotically $O((\kappa+1)\sqrt{n}L)$ and $O((\kappa+1)n^3L)$ respectively.</p>},
issn = {1991-7139},
doi = {https://doi.org/2001-JCM-8970},
url = {https://global-sci.com/article/85460/an-asymptotical-ok-1n3l-affine-scaling-algorithm-for-the-p-k-matrix-linear-complementarity-problem}
}