An interior-point algorithm for horizontal linear complementarity problems

Soodabeh Asadi, Hossein Mansouri and Maryam Zangiabadi

International Journal of Mathematics in Operational Research, 2018, vol. 13, issue 1, 30-46

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. (search for similar items in EconPapers)
Date: 2018
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=92959 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijmore:v:13:y:2018:i:1:p:30-46

Access Statistics for this article

More articles in International Journal of Mathematics in Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().