Abstract
Recently, [Darvay Zs, Takács PR: Large-step interior-point algorithm for linear optimization based on a new wide neighbourhood. Cent Eur J Oper Res. 2018;26(3):551–563] introduced a new large-step interior-point algorithm (IPA) for linear optimization (LO). The purpose of this paper is to extend this method to the class of P ∗ ( κ ) -linear complementarity problems (LCPs). First, we propose a new wide neighbourhood of the central path for LCPs, which differs from the one presented by [Ai W, Zhang S: An O ( n L ) iteration primal–dual path-following method, based on wide neighbourhoods and large updates, for monotone LCP. SIAM J Optim. 2005;16(2):400–417]. Our method uses new search directions obtained by an algebraically equivalent transformation of the system which defines the central path. We present a large-step algorithm, but we demonstrate that it has the same iteration complexity as the best short-step algorithms. Finally, we give some numerical results to prove the efficiency of the new method.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
