Verification of Solutions for Almost Linear Complementarity Problems

We present a computational enclosure method for the solution of a class of nonlinear complementarity problems. The procedure also delivers a proof for the uniqueness of the solution

Verification of Solutions for Almost Linear Complementarity Problems

The paper establishes a computational enclosure of the solution of a nonlinear complementarity problem x ≥ 0,l(x) ≥ 0,x T l(x) = 0, where l(x) = Mx + Φ(x) is a so-called almost linear mapping with an H-matrix M with positive diagonal elements and an increasing diagonal mapping Φ. The procedure also delivers a simple proof for the uniqueness of the solution