New Error Bounds for the Linear Complementarity Problem

Abstract

Recently Mangasarian and Solodov (1993) showed that every nonlinear complementarity problem (NCP) is equivalent to the unconstrained minimization of a certain implicit Lagrangian. In particular, it was shown that this implicit Lagrangian is nonnegative everywhere and its set of zeros coincides with the solution set of the original NCP. In this paper, we consider the linear complementarity problem (LCP), and show that the distance to the solution set of the LCP from any point sufficiently close to the set can be bounded above by the square root of the implicit Lagrangian for the LCP. In other words, the square root of the implicit Lagrangian is a local error bound for the LCP. Our proof is based on showing that the square root of the implicit Lagrangian is equivalent to the residual function used in a known local error bound (Robinson 1981, Luo and Tseng 1992). When the matrix associated with the LCP is nondegenerate, the new error bound is in fact global. This extends the error bound result of Mathias and...