A full-Newton step infeasible interior-point algorithm for linear complementarity problems based on a kernel function

Authors

  • B. Kheirfam Department of Mathematics, Azarbaijan Shahid Madani University, Tabriz, I.R. Iran

Abstract

In this paper, we first present a brief infeasible interior-point method with full-Newton step for solving linear complementarity problem (LCP). The main iteration consists of a feasibility step and several centrality steps. First we present a full Newton step infeasible interior-point algorithm based on the classic logarithmical barrier function. After that a specific kernel function is introduced. Then the feasibility step is induced by this kernel function instead of the classic logarithmical barrier function. The results of complexity coincides with the best bound known for infeasible interior-point methods for LCP.

Downloads

Published

2012-12-12

How to Cite

Kheirfam, B. (2012). A full-Newton step infeasible interior-point algorithm for linear complementarity problems based on a kernel function . Algorithmic Operations Research, 7(2). Retrieved from https://journals.lib.unb.ca/index.php/AOR/article/view/20399

Issue

Vol. 7 No. 2 (2012)

Section

Articles

License

The copyright of the submitted article is hereby transferred to “Preeminent Academic Facets Inc. (the “publisher”) to the extent possible by the laws in the respective countries of the author(s). The author(s) retain all other rights including the following: 1. Any patents and trademark rights. 2. Right to post a pre-print version of the paper on the author’s personal website which is not used for commercial purposes. The author(s) warrant that the work is original, it has not been published elsewhere, it is not currently under consideration for publication in any form, and it does not infringe any copyright laws. The signing author or agent further warrants that all authors, if applicable, have been informed of the terms of this agreement and obtained the approval and authority to sign the agreement.