Error Bounds for R0-Type and Monotone Nonlinear Complementarity Problems
نویسنده
چکیده
The paper generalizes the Mangasarian-Ren 10] error bounds for linear complementarity problems (LCPs) to nonlinear complementarity problems (NCPs). This is done by extending the concept of R 0-matrix to several R 0-type functions, which include a subset of monotone functions as a special case. Both local and global error bounds are obtained for the R 0-type and some monotone NCPs.
منابع مشابه
Error bounds for symmetric cone complementarity problems
In this paper, we investigate the issue of error bounds for symmetric cone complementarity problems (SCCPs). In particular, we show that the distance between an arbitrary point in Euclidean Jordan algebra and the solution set of the symmetric cone complementarity problem can be bounded above by some merit functions such as FischerBurmeister merit function, the natural residual function and the ...
متن کاملNew improved error bounds for the linear complementarity problem
New local and global error bounds are given for both nonmonotone and monotone linear complementarity problems. Comparisons of various residuals used in these error bounds are given. A possible candidate for a "best" error bound emerges from our comparisons as the sum of two natural residuals.
متن کاملA projection algorithm for strictly monotone linear complementarity problems
Complementary problems play a central role in equilibrium finding, physical simulation, and optimization. As a consequence, we are interested in understanding how to solve these problems quickly, and this often involves approximation. In this paper we present a method for approximately solving strictly monotone linear complementarity problems with a Galerkin approximation. We also give bounds f...
متن کاملImproved infeasible-interior-point algorithm for linear complementarity problems
We present a modified version of the infeasible-interior- We present a modified version of the infeasible-interior-point algorithm for monotone linear complementary problems introduced by Mansouri et al. (Nonlinear Anal. Real World Appl. 12(2011) 545--561). Each main step of the algorithm consists of a feasibility step and several centering steps. We use a different feasibility step, which tar...
متن کاملLocal behavior of an iterative framework for generalized equations with nonisolated solutions
An iterative framework for solving generalized equations with nonisolated solutions is presented. For generalized equations with the structure 0 ∈ F(z) + T (z), where T is a multifunction and F is singlevalued, the framework covers methods that, at each step, solve subproblems of the type 0 ∈ A(z, s)+ T (z). The multifunction A approximates F around s. Besides a condition on the quality of this...
متن کامل