2003•Journal of MathematicsRequires access

AN INFEASIBLE-INTERIOR-POINT-ALGORITHM FOR MONOTONE NONLINEAR COMPLEMENTARITY PROBLEM

Wei Qiu

Open publisher page 1 citations

Abstract

In this paper an infeasible-interior-point algorithm is proposed for monotone nonlinear complementarity problems, and its convergence is given.

About this research paper

What this paper is about

In this paper an infeasible-interior-point algorithm is proposed for monotone nonlinear complementarity problems, and its convergence is given.

Why it matters

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

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

Related papers

Back to paper searchBrowse research topicsOriginal source
AN INFEASIBLE-INTERIOR-POINT-ALGORITHM FOR MONOTONE NONLINEAR COMPLEMENTARITY PROBLEM — Research Paper | ScholarLens