doi: 10.4304/jsw.5.8.834-841
A New Type Algorithm for the Generalized Linear Complementarity Problem Over a Polyhedral Cone In Engineering and Equilibrium Modeling
Abstract—In this paper, we consider a new type algorithm for the generalized linear complementarity problem over a polyhedral cone in engineering and economic equilibrium modeling(GLCP). To this end, we first develop some equivalent reformulations of the problem under milder conditions, and then an easily computable global error bound for the GLCP is established, which can be viewed as extensions of previously known results. Based on this, we propose a new type of solution method to solve the GLCP, and show that the algorithm is global and R−linear convergence. Some numerical experiments of the algorithm are also reported in this paper.
Index Terms—GLCP, engineering and economic equilibrium modeling, global error bound; algorithm, globally convergent, R-linear convergent.
Cite: Hongchun Sun, "A New Type Algorithm for the Generalized Linear Complementarity Problem Over a Polyhedral Cone In Engineering and Equilibrium Modeling," Journal of Software vol. 5, no. 8, pp. 834-841, 2010.
General Information
ISSN: 1796-217X (Online)
Abbreviated Title: J. Softw.
Frequency: Quarterly
APC: 500USD
DOI: 10.17706/JSW
Editor-in-Chief: Prof. Antanas Verikas
Executive Editor: Ms. Cecilia Xie
Abstracting/ Indexing: DBLP, EBSCO,
CNKI, Google Scholar, ProQuest,
INSPEC(IET), ULRICH's Periodicals
Directory, WorldCat, etcE-mail: jsweditorialoffice@gmail.com
-
Oct 22, 2024 News!
Vol 19, No 3 has been published with online version [Click]
-
Jan 04, 2024 News!
JSW will adopt Article-by-Article Work Flow
-
Apr 01, 2024 News!
Vol 14, No 4- Vol 14, No 12 has been indexed by IET-(Inspec) [Click]
-
Apr 01, 2024 News!
Papers published in JSW Vol 18, No 1- Vol 18, No 6 have been indexed by DBLP [Click]
-
Jun 12, 2024 News!
Vol 19, No 2 has been published with online version [Click]