A Superlinear Infeasible-Interior-Point Algorithm for Monotone Complementarity Problems
Stephen J. Wright, Daniel Ralph
Abstract
Stephen J. Wright, Daniel Ralph
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.
OpenAlex reports 48 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.
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