论文信息 - Further Discussion on the Error Bound for Generalized Linear Complementarity Problem over a Polyhedral Cone

Further Discussion on the Error Bound for Generalized Linear Complementarity Problem over a Polyhedral Cone

In this paper, we consider the global error bound for the generalized linear complementarity problem over a polyhedral cone (GLCP). Based on the new transformation of the problem, we establish its global error bound under milder conditions, which improves the result obtained by Sun and Wang (2009) for GLCP by weakening the assumption.

Hongchun Sun | Yiju Wang | Yiju Wang | Hongchun Sun

[1] Yiju Wang,et al. A Nonsmooth L-M Method for Solving the Generalized Nonlinear Complementarity Problem over a Polyhedral Cone , 2005 .

[2] M. Fukushima,et al. On the Rate of Convergence of the Levenberg-Marquardt Method , 2001 .

[3] Roberto Andreani,et al. On the Resolution of the Generalized Nonlinear Complementarity Problem , 2002, SIAM J. Optim..

[4] Olvi L. Mangasarian,et al. Error bounds for nondegenerate monotone linear complementarity problems , 1990, Math. Program..

[5] Charles R. Johnson,et al. Topics in Matrix Analysis , 1991 .

[6] Jong-Shi Pang,et al. Error bounds in mathematical programming , 1997, Math. Program..

[7] Yiju Wang,et al. A Newton-type algorithm for generalized linear complementarity problem over a polyhedral cone , 2005, Appl. Math. Comput..

[8] F. Facchinei,et al. Finite-Dimensional Variational Inequalities and Complementarity Problems , 2003 .

[9] Liqun Qi,et al. Global Error Bound for the Generalized Linear Complementarity Problem over a Polyhedral Cone , 2009, J. Optimization Theory and Applications.

[10] N. Xiu,et al. Global Projection-Type Error Bounds for General Variational Inequalities , 2002 .

[11] A. Hoffman. On approximate solutions of systems of linear inequalities , 1952 .