Abstract
In this paper, the global error bound estimation for the generalized linear complementarity problem over a polyhedral cone (GLCP) is considered. To obtain a global error bound for the GLCP, we first develop some equivalent reformulations of the problem under milder conditions and then characterize the solution set of the GLCP. Based on this, an easily computable global error bound for the GLCP is established. The results obtained in this paper can be taken as an extension of the existing global error bound for the classical linear complementarity problems.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Facchinei, F., Pang, J.S.: Finite-Dimensional Variational Inequality and Complementarity Problems. Springer, New York (2003)
Habetler, G.T., Price, A.L.: Existence theory for generalized nonlinear complementarity problems. J. Optim. Theory Appl. 7, 223–239 (1971)
Karamardian, S.: Generalized complementarity problem. J. Optim. Theory Appl. 8, 161–167 (1971)
Andreani, R., Friedlander, A., Santos, S.A.: On the resolution of the generalized nonlinear complementarity problem. SIAM J. Optim. 12, 303–321 (2001)
Kanzow, C., Fukushima, M.: Equivalence of the generalized complementarity problem to differentiable unconstrained minimization. J. Optim. Theory Appl. 90, 581–603 (1996)
Wang, Y.J., Ma, F.M., Zhang, J.Z.: A nonsmooth L-M method for solving the generalized nonlinear complementarity problem over a polyhedral cone. Appl. Math. Optim. 52, 73–92 (2005)
Zhang, X.Z., Ma, F.M., Wang, Y.J.: A Newton-type algorithm for generalized linear complementarity problem over a polyhedral cone. Appl. Math. Comput. 169, 388–401 (2005)
Ferris, M.C., Mangasarian, O.L.: Error bound and strong upper semicontinuity for monotone affine variational inequalities. Computer Sciences Department, University of Wisconsin, Technical Report 1056 (1992)
Giannessi, F., Maugeri, A.: Variational Analysis and Applications. Springer, New York (2005)
Pang, J.S.: Error bounds in mathematical programming. Math. Program. 79, 299–332 (1997)
Luo, Z.Q., Mangasarian, O.L., Ren, J., Solodov, M.V.: New error bound for the linear complementarity problem. Math. Oper. Res. 19, 880–892 (1994)
Mangasarian, O.L., Ren, J.: New improved error bound for the linear complementarity problem. Math. Program. 66, 241–255 (1994)
Mangasarian, O.L., Shiau, T.H.: Error bounds for monotone linear complementarity problems. Math. Program. 36, 81–89 (1986)
Mangasarian, O.L.: Error bounds for nondegenerate monotone linear complementarity problems. Math. Program. 48, 437–445 (1990)
Mathias, R., Pang, J.S.: Error bound for the linear complementarity problem with a P-matrix. Linear Algebra Appl. 132, 123–136 (1990)
Zhang, J.Z., Xiu, N.H.: Global s-type error bound for extended linear complementarity problem and applications. Math. Program. (Ser. B) 88, 391–410 (2000)
Bazaraa, M.S., Sherali, H.D., Shetty, C.M.: Nonlinear Programming, Theory and Algorithms. Wiley, New York (1993)
Hoffman, A.J.: On the approximate solutions of linear inequalities. J. Res. Natl. Bur. Stand. 49, 263–265 (1952)
Yamashita, N., Fukushima, M.: On the rate of convergence of the Levenberg-Marquardt method. Computing (Suppl.) 15, 237–249 (2001)
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by F. Giannessi.
This work was supported by the Research Grant Council of Hong Kong, a Chair Professor Fund of The Hong Kong Polytechnic University, the Natural Science Foundation of China (Grant No. 10771120) and the Scientific Research Foundation for the Returned Overseas Chinese Scholars, State Education Ministry.
Rights and permissions
About this article
Cite this article
Sun, H.C., Wang, Y.J. & Qi, L.Q. Global Error Bound for the Generalized Linear Complementarity Problem over a Polyhedral Cone. J Optim Theory Appl 142, 417–429 (2009). https://doi.org/10.1007/s10957-009-9509-4
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10957-009-9509-4