Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/25906
Title: Global error bound for the generalized linear complementarity problem over a polyhedral cone
Authors: Sun, HC
Wang, YJ
Qi, LQ 
Keywords: GLCP
Global error bound
Reformulation
Solution structure
Issue Date: 2009
Publisher: Springer
Source: Journal of optimization theory and applications, 2009, v. 142, no. 2, p. 417-429 How to cite?
Journal: Journal of optimization theory and applications 
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.
URI: http://hdl.handle.net/10397/25906
ISSN: 0022-3239
EISSN: 1573-2878
DOI: 10.1007/s10957-009-9509-4
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

12
Last Week
0
Last month
0
Citations as of Aug 24, 2017

WEB OF SCIENCETM
Citations

7
Last Week
0
Last month
0
Citations as of Aug 21, 2017

Page view(s)

27
Last Week
2
Last month
Checked on Aug 20, 2017

Google ScholarTM

Check

Altmetric



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.