Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
9506910 | Applied Mathematics and Computation | 2005 | 22 Pages |
Abstract
Error bound theory play an important role in many mathematical programming problems. In this paper, we propose a new assumption condition under which we establish a global Lipshitzian error bound for the semidefinite complementarity problem (SDCP). As corollaries, two results involving the assumptions of strong monotonicity and BD-regularity are given. When the SDCP reduces to the nonlinear complementarity problem (NCP), our results strictly generalize the well-known error bound results which were established under the assumptions of strong monotonicity and uniform P-property. We also establish a new error bound for the NCP under BD-regularity and some R0-type condition.
Related Topics
Physical Sciences and Engineering
Mathematics
Applied Mathematics
Authors
Zheng-Hai Huang,