Abstract
In this article, we extend the Ai-Zhang direction for solving LCP to the class of second-order cone programming. Each iterate always follows the usual wide neighborhood , not necessarily staying within it, but must stay within the wider neighborhood 𝒩(β, τ). In addition, we decompose the classical Newton direction into two separate parts according to the positive and negative parts. We show that the algorithm has iteration complexity bound, where n is the dimension of the problem and with ϵ the required precision and (X 0, S 0) the initial interior solution. To the best of our knowledge, this is the first large-neighborhood path-following interior point method (IPMs) with the same complexity as small neighborhood path-following IPMs for second-order cone programming. It is the best result in regard to the iteration complexity bound in the context of the large-update path-following method for second-order cone programming.
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.
