2006•SIAM Journal on OptimizationRequires access

Corrector‐Predictor Methods for Sufficient Linear Complementarity Problems in a Wide Neighborhood of the Central Path

Xing Liu, Florian Alexandru Potra

Open publisher page 32 citations

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.

About this research paper

What this paper is about

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.

Why it matters

OpenAlex reports 32 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available 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.

Key concepts: Mathematics, Iterated function, Complementarity (molecular biology), Interior point method, Predictor–corrector method, Linear complementarity problem, Degenerate energy levels, Path (computing)

Related papers

Back to paper searchBrowse research topicsOriginal source
Corrector‐Predictor Methods for Sufficient Linear Complementarity Problems in a Wide Neighborhood of the Central Path — Research Paper | ScholarLens