Indexed metadata

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

Stephen Wright, Daniel Ralph

Source record

Source: Crossref

Published: Nov 1, 1996

DOI: 10.1287/moor.21.4.815

Open original source ↗

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

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.

A Superlinear Infeasible-Interior-Point Algorithm for Monotone Complementarity Problems — Mathematical Frontier Network