Title: An interior-point algorithm for horizontal linear complementarity problems

Authors: Soodabeh Asadi; Hossein Mansouri; Maryam Zangiabadi

Addresses: Department of Applied Mathematics, Faculty of Mathematical Sciences, Shahrekord University, Shahrekord, Iran ' Department of Applied Mathematics, Faculty of Mathematical Sciences, Shahrekord University, Shahrekord, Iran ' Department of Applied Mathematics, Faculty of Mathematical Sciences, Shahrekord University, Shahrekord, Iran

Abstract: This paper presents a wide-neighbourhood interior-point algorithm for P-horizontal linear complementarity problem. The convergence analysis is shown for the introduced wide neighbourhood of the central path by Ai and Zhang (2005) for monotone linear complementarity problem, and unifies the analysis for its constituent wide neighbourhoods. The Newton search directions are decomposed to the non-negative and non-positive parts, correspond to the parts of the right hand side. The achieved complexity bound is the same as the best obtained bound for the monotone linear complementarity problems, except that it is multiplied by a factor dependent on the handicap of the given problem.

Keywords: interior-point method; horizontal linear complementarity problem; HLCP; wide neighbourhood algorithm; polynomial complexity.

DOI: 10.1504/IJMOR.2018.092959

International Journal of Mathematics in Operational Research, 2018 Vol.13 No.1, pp.30 - 46

Received: 16 Mar 2016
Accepted: 12 Nov 2016
Published online: 04 Jul 2018 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article