AN INFEASIBLE-INTERIOR-POINT-ALGORITHM FOR MONOTONE NONLINEAR COMPLEMENTARITY PROBLEM
Wei Qiu
Abstract
Wei Qiu
Abstract
In this paper an infeasible-interior-point algorithm is proposed for monotone nonlinear complementarity problems, and its convergence is given.
OpenAlex reports 1 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.
In this paper an infeasible-interior-point algorithm is proposed for monotone nonlinear complementarity problems, and its convergence is given.
Key concepts: Mathematics, Nonlinear complementarity problem, Monotone polygon, Mixed complementarity problem, Complementarity (molecular biology), Interior point method, Complementarity theory, Nonlinear system