1996•Mathematics of Operations ResearchRequires access

A Superlinear Infeasible-Interior-Point Algorithm for Monotone Complementarity Problems

Stephen J. Wright, Daniel Ralph

Open publisher page 48 citations

Abstract

We use the globally convergent framework proposed by Kojima, Noma, and Yoshise to construct an infeasible-interior-point algorithm for monotone nonlinear complementarity problems. Superlinear convergence is attained when the solution is nondegenerate and also when the problem is linear with a strictly complementary solution. Numerical experiments confirm the efficacy of the proposed approach.

About this research paper

What this paper is about

We use the globally convergent framework proposed by Kojima, Noma, and Yoshise to construct an infeasible-interior-point algorithm for monotone nonlinear complementarity problems. Superlinear convergence is attained when the solution is nondegenerate and also when the problem is linear with a strictly complementary solution. Numerical experiments confirm the efficacy of the proposed approach.

Why it matters

OpenAlex reports 48 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

We use the globally convergent framework proposed by Kojima, Noma, and Yoshise to construct an infeasible-interior-point algorithm for monotone nonlinear complementarity problems. Superlinear convergence is attained when the solution is nondegenerate and also when the problem is linear with a strictly complementary solution. Numerical experiments confirm the efficacy of the proposed approach.

Key concepts: Mathematics, Monotone polygon, Interior point method, Complementarity (molecular biology), Nonlinear complementarity problem, Mathematical optimization, Linear complementarity problem, Complementarity theory

Related papers

Back to paper searchBrowse research topicsOriginal source
A Superlinear Infeasible-Interior-Point Algorithm for Monotone Complementarity Problems — Research Paper | ScholarLens