科研之友
微信
新浪微博
Facebook
分享链接
摘要
In this paper, we consider the generalized linear complementarity problem over a polyhedral cone arising in economics and engineering. For this problem, we first discuss its solution existence and then propose a potential reduction algorithm to solve it. The sparseness of the involved coefficient matrix is fully exploited in the computation of the algorithm and hence it has a relatively lower computational cost. The global convergence of the method is obtained under milder conditions. The given preliminary numerical experiments show the efficiency of the method.
- 出版日期2010-2
- 单位曲阜师范大学
