%0 Journal Article
%T A new type of solution method for the generalized linear complementarity problem over a polyhedral cone<br>
%A Hong-Chun Sun
%A Yan-Liang Dong
%A <br>
%J 国际自动化与计算杂志
%D 2009
%I 
%X This paper addresses the generalized linear complementarity problem (GLCP) over a polyhedral cone. To solve the problem, we first equivalently convert the problem into an affine variational inequalities problem over a closed polyhedral cone, and then propose a new type of method to solve the GLCP based on the error bound estimation. The global and R-linear convergence rate is established. The numerical experiments show the efficiency of the method. This work was supported by National Natural Science Foundation of China (No. 10771120). Hong-Chun Sun received the B. Sc. degree in mathematics from Qufu Normal University (QNU), PRC, in 1990, and the M. Sc. degree in operations and cybernetics from QNU in 2005. Currently, he is an associated professor in the Department of Mathematics at Linyi Normal University, PRC. His research interests include nonlinear optimization. Yan-Liang Dong received the B. Sc. degree in mathematics from Shandong Normal University, PRC, in 2003. He is currently a master student in operations and cybernetics from Qufu Normal University, PRC. His research interests include algorithm for nonlinear programming.
%K Generalized linear complementarity problem (GLCP)
%K error bound
%K algorithm
%K global convergence
%K R-linear convergence rate<br>
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=7139AD613512F4F05F6D525B914296AA&aid=160BD6E92EE3F620FE9C1E92F4E736CB&yid=DE12191FBD62783C&vid=B31275AF3241DB2D&iid=38B194292C032A66&sid=CA5852BD1A173B3A&eid=FD7C952458BFB5D8&journal_id=1476-8186&journal_name=国际自动化与计算杂志&referenced_num=0&reference_num=9