Corrector‐Predictor Methods for Sufficient Linear Complementarity Problems in a Wide Neighborhood of the Central Path
Xing Liu, Florian Alexandru Potra
Abstract
Xing Liu, Florian Alexandru Potra
Abstract
A higher order corrector‐predictor interior‐point method is proposed for solving sufficient linear complementarity problems. The algorithm produces a sequence of iterates in the $\caln_{\infty}^{-}$ neighborhood of the central path. The algorithm does not depend on the handicap κ of the problem. It has $O((1+\kappa)\sqrt{n}L)$ iteration complexity and is superlinearly convergent even for degenerate problems.
OpenAlex reports 32 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
A higher order corrector‐predictor interior‐point method is proposed for solving sufficient linear complementarity problems. The algorithm produces a sequence of iterates in the $\caln_{\infty}^{-}$ neighborhood of the central path. The algorithm does not depend on the handicap κ of the problem. It has $O((1+\kappa)\sqrt{n}L)$ iteration complexity and is superlinearly convergent even for degenerate problems.
Key concepts: Mathematics, Iterated function, Complementarity (molecular biology), Interior point method, Predictor–corrector method, Linear complementarity problem, Degenerate energy levels, Path (computing)