103
Views
6
CrossRef citations to date
0
Altmetric
Original Articles

An arc-search infeasible interior-point algorithm for horizontal linear complementarity problem in the N∞− neighbourhood of the central path

Pages 2271-2282 | Received 14 Mar 2016, Accepted 01 Dec 2016, Published online: 14 Feb 2017
 

ABSTRACT

An arc-search infeasible interior point algorithm is proposed for solving a horizontal linear complementarity problem. The algorithm produces a sequence of iterates in the negative infinity neighbourhood of the central path and searches the solutions along the ellipses that approximate the whole central path. We study the theoretical convergence properties and also establish polynomial complexity bound for the proposed algorithm. Moreover, our numerical results suggest that the proposed algorithm is very efficient and competitive.

2010 AMS SUBJECT CLASSIFICATIONS:

Disclosure statement

No potential conflict of interest was reported by the author.

Log in via your institution

Log in to Taylor & Francis Online

PDF download + Online access

  • 48 hours access to article PDF & online version
  • Article PDF can be downloaded
  • Article PDF can be printed
USD 61.00 Add to cart

Issue Purchase

  • 30 days online access to complete issue
  • Article PDFs can be downloaded
  • Article PDFs can be printed
USD 1,129.00 Add to cart

* Local tax will be added as applicable

Related Research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.