A full-Newton step feasible interior-point algorithm for P∗(κ)-LCP based on a new search direction

Authors

  • Behrouz Kheirfam Azarbaijan Shahid Madani University
  • Masoumeh Haghighi Department of Applied Mathematics, Azarbaijan Shahid Madani University

Abstract

In this paper, we present a full-Newton step feasible interior-point algorithm for a P∗(κ) linear complementarity problem based on a new search direction. We apply a vector-valued function generated by a univariate function on nonlinear equations of the system which defines the central path. Furthermore, we derive the iteration bound for the algorithm, which coincides with the best-known iteration bound for these types of algorithms. Numerical results show that the proposed algorithm is competitive and reliable.

 

Author Biography

Behrouz Kheirfam, Azarbaijan Shahid Madani University

Department of Applied Mathematics, Azarbaijan Shahid Madani University

Downloads

Published

2016-12-30

Issue

Volume 7 (2016), Number 2

Section

CRORR Journal Regular Issue

License

- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal

- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.

- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).