A Quadratically Convergent Algorithm for Generalized Linear Complementarity Problem On Supply Chain Equilibrium Model

被引：1
|
作者：
Sun, Hongchun [1 ]
机构：
[1] Linyi Normal Univ, Dept Math, Linyi 276005, Shandong, Peoples R China
来源：
2009 INTERNATIONAL SYMPOSIUM ON INTELLIGENT UBIQUITOUS COMPUTING AND EDUCATION | 2009年
关键词：
GLCP; supply chain equilibrium model; Global error bound; algorithm; quadratical convergence; NETWORK EQUILIBRIUM; POLYHEDRAL CONE; NEWTON METHODS; ERROR-BOUNDS;
D O I：
10.1109/IUCE.2009.110
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
In this paper, we consider the generalized Linear complementarity problem on supply chain equilibrium model(GLCP). To solve the problem, we first establish the global error bound for the GLCP, and then propose a new type of solution method to solve the GLCP based on the error bound estimation. The global and quadratic rate of convergence is established. These conclusions can be viewed as extensions of previously known results.
引用
收藏
页码：230 / 233
页数：4
相关论文
共 50 条
12345