full
search.png

Search

close.png

Cancel

arrow
Volume 19, Issue 2
An Asymptotical $O((k + 1)n^3L)$ Affine Scaling Algorithm for the $P_*(k)$-Matrix Linear Complementarity Problem

Zhe-Ming Wang, Zheng-Hai Huang & Kun-Ping Zhou

J. Comp. Math., 19 (2001), pp. 177-186.

Published online: 2001-04

Preview Full PDF 2435 26347

Cited by

google scholar semantic scholar
Export citation
  • Abstract

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.

  • Keywords

linear complementarity problem, $P_*(K)$-matrix, affine scaling algorithm.

  • AMS Subject Headings

  • Copyright

COPYRIGHT: © Global Science Press

  • Email address
  • BibTex
  • RIS
  • TXT
@Article{JCM-19-177, author = {Wang , Zhe-MingHuang , Zheng-Hai 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 = {

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.

}, issn = {1991-7139}, doi = {https://doi.org/}, url = {http://global-sci.org/intro/article_detail/jcm/8970.html} }
TY - JOUR T1 - An Asymptotical $O((k + 1)n^3L)$ Affine Scaling Algorithm for the $P_*(k)$-Matrix Linear Complementarity Problem AU - Wang , Zhe-Ming AU - Huang , Zheng-Hai AU - Zhou , Kun-Ping JO - Journal of Computational Mathematics VL - 2 SP - 177 EP - 186 PY - 2001 DA - 2001/04 SN - 19 DO - http://doi.org/ UR - https://global-sci.org/intro/article_detail/jcm/8970.html KW - linear complementarity problem, $P_*(K)$-matrix, affine scaling algorithm. AB -

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.

Wang , Zhe-MingHuang , Zheng-Hai and Zhou , Kun-Ping. (2001). An Asymptotical $O((k + 1)n^3L)$ Affine Scaling Algorithm for the $P_*(k)$-Matrix Linear Complementarity Problem. Journal of Computational Mathematics. 19 (2). 177-186. doi:
Copy to clipboard
BibteX RIS TXT
The citation has been copied to your clipboard