A FULL-NEWTON STEP INFEASIBLE INTERIOR-POINT ALGORITHM FOR P∗(κ) LINEAR COMPLEMENTARITY PROBLEM

ZHU Danhua , ZHANG Mingwang

Journal of Systems Science & Complexity ›› 2014, Vol. 27 ›› Issue (5) : 1027-1044.

PDF(245 KB)
PDF(245 KB)
Journal of Systems Science & Complexity ›› 2014, Vol. 27 ›› Issue (5) : 1027-1044. DOI: 10.1007/s11424-014-1273-3
article

A FULL-NEWTON STEP INFEASIBLE INTERIOR-POINT ALGORITHM FOR P∗(κ) LINEAR COMPLEMENTARITY PROBLEM

  • ZHU Danhua , ZHANG Mingwang
Author information +
History +

Abstract

This paper proposes a new infeasible interior-point algorithm with full-Newton steps for P∗(κ) linear complementarity problem (LCP), which is an extension of the work by Roos (SIAM J. Optim.,2006, 16(4): 1110–1136). The main iteration consists of a feasibility step and several centrality steps. The authors introduce a specific kernel function instead of the classic logarithmical barrier function to induce the feasibility step, so the analysis of the feasibility step is different from that of Roos’s. This kernel function has a finite value on the boundary. The result of iteration complexity coincides with the currently known best one for infeasible interior-point methods for P∗(κ) LCP. Some numerical results are reported as well.

Key words

Full-Newton steps, infeasible interior-point method, P&lowast / (&kappa / ) linear complementarity problems, polynomial complexity.

Cite this article

Download Citations
ZHU Danhua , ZHANG Mingwang. A FULL-NEWTON STEP INFEASIBLE INTERIOR-POINT ALGORITHM FOR P∗(κ) LINEAR COMPLEMENTARITY PROBLEM. Journal of Systems Science and Complexity, 2014, 27(5): 1027-1044 https://doi.org/10.1007/s11424-014-1273-3

Funding

This paper was supported by the Natural Science Foundation of Hubei Province under Grant No. 2008CDZ047.

PDF(245 KB)

145

Accesses

0

Citation

Detail

Sections
Recommended

/