Improved Full-Newton-Step infeasible interior-point method for linear complementarity problems
Abstract
We present an Infeasible Interior-Point Method (IIPM) for monotone LinearComplementarity Problem (LCP) which is an improved version of the algorithm given in[13]. In the earlier version, each iteration consisted of one feasibility step and few centeringsteps. The improved version guarantees that after one feasibility step, the new iterate is fea-sible and close enough to central path thanks to the much tighter proximity estimate whichis based on the new lemma introduced in [18]. Thus, the centering steps are eliminated.Another advantage of this method is the use of full-Newton steps, that is, no calculation ofthe step size is required. The preliminary implementation and numerical results demonstratethe advantage of the improved version of the method in comparison with the old one.Downloads
Published
Issue
Section
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).